By Topic

A method for the design of parallel algorithms a case study: solving triangular systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chaudron, M.R.V. ; Dept. of Comput. Sci., Leiden Univ., Netherlands ; van Duin, A.C.N.

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

Published in:

System Sciences, 1997, Proceedings of the Thirtieth Hawaii International Conference on  (Volume:1 )

Date of Conference:

7-10 Jan 1997