Pisa parallel processing project on general-purpose highly-parallel computers

Baiardi, Fabrizio; Danelutto, Marco; Meglio, Robert Di; Jazayeri, Mehdi; Mackey, Mark; Pelagatti, Susanna; Petrini, Fabrizio; Sullivan, T. D.; Vanneschi, Marco

doi:10.1109/cmpsac.1991.170236

Cited by 5 publications

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The possibility to visualize the logical structure of a complex program, and thus also the composition of various constructs, is very useful during the development of the program. 3 The target architecture and its abstract machine The most suitable architectures are also known as multicomputers 18], or DM-MIMD machines. Since the class of the k-ary n-cubes 6] includes many of the most interesting DM-MIMD machines, e.g.…”

Section: Introductionmentioning

confidence: 99%

P³L: A structured high‐level parallel language, and its structured support

Bacci

Danelutto

Orlando

et al. 1995

Concurrency: Pract. Exper.

134

View full text Add to dashboard Cite

This paper presents a parallel programming methodology that ensures easy programming, e ciency, and portability of programs to di erent m a c hines belonging to the class of the generalpurpose, distributed memory, MIMD architectures. The methodology is based on the de nition of a new, high-level, explicitly parallel language, called P 3 L, and of a set of static tools that automatically adapt the program features for each target architecture. P 3 L does not require programmers to specify process activations, the actual parallelism degree, scheduling, or interprocess communications, i.e. all those features that need to be adjusted to harness each speci c target machine. Parallelism is, on the other hand, expressed in a structured and qualitative w ay, b y hierarchical composition of a restricted set of language constructs, corresponding to those forms of parallelism that are frequently encountered in parallel applications, and that can e ciently be implemented.The e cient portability o f P 3 L applications is guaranteed by the compiler along with the novel structure of the support. The compiler automatically adapts the program features for each speci c architecture, accessing the costs (in terms of performance) of the low-level mechanisms exported by t h e a r c hitecture itself. In our methodology, these costs, along with other features of the architecture, are viewed through an abstract machine, whose mechanism interface is used by the compiler to produce the nal object code.1

show abstract

Section: Introductionmentioning

confidence: 99%