A scalable tuple space model for structured parallel programming

Author

Corradi, Antonio ; Zambonelli, Franco ; Leonardi, Letizia

Author_Institution

Dipartimento di Elettronica Inf. e Sistemistica, Bologna Univ., Italy

fYear

1995

fDate

9-12 Oct 1995

Firstpage

25

Lastpage

32

Abstract

The paper proposes and analyses a scalable model of an associative distributed shared memory for massively parallel architectures. The proposed model is hierarchical and fits the modern style of structured parallel programming. If parallel applications are composed of a set of modules with a well-defined scope of interaction, the proposed model can induce a memory access latency time that only logarithmically increases with the number of nodes. Experimental results show the effectiveness of the model with a transputer-based implementation

Keywords

content-addressable storage; memory architecture; parallel architectures; parallel programming; structured programming; associative distributed shared memory; massively parallel architectures; memory access latency time; scalable tuple space model; structured parallel programming; transputer-based implementation; Computational modeling; Delay; Electronic mail; File servers; Modems; Parallel architectures; Parallel programming; Proposals; Scalability; Supercomputers;

fLanguage

English

Publisher

ieee

Conference_Titel

Programming Models for Massively Parallel Computers, 1995

Conference_Location

Berlin

Print_ISBN

0-8186-7177-7

Type

conf

DOI

10.1109/PMMPC.1995.504338

Filename

504338