A parallel virtual machine for bulk synchronous parallel ML

被引:0
作者
Gava, F [1 ]
Loulergue, F [1 ]
机构
[1] Univ Paris 12, Lab Algorithms Complex & Log, F-94010 Creteil, France
来源
COMPUTATIONAL SCIENCE - ICCS 2003, PT I, PROCEEDINGS | 2003年 / 2657卷
关键词
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We have designed a functional data-parallel language called BSML for programming bulk-synchronous parallel (BSP) algorithms. The execution time can be estimated and dead-locks and indeterminism are avoided. The BSMLlib library has been implemented for the Objective Caml language. But there is currently no full implementation of such a language and an abstract machine is needed to validate such an implementation. Our approach is based on a bytecode compilation to a parallel abstract machine performing exchange of data and synchronous requests derived from the ZAM, the efficient abstract machine of the Objective Caml language.
引用
收藏
页码:155 / 164
页数:10
相关论文
共 18 条
[1]  
[Anonymous], 1987, IMPLEMENTATION FUNCT
[2]  
Appel Andrew W., 1992, Compiling with Continuations
[3]  
CARDELLI L, 1984, 1984 ACM S LISP FUNC, P208
[4]  
COUSINEAU G, 1990, 122 INRIA
[5]  
GAVA F, 2003, J FRANCOPHONES LANGA
[6]  
Hardin T., 1998, Journal of Functional Programming, V8, P131, DOI 10.1017/S0956796898002986
[7]   MECHANICAL EVALUATION OF EXPRESSIONS [J].
LANDIN, PJ .
COMPUTER JOURNAL, 1964, 6 (04) :308-&
[8]  
LEROY X, 2002, OBJECTIVE CAML SYSTE
[9]  
LEROY X, 1991, ZINC EXPT EC IMPLEME
[10]  
LEROY X, 1995, 2721 INRIA