Skip Navigation

The Computer Journal 1991 34(4):302-310; doi:10.1093/comjnl/34.4.302
© 1991 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Skillicorn, D. B.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Practical Concurrent Programming for Parallel Machines

D. B. Skillicorn *

Department of Computing and Information Science, Queen's University, Kingston, Canada K7L 3N6

Concurrent programming has been viewed as an activity in which a knowledge of the target machine architecture is indispensable to building efficient software. The variety of possible parallel machines has spawned of corresponding variety of concurrent languages for programming them. This has prevented the significant use of parallelism in all but high-end numerical computation because it has not been clear which approach was best.

Much of the confusion could be dispensed with if concurrent programming languages that were independent of the particular target architecture could be found. Despite some scepticism about this possibility, several such languages now exist. We survey them and discuss their merits and drawbacks.

Architecture independent programming languages can be divided into two broad classes: those that are based on the PRAM model or some extension of it; and those which dispense with a need for explicit storage management and scheduling. Languages in the former class guarantees of performance but require much of the programmer; those in the latter do not provide performance guarantees but are much less demanding to use.


Received July 1990.

* This work was supported by the Natural Science ans Engineering Research Counsil of Canada

§ Department of Computing and Information Science, Queen's University, Kingston, Canada K7L 3N6


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.