A concurrent functional language is presented, Parlam, which includes primitives for explicit control of parallel reductions. An abstract machine for Parlam (ParSEC) is derived from Landin's SECD machine by extending it for dealing with parallel computation. Several issues and problems about its implementation on a massively parallel computer are discussed and a specific implementative model for ParSEC under the Connection Machine is described.
The connection machine opportunity for the implementation of a concurrent functional language / C. Bettini, L. Spampinato. - In: FUTURE GENERATION COMPUTER SYSTEMS. - ISSN 0167-739X. - 7:2-3(1992), pp. 231-245. [10.1016/0167-739X(92)90010-9]
The connection machine opportunity for the implementation of a concurrent functional language
C. BettiniPrimo
;
1992
Abstract
A concurrent functional language is presented, Parlam, which includes primitives for explicit control of parallel reductions. An abstract machine for Parlam (ParSEC) is derived from Landin's SECD machine by extending it for dealing with parallel computation. Several issues and problems about its implementation on a massively parallel computer are discussed and a specific implementative model for ParSEC under the Connection Machine is described.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
