In this paper they deal with the issue of specification and design of parallel communicatingprocesses. A trace-state based model is introduced to describe the behaviour of concurrent programs. They presenta formal sys...In this paper they deal with the issue of specification and design of parallel communicatingprocesses. A trace-state based model is introduced to describe the behaviour of concurrent programs. They presenta formal system based on that model to achieve hierarchical and modular development and verification methods. Anumber of refinement rules are used to decompose the specification into smaller ones and calculate program fromthe展开更多
The GAMMA paradigm is recently proposed by Banatre and M6tayer to describe the systematic construction of parallel programs without introducing artificial sequentiality. This paper presents two synchronous execution m...The GAMMA paradigm is recently proposed by Banatre and M6tayer to describe the systematic construction of parallel programs without introducing artificial sequentiality. This paper presents two synchronous execution models for GAMMA and discusses how to implement them on MasPar MP-1, a massively data parallel computer. The results show that GAMMA paradigm can be implemented very naturally on data parallel machines, and very high level language, such as GAMMA in which parallelism is left implicit, is suitable for specifying massively parallel applications.展开更多
基金ESPRIT Basic Research ProCoS project 3104 and 7071
文摘In this paper they deal with the issue of specification and design of parallel communicatingprocesses. A trace-state based model is introduced to describe the behaviour of concurrent programs. They presenta formal system based on that model to achieve hierarchical and modular development and verification methods. Anumber of refinement rules are used to decompose the specification into smaller ones and calculate program fromthe
文摘The GAMMA paradigm is recently proposed by Banatre and M6tayer to describe the systematic construction of parallel programs without introducing artificial sequentiality. This paper presents two synchronous execution models for GAMMA and discusses how to implement them on MasPar MP-1, a massively data parallel computer. The results show that GAMMA paradigm can be implemented very naturally on data parallel machines, and very high level language, such as GAMMA in which parallelism is left implicit, is suitable for specifying massively parallel applications.