Elsevier

Parallel Computing

Volume 6, Issue 3, March 1988, Pages 325-337
Parallel Computing

Geometric specification of scheduling constraints: A simplified approach to multiprocessing

https://doi.org/10.1016/0167-8191(88)90073-7Get rights and content

Abstract

As multiprocessors become commercially available, a great deal of concern is being focused on the problems involved in writing and debugging software for such machines. Earlier work described the use of monitors implemented by macro processors to attain portable code. This work formulates a general-purpose monitor which simplifies the programming of a wide class of numeric algorithms. In this paper, we propose a straightforward programming paradigm for describing ‘schedulable units of computation’ that allows the description of many algorithms with very little effort.

References (8)

There are more references available in the full text version of this article.

Cited by (1)

This work was supported in part by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under contract W-31-109-Eng-38.

View full text