TY - GEN
T1 - A dataflow language with object-based extension and its implementation on a commercially available parallel machine
AU - Kusakabe, Shigeru
AU - Nagai, Taku
AU - Yamashita, Yoshihiro
AU - Taniguchi, Rin Ichiro
AU - Amamiya, Makoto
N1 - Funding Information:
We thank Fujitsu Laboratory for providing the opportunity to use the AP1OOO. This research was partly supported in-Aid for Scientific Research on Priority
Publisher Copyright:
© 1995 ACM.
Copyright:
Copyright 2018 Elsevier B.V., All rights reserved.
PY - 1995/7/3
Y1 - 1995/7/3
N2 - We propose a massively parallel programming language, called "V," which would minimize the difficulties in writing massively parallel programs. To abstract away the timing problem in writing parallel programs, we based our work on a dataflow-based functional programming language. Then, we extended the base language with an object-based abstraction, called "agent," to write parallel entities which contain their own states and can communicate with each other. In addition to connecting agents explicitly, an abstraction of ensembles of agents on a predefined topology description, called "field," is introduced in order to write a massively parallel program which naturally reflects the structure of a problem. In this paper, we also discuss the implementation of V, including a preliminary evaluation, on a commercially available distributed-memory parallel machine, Fujitsu AP1000. Although it is easy to extract parallelism at various levels, including finegrained parallelism, from V programs, it is difficult to run V programs efficiently on stock parallel machines. Nevertheless, we tried to implement V on a stock parallel machine, since our aim is to develop a language that would be practical, not only on special fine-grained machines, but also stock machines.
AB - We propose a massively parallel programming language, called "V," which would minimize the difficulties in writing massively parallel programs. To abstract away the timing problem in writing parallel programs, we based our work on a dataflow-based functional programming language. Then, we extended the base language with an object-based abstraction, called "agent," to write parallel entities which contain their own states and can communicate with each other. In addition to connecting agents explicitly, an abstraction of ensembles of agents on a predefined topology description, called "field," is introduced in order to write a massively parallel program which naturally reflects the structure of a problem. In this paper, we also discuss the implementation of V, including a preliminary evaluation, on a commercially available distributed-memory parallel machine, Fujitsu AP1000. Although it is easy to extract parallelism at various levels, including finegrained parallelism, from V programs, it is difficult to run V programs efficiently on stock parallel machines. Nevertheless, we tried to implement V on a stock parallel machine, since our aim is to develop a language that would be practical, not only on special fine-grained machines, but also stock machines.
UR - http://www.scopus.com/inward/record.url?scp=0029206398&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0029206398&partnerID=8YFLogxK
U2 - 10.1145/224538.224575
DO - 10.1145/224538.224575
M3 - Conference contribution
AN - SCOPUS:0029206398
T3 - Proceedings of the International Conference on Supercomputing
SP - 308
EP - 317
BT - Proceedings of the 9th International Conference on Supercomputing, ICS 1995
PB - Association for Computing Machinery
T2 - 9th International Conference on Supercomputing, ICS 1995
Y2 - 3 July 1995 through 7 July 1995
ER -