A programming aid for hypercube architectures

A program development tool that automatically performs scheduling and synchronization insertion for hypercube systems is presented in this paper. We use a programming methodology in which a program is written as a set of procedures called from the main program. This program is converted into a macro dataflow graph which is used by the tool to generate executable code for hypercube machines. The program restructured by our tool outperformed the manually developed code, while increasing the program development productivity at the same time.

[1]  Richard M. Fujimoto.  SIMON: a Simulator of Multicomputer Networks , 1983 .

[2]  Daniel Gajski,et al.  CAMP: A Programming Aide for Multiprocessors , 1986, ICPP.

[3]  Bruce D. Shriver,et al.  Local Microcode Compaction Techniques , 1980, CSUR.

[4]  David A. Padua,et al.  High-Speed Multiprocessors and Compilation Techniques , 1980, IEEE Transactions on Computers.

[5]  John C. Peterson,et al.  The Mark III Hypercube-Ensemble Computers , 1988 .

[6]  Ulrich Herzog,et al.  Optimal Scheduling Strategies for Real-Time Computers , 1975, IBM Journal of Research and Development.

[7]  M.-Y. Wu,et al.  Programming environments for multiprocessors , 1987 .

[8]  John C. Peterson,et al.  Caltech/JPL MARK II Hypercube Concurrent Processor , 1985, ICPP.

[9]  Walter H. Kohler,et al.  A Preliminary Evaluation of the Critical Path Method for Scheduling Tasks on Multiprocessor Systems , 1975, IEEE Transactions on Computers.

[10]  Daniel Gajski,et al.  Essential Issues in Multiprocessor Systems , 1985, Computer.

[11]  John L. Gustafson,et al.  The Architecture of a Homogeneous Vector Supercomputer , 1986, J. Parallel Distributed Comput..

[12]  Boontee Kruatrachue,et al.  Grain size determination for parallel processing , 1988, IEEE Software.

[13]  C. V. Ramamoorthy,et al.  Optimal Scheduling Strategies in a Multiprocessor System , 1972, IEEE Transactions on Computers.

[14]  Daniel Gajski,et al.  A Programming Aid for Message-passing Systems , 1987, PPSC.

[15]  John P. Hayes,et al.  A Microprocessor-based Hypercube Supercomputer , 1986, IEEE Micro.

[16]  John Paul Shen,et al.  Interprocessor Traffic Scheduling Algorithm for Multiple-Processor Networks , 1987, IEEE Transactions on Computers.

[17]  Jake K. Aggarwal,et al.  A Mapping Strategy for Parallel Processing , 1987, IEEE Transactions on Computers.

[18]  John C. Peterson,et al.  The Mark III Hypercube-Ensemble Concurrent Computer , 1985, International Conference on Parallel Processing.

[19]  Eduardo B. Fernández,et al.  Optimal Scheduling for Homogeneous Multiprocessors , 1974, IFIP Congress.

[20]  John P. Hayes,et al.  Architecture of a Hypercube Supercomputer , 1986, ICPP.

[21]  Maurice Hanan,et al.  A review of the placement and quadratic assignment problems , 1972 .

[22]  A. Trayse,et al.  ALGORITHMS FOR MINIMAL-LENGTH SCHEDULES , 1979 .

[23]  T. C. Hu.  Parallel Sequencing and Assembly Line Problems , 1961 .

[24]  Charles L. Seitz,et al.  The cosmic cube , 1985, CACM.

[25]  K. Mani Chandy,et al.  A comparison of list schedules for parallel processing systems , 1974, Commun. ACM.

[26]  Ken Kennedy,et al.  PTOOL : A Semi-Automatic Parallel Programming Assistant , 1986, International Conference on Parallel Processing.