Programming with Ada: an introduction by means of graduated examples
Programming with Ada: an introduction by means of graduated examples
The sciences of the artificial (3rd ed.)
The sciences of the artificial (3rd ed.)
Asynchronous Iterative Methods for Multiprocessors
Journal of the ACM (JACM)
Iterative solution of nonlinear equations in several variables
Iterative solution of nonlinear equations in several variables
Communicating sequential processes
Communications of the ACM
Distributed processes: a concurrent programming concept
Communications of the ACM
Toward a discipline of real-time programming
Communications of the ACM
ADA Programming Language
Rationale for the design of the Ada programming language
ACM SIGPLAN Notices - Rationale for the deisgn of the Ada programming language
| Hi-index | 0.00 |
This paper presents a pragmatic example of how to use Ada tasks with Add machines such as SuperMicro(TM) for scientific computing. First, a class of asynchronous concurrent Newton's algorithms: Purely-Asynchronous (PAN), Asynchronous (AN), and Semi-Asynchronous (SAN) algorithms are introduced for distributed computing environment. A sufficient condition is shown to guarantee local convergence of these asynchronous algorithms. Moreover, it is proved that the PAN algorithm is linearly convergent, the AN algorithm is super-linearly convergent, and the SAN algorithm is quadratically convergent. The order of convergence depends on the degree of interaction among computing modules. Second, a non-deterministic program for the asynchronous algorithm is provided by using Ada tasks. The asynchronous algorithm/program is superior to the synchronized counterpart with respect to computation speed and reliability. Lastly, this paper describes a way where the asynchronous algorithm/program can be realized as a hierarchic distributed system with Ada machines. A preliminary result is shown with MicroAda/SuperMicro(TM).