Hypertool: A Programming Aid for Message-Passing Systems

Programming assistance, automation concepts, and their application to a message-passing system program development tool called Hypertool are discussed. Hypertool performs scheduling and handles the communication primitive insertion automatically, thereby increasing productivity and eliminating synchronization errors. Two algorithms, based on the critical-path method, are presented for scheduling processes statically. Hypertool also generates the performance estimates and other program quality measures to help programmers improve their algorithms and programs. >

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

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

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

[4]  L. Snyder,et al.  Parallel Programming and the Poker Programming Environment , 1984, Computer.

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

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

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

[8]  M.-Y. Wu,et al.  Computer-aided programming for message-passing systems: problems and solutions , 1989, Proc. IEEE.

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

[10]  Vivek Sarkar,et al.  Partitioning and Scheduling Parallel Programs for Multiprocessing , 1989 .

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

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

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

[14]  Alan H. Karp,et al.  A comparison of 12 parallel FORTRAN dialects , 1988, IEEE Software.

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

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

[17]  L. W. Tucker,et al.  Architecture and applications of the Connection Machine , 1988, Computer.

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

[19]  Justin R. Rattner.  Concurrent processing: a new direction in scientific computing in afips conference proceedings , 1985 .

[20]  Edward G. Coffman,et al.  Computer and job-shop scheduling theory , 1976 .

[21]  Alan H. Karp,et al.  Programming for Parallelism , 1987, Computer.

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

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

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

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

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

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

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