The Community for Technology Leaders
Parallel Processing Symposium, International (1994)
Cancun, Mexico
Apr. 27, 1994 to Apr. 27, 1994
ISBN: 0-8186-5602-6
pp: 323-328
Lin , NEC Res. Inst., Princeton, NJ, USA
ABSTRACT
A multiparadigm parallel programming system is described in this paper. The system supports a specification language that can conveniently encode a fork-join graph by which many parallel applications are representable. The language, called parScript, mandates the separation of parallel control from sequential codes that perform the actual computation, resulting in a program that is concise, portable, and yet efficient. We investigate the feasibility of this approach by building a prototype system on a NUMA multiprocessor. Experimental data shows that the performance of parScript programs can be comparable to that of their C counterparts, both on uniprocessors and on NUMA multiprocessors.
INDEX TERMS
parallel codes, sequential codes, pyramid approach, multiparadigm parallel programming system, specification language, fork-join graph, parallel applications, parScript, parallel control, portable program, prototype system, NUMA multiprocessor, parScript program performance, uniprocessors, NUMA multiprocessors, C language
CITATION

Lin and Zhou, "Decoupling parallel and sequential codes: the pyramid approach," Parallel Processing Symposium, International(IPPS), Cancun, Mexico, 1994, pp. 323-328.
doi:10.1109/IPPS.1994.288282
82 ms
(Ver 3.3 (11022016))