This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
30th Hawaii International Conference on System Sciences (HICSS) Volume 1: Software Technology and Architecture
Maui, Hawaii
January 03-January 06
ISBN: 0-8186-7743-0
Michel R. V. Chaudron, Department of Computer Science, Leiden University
Arno C. N. van Duin, Department of Computer Science, Leiden University

This paper illustrates a method for the design of parallel programs that is based on the separation of computation and coordination.

We use Gamma programs to specify computations and show how to prove their correctness using a UNITY like programming logic. A separate coordination language is used to determine behavioural aspects of the program. We illustrate how behaviour can be structured through a process of successive stepwise refinements. Reasoning about refinement is supported formally by two types of simulation.

As an illustration of our method we study the problem of solving triangular systems of linear equations. For this problem we derive a number of known algorithms and show how they are related by our refinement ordering.

Citation:
Michel R. V. Chaudron, Arno C. N. van Duin, "A Method for the Design of Parallel Algorithms A Case Study: Solving Triangular Systems," hicss, vol. 1, pp.320, 30th Hawaii International Conference on System Sciences (HICSS) Volume 1: Software Technology and Architecture, 1997
Usage of this product signifies your acceptance of the Terms of Use.