For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
BPL: A Language for Parallel Algorithms on the Butterfly Network
Fattaneh TAGHIYAREH Hiroshi NAGAHASHI
IEICE TRANSACTIONS on Information and Systems
Publication Date: 2000/07/25
Print ISSN: 0916-8532
Type of Manuscript: PAPER
parallel algorithms, parallel processing , butterfly network, parallel languages,
Full Text: PDF>>
A number of parallel algorithms have been developed to solve large-scale real world problems. Although there has been much work on the design of parallel algorithms, there has been little on the design of languages for expressing these algorithms. This paper describes the BPL, a new parallel language designed for butterfly networks. The purpose of this language is to help designers in hiding the complexity of the algorithm and leaving details of mapping between data and processors for lower level. BPL provides a simpler virtual machine for the designer , in order to avoid thinking about control of processors and data. From another point of view, BPL helps designer to logically check the algorithm and correct any possible error in it. The paper gives some examples implemented by this language. In addition, we have also implemented a software tool which simulates the running of the algorithm on the network. The results lead us to believe that this language would be useful in representing all kinds of algorithms on this network including normal algorithms and others.