Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
Renaming in an asynchronous environment
Journal of the ACM (JACM)
Towards a Compositional Method for Coordinating Gamma Programs
COORDINATION '96 Proceedings of the First International Conference on Coordination Languages and Models
Gamma and the Chemical Reaction Model: Fifteen Years After
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Lightweight Probabilistic Broadcast
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Adaptive atomic capture of multiple molecules
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
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.