|
ABSTRACT
Tuple spaces are a common platform for the coordination of agents. In the past years there have been several approaches of improving the concept of coordination via the shared space. However, some of those concepts, like the Programmable Matching Engine, were primarily concentrating on retrieving tuples from the space with improved query techniques. In this paper, we propose the concept of structured spaces, so called Space Containers, which allow to store tuples in a customizable structured way. The concept of a Space Container allows a) to distinguish between the data needed for coordination purposes only and the payload, b) enables an explicitly structured way of storage and retrieval of the stored data, and c) the realization of more complex coordination patterns. The benefits of the proposed approach are a) less complex agent implementations, and b) the possibility of an efficient implementation of coordination issues. We describe the architecture of the proposed approach, explain the benefits of it by means of a scenario from the production automation domain and show evaluation results.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
|
| |
3
|
S. Capizzi. A tuple space implementation for large-scale infrastructures. Technical report, Department of Computer Science, University of Bologna, March 2008.
|
 |
4
|
|
| |
5
|
M. Cremonini, A. Omicini, and F. Zambonelli. Coordination and access control in open distributed agent systems: The tucson approach, 2000.
|
| |
6
|
|
| |
7
|
|
 |
8
|
|
 |
9
|
|
 |
10
|
|
| |
11
|
|
| |
12
|
|
| |
13
|
K. Kemppainen. Priority scheduling revisited - dominant rules, open protocols and integrated order management. PhD thesis, Acta Universitatis oeconomicae Helsingiensis. A, December 2005.
|
| |
14
|
|
| |
15
|
|
| |
16
|
E. Kühn, R. Mordinyi, and C. Schreiber. An extensible space-based coordination approach for modeling complex patterns in large systems. 3rd International Symposium on Leveraging Applications of Formal Methods, Verification and Validation, Special Track on Formal Methods for Analysing and Verifying Very Large Systems, 2008.
|
| |
17
|
A. Lãijder, J. Peschke, T. Sauter, S. Deter, and D. Diep. Distributed intelligence for plant automation based on multi-agent systems: the pabadis approach. Production Planning and Control, 15:201--212, 2004.
|
| |
18
|
Tobin J. Lehman , Alex Cozzi , Yuhong Xiong , Jonathan Gottschalk , Venu Vasudevan , Sean Landis , Pace Davis , Bruce Khavar , Paul Bowman, Hitting the distributed computing sweet spot with TSpaces, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.35 n.4, p.457-472, March 2001
[doi> 10.1016/S1389-1286(00)00178-X]
|
 |
19
|
|
| |
20
|
C. Rajendran and O. Holthaus. A comparative study of dispatching rules in dynamic flowshops and jobshops. European Journal of Operational Research, 116(1):156--170, July 1999.
|
| |
21
|
R. Tolksdorf, F. Liebsch, and D. M. Nguyen. Xmlspaces.net: An extensible tuplespace as xml middleware. In In Report B 03-08, Free University Berlin, ftp://ftp.inf.fu-berlin.de/pub/reports/tr-b-0308.pdf, 2003. Open Research Questions in SOA 5-25 and Loose Coupling in Service Oriented Architectures, 2004.
|
| |
22
|
|
| |
23
|
|
| |
24
|
G. C. Wells. Coordination languages: Back to the future with linda. Proceedings of the Second International Workshop on Coordination and Adaption Techniques for Software Entities (WCAT05), pages 87--98, 2005.
|
| |
25
|
|
| |
26
|
|
|