Evaluation of a set of message- passing routines on transputer networks
Authors: Cai, Wentong, Skillicorn, David B.
A major obstacle to the use of parallel computers in ordinary applications, where their price/performance ratio should make them attractive, is the sheer difficulty of parallel programming. One approach which can ease the difficulties is data parallel programming, because of the simplicity of a single-threaded flow of control. Data parallelism also expresses parallelism with enough regularity to be readily implemented across a range of machine types. In this paper, we describe a data parallel model based on a set of second order functions from the Bird-Meertens theory of lists, demonstrate the implementation of these functions as a set of message-passing routines, and evaluate their performance on transputer networks configured as hy-percubes.
Proceedings of WoTUG-15: Transputer Systems - ongoing Research, Alastair R. Allen, 1992, pp 24 - 36 published by IOS Press, Amsterdam
This record in other formats:Web page: BibTEX, Refer
Plain text: BibTEX, Refer
If you have any comments on this database, including inaccuracies, requests to remove or add information, or suggestions for improvement, the WoTUG web team are happy to hear of them. We will do our best to resolve problems to everyone's satisfaction.
Copyright for the papers presented in this database normally resides with the authors; please contact them directly for more information. Addresses are normally presented in the full paper.
Pages © WoTUG, or the indicated author. All Rights Reserved.
Comments on these web pages should be addressed to: www at wotug.org