Abstract
Bulk Synchronous Parallel ML or BSML is a functional data-parallel language for programming bulk synchronous parallel (BSP) algorithms. The execution time can be estimated and dead-locks and indeterminism are avoided. For large scale applications, more than one parallel machine is needed. We consider here the design and cost-model of a BSML-like language devoted to the programming of such applications: Departmental Metacomputing ML or DMML.
Chapter PDF
Similar content being viewed by others
References
Aumage, O., Bougé, L., et al.: Madeleine II: A Portable and Efficient Communication Library. Parallel Computing 28(4), 607–626 (2002)
Martin, J.M.R., Tiskin, A.: BSP modelling a two-tiered parallel architectures. In: Cook, B.M. (ed.) WoTUG 1999, pp. 47–55 (1999)
Roda, J.L., et al.: Predicting the execution time of Message Passing Models. Concurrency: Practice and Experience 11(9), 461–477 (1999)
Skillicorn, D.B., Hill, J.M.D., McColl, W.F.: Questions and Answers about BSP. Scientific Programming 6(3) (1997)
Williams, T.L., Parsons, R.J.: Informatics: 10 Years Back, 10 Years Ahead. LNCS, vol. 2000, pp. 112–118. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gava, F. (2004). Design of Departmental Metacomputing ML. In: Bubak, M., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science - ICCS 2004. ICCS 2004. Lecture Notes in Computer Science, vol 3038. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24688-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-24688-6_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22116-6
Online ISBN: 978-3-540-24688-6
eBook Packages: Springer Book Archive