Probabilistic and Prioritized Data Retrieval in the Linda Coordination Model
Linda tuple spaces are flat and unstructured, in the sense that they do not allow for expressing preferences of tuples; for example, we could be interested in indicating tuples that should be returned more frequently w.r.t. other ones, or even tuples with a low relevance that should be taken under consideration only if there is no tuple with a higher importance. In this paper we investigate, in a process algebraic setting, how probabilities and priorities can be introduced in the Linda coordination model in order to support a more sophisticated data retrieval mechanism. As far as probabilities are concerned, we show that the Linda pattern-matching data retrieval makes it necessary to deal with weights instead of just pure probabilities, as instead can be done in standard process algebras. Regarding priorities, we present two possible ways for adding them to Linda; in the first one the order of priorities is statically fixed, in the second one it is dynamically instantiated when a data-retrieval operation is executed.
KeywordsPriority Level Parallel Composition Shared Space Expiration Time Probabilistic Access
Unable to display preview. Download preview PDF.
- 1.Bravetti, M.: Specification and Analysis of Stochastic Real-Time Systems. PhD thesis, Dottorato di Ricerca in Informatica. Università di Bologna, Padova, Venezia, Available at (February 2002), http://www.cs.unibo.it/~bravetti/
- 2.Bravetti, M., Bernardo, M.: Compositional asymmetric cooperations for process algebras with probabilities, priorities, and time. In: Proc. of the 1st Int. Workshop on Models for Time-Critical Systems, MTCS 2000, State College (PA). Electronic Notes in Theoretical Computer Science, vol. 39(3). Elsevier, Amsterdam (2000)Google Scholar
- 3.Bravetti, M., Gorrieri, R., Lucchi, R., Zavattaro, G.: Web Services for E-commerce: guaranteeing security access and quality of service. In: Proc. of ACM Symposium on Applied Computing (SAC 2004), ACM Press, New York (2004)Google Scholar
- 4.Busi, N., Gorrieri, R., Lucchi, R., Zavattaro, G.: Secspaces: a data-driven coordination model for environments open to untrusted agents. In: 1st International Workshop on Foundations of Coordination Languages and Software Architectures. ENTCS, vol. 68.3 (2002)Google Scholar
- 5.Scientific Computing Associates. Linda: User’s guide and reference manual. Scientific Computing Associates (1995)Google Scholar
- 6.Minsky, N., Minsky, Y., Ungureanu, V.: Safe Tuplespace-Based Coordination in Multi Agent Systems. Journal of Applied Artificial Intelligence 15(1) (2001)Google Scholar
- 7.De Nicola, R., Ferrari, G., Pugliese, R.: KLAIM: A Kernel Language for Agents Interaction and Mobility. IEEE Transactions on Software Engineering 24(5), 315–330 (1998); Special Issue: Mobility and Network Aware ComputingGoogle Scholar
- 8.Di Pierro, A., Hankin, C., Wiklicky, H.: Probabilistic Klaim. In: Proc. of 7th International Conference on Coordination Models and Languages (Coordination 2004). LNCS. Springer, Heidelberg (2004)Google Scholar
- 10.Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (1995)Google Scholar