Premium
Strategies and protocols for highly parallel Linda servers
Author(s) -
Corradi Antonio,
Leonardi Letizia,
Zambonelli Franco
Publication year - 1998
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/(sici)1097-024x(19981210)28:14<1493::aid-spe211>3.0.co;2-5
Subject(s) - computer science , tuple space , abstraction , scalability , distributed computing , tuple , replication (statistics) , server , parallel computing , locality , overhead (engineering) , massively parallel , scope (computer science) , theoretical computer science , computer network , operating system , programming language , philosophy , statistics , linguistics , mathematics , epistemology , discrete mathematics
The tuple space abstraction is a powerful and general coordination model for parallel and distributed programming. However, this model is based on the abstraction of a global space, difficult to implement in distributed memory parallel systems with high‐performance and scalability. The paper discusses the possible distribution strategies to implement a tuple space server and proposes a new replication policy suitable for massively parallel systems. The proposed strategy achieves scalability by organising the system in a hierarchical way and by integrating coherence protocols of limited overhead. Moreover, the chosen organisation encourages the presence of multiple tuple spaces each with a constrained scope. The paper describes and analyses a transputer‐based implementation: the hierarchical organisation of the tuple space makes the access time proportional to the locality of the references and bounded by the logarithm of the system size. © 1998 John Wiley & Sons, Ltd.