Abstract
Minimally Synchronous Parallel ML is a functional parallel language whose execution time can then be estimated and dead-locks and indeterminism are avoided. Programs are written as usual ML programs but using a small set of additional functions. Provided functions are used to access the parameters of the parallel machine and to create and operate on a parallel data structure. It follows the cost model of the Message Passing Machine model (MPM).
In the current implementation, the asynchrony is limited by a parameter called the asynchrony depth. When processes reach this depth a global synchronization occurs. This is necessary to avoid memory leak. In this paper we propose another mechanism to avoid such synchronization barriers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Beauquier and A. Slissenko. A first order logic for specification of timed algorithms: basic properties and a decidable class. Annals of Pure and Applied Logic, 113, 2002.
O. Bonorden, B. Juurlink, I. von Otte, and O. Rieping. The Paderborn University BSP (PUB) library. Parallel Computing, 29(2): 187–207, 2003.
E. Chailloux and C. Foisy. A Portable Implementation for Objective Caml Flight. Parallel Processing Letters, 13(3):425–436, 2003.
F. Dehne. Special issue on coarse-grained parallel algorithms. Algorithmica, 14, 1999.
F. Gava and F. Loulergue. A Polymorphic Type System for Bulk Synchronous Parallel ML. In PaCT 2003, number 2763 in LNCS, pp. 215–229. Springer, 2003.
P. Glavan and D. Rosenzweig. Communicating Evolving Algebras. In Computer Science Logic, number 702 in LNCS, pp. 182–215. Springer, 1993.
Y. Gurevich. Evolving Algebras 1993: Lipari Guide. In Specification and Validation Methods, pp. 9–36. Oxford University Press, 1995.
Z. Hu, H. Iwasaki, and M. Takeichi. An accumulative parallel skeleton for all. In European Symposium on Programming, number 2305 in LNCS, pp. 83–97. Springer, 2002.
R. Jones. Garbage Collection: algorithms for automatic dynamic memory management. Wiley, 1999.
Jin-Soo Kim, Soonhoi Ha, and Chu Shik Jhon. Relaxed barrier synchronization for the BSP model of computation on message-passing architectures. Information Processing Letters, 66(5):247–253, 1998.
Xavier Leroy. The Objective Caml System 3.07, 2003. web pp. at www.ocaml.org.
F. Loulergue. Implementation of a Functional Bulk Synchronous Parallel Programming Library. In 14th IASTED PDCS Conference, pp. 452–457. ACTA Press, 2002.
F. Loulergue. Management of Communication Environments for Minimally Synchronous Parallel ML. Technical Report 2004-06, University of Paris 12, LACL, 2004.
F. Loulergue, F. Gava, M. Arapinis, and F. Dabrowski. Semantics and Implementation of Minimally Synchronous Parallel ML. International Journal of Computer & Information Science, 2004. to appear.
David Plainfossé and Marc Shapiro. A survey of distributed garbage collection techniques. In Proc. Int. Workshop on Memory Management, 1995.
J. L. Roda, C. Rodríguez, D. G. Morales, and F. Almeida. Predicting the execution time of message passing models. Concurrency: Practice and Experience, 11(9):461–477, 1999.
D. B. Skillicorn, J. M. D. Hill, and W. F. McColl. Questions and Answers about BSP. Scientific Programming, 6(3):249–274, 1997.
M. Snir and W. Gropp. MPI the Complete Reference. MIT Press, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science + Business Media, Inc.
About this chapter
Cite this chapter
Loulergue, F. (2005). Management of Communication Environments for Minimally Synchronous Parallel ML. In: Juhász, Z., Kacsuk, P., Kranzlmüller, D. (eds) Distributed and Parallel Systems. The International Series in Engineering and Computer Science, vol 777. Springer, Boston, MA. https://doi.org/10.1007/0-387-23096-3_21
Download citation
DOI: https://doi.org/10.1007/0-387-23096-3_21
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23094-8
Online ISBN: 978-0-387-23096-2
eBook Packages: EngineeringEngineering (R0)