Imprecise Computations in Ada
Abstract
The goal of this research was to investigate all possible approaches to implementing imprecise computations in Ada. Two approaches emerged out of a central idea. The synchronous and asynchronous versions of the atomic computation loop approach were distinguished because of early timing concerns regarding the rendezvous. Both versions were implemented in standard Ada code. Each version was demonstrated using the Monte Carlo circle example and the Jacobi example. Each sample was painstakingly constructed in a straightforward manner. These examples illustrated that the synchronous and asynchronous approaches were better suited for different imprecise computation applications. But more importantly, the examples showed that implementing imprecise computations in Ada is entirely possible. Ada programming language.
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 01, 1989
- Accession Number
- ADA218735
Entities
People
- Gary J. Gregory
Organizations
- Air Force Institute of Technology