Abstract
This paper proposes an implementation of the data structure called bag or multiset used by descriptive programming languages (e.g. Gamma, Linda) over an open system. In this model, a succession of ”chemical reactions” consumes the elements of the bag and produces new elements according to specific rules. This approach is particularly interesting as it suppresses all unneeded synchronization and reveals all the potential parallelism of a program. An efficient implementation of a bag provides an efficient implementation of the subsequent program. This paper defines a new communication and synchronization model adapted from workqueues used in parallel computing. The proposed model allows to benefit from the potential parallelism offered by this style of programming when only an approximate solution is needed.
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
Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuk, R.: Renaming in an Asynchronous Environment. Journal of the ACM 37(3), 524–548 (1990)
Banatre, J.P., Fradet, P., Le Metayer, D.: Gamma and the chemical reaction model: Fifteen years after. In: Calude, C.S., Pun, G., Rozenberg, G., Salomaa, A. (eds.) Multiset Processing. LNCS, vol. 2235, pp. 17–44. Springer, Heidelberg (2001)
Chaudron, C., de Jong, E.: Towards a compositional method for coordinating Gamma programs. In: Hankin, C., Ciancarini, P. (eds.) COORDINATION 1996. LNCS, vol. 1061, pp. 107–123. Springer, Heidelberg (1996)
Eugster, P., Handurukande, S., Guerraoui, R., Kermarrec, A.M., Kouznetsov, P.: Lightweight probabilistic broadcast. In: Proc. DSN 2001 (July 2001)
Gelertner, D.: Generative communication in Linda. ACM TOPLAS 7(1), 80–112 (1985)
Gladitz, K., Kuchen, H.: Parallel implementqtion of the Gamma-operation on bags. In: Proc. ofthe PASCO Conference, Linz, Austria (1994)
Rabin, M.: Randomized Byzantine Generals. In: Proc. 24th IEEE Symposium on Foundations of Computer Science (FOCS 1983), pp. 403–409, Tucson (AZ) (1983)
Sun Microsystems, JavaSpace Specification (March 1998), http://java.sun.com/products/jini/specs
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mostefaoui, A. (2007). Towards a Computing Model for Open Distributed Systems. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2007. Lecture Notes in Computer Science, vol 4671. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73940-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-73940-1_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73939-5
Online ISBN: 978-3-540-73940-1
eBook Packages: Computer ScienceComputer Science (R0)