Augmenting the Optimal Selection Theory for Superconcurrency

An approach for jinding the optimal configuration of heterogeneous computer systems to solve supercomputing problem is presented. Superconcurrency as a form of distributed heterogeneous supercomputing is an approach for matching and managing an optimally configured suite of super-speed machines to minimize the execution time on a given task. The approach performs best when the computational requirements for a given set of tasks are diverse. A supercomputing application task is decomposed into a collection of code segments, where the processing requirement is homogeneous in each code segment. The optimal selection theory has been proposed to choose the optimal configuration of machines for a supercomputing problem. This technique is based on code projiling and analytical benchmarking. Here, the previously presented optimal selection theory approach is augmented in two ways: the performance of code segments on non-optimal machine choices is incorporated and non-uniform &compositions of code segments are considered.

[1]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[2]  Howard Jay Siegel,et al.  Examining the effects of CU/PE overlap and synchronization overhead when using the complete sums approach to image correlation , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[3]  Kevin P. McAuliffe,et al.  The IBM Research Parallel Processor Prototype (RP3): Introduction and Architecture , 1985, ICPP.

[4]  Thomas L. Casavant,et al.  Experimental Application-Driven Architecture Analysis of an SIMD/MIMD Parallel Processing System , 1990, IEEE Trans. Parallel Distributed Syst..

[5]  Milos D. Ercegovac,et al.  Heterogeneity in supercomputer architectures , 1988, Parallel Comput..

[6]  Trevor Mudge,et al.  Hypercube supercomputers , 1989, Proc. IEEE.

[7]  D. J. Hunt.  AMT DAP—a processor array in a workstation environment , 1989 .

[8]  Richard F. Freund,et al.  Superconcurrency: A Form of Distributed Heterogeneous Supercomputing , 1991 .

[9]  R. F. Freund,et al.  Optimal selection theory for superconcurrency , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).

[10]  Ahmed Sameh,et al.  The Illiac IV system , 1972 .

[11]  Shahid H. Bokhari.  Partitioning Problems in Parallel, Pipelined, and Distributed Computing , 1988, IEEE Trans. Computers.

[12]  John F. Beetem,et al.  The GF11 supercomputer , 1985, ISCA '85.

[13]  M. Auguin,et al.  The OPSILA computer , 1986 .

[14]  Thomas L. Casavant,et al.  Experimental Analysis of a Mixed-Mode Parallel Architecture Using Bitonic Sequence Sorting , 1991, J. Parallel Distributed Comput..

[15]  Howard Jay Siegel,et al.  Limitations Imposed on Mixed-Mode Performance of Optimized Phases Due to Temporal Juxtaposition , 1991, J. Parallel Distributed Comput..

[16]  Gérard Giraudon,et al.  Image processing on a SIMD/SPMD architecture: OPSILA , 1988, [1988 Proceedings] 9th International Conference on Pattern Recognition.

[17]  Kenneth E. Batcher,et al.  Bit-Serial Parallel Processing Systems , 1982, IEEE Transactions on Computers.

[18]  Robert H. Thomas,et al.  Performance Measurements on a 128-Node Butterfly Parallel Processor , 1985, International Conference on Parallel Processing.

[19]  Howard Jay Siegel,et al.  Mapping computer-vision-related tasks onto reconfigurable parallel-processing systems , 1992, Computer.

[20]  M.J. Atallah,et al.  Co-scheduling compute-intensive tasks on a network of workstations: model and algorithms , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.

[21]  R. Arlauskas.  iPSC/2 system: a second generation hypercube , 1988, C3P.

[22]  Tom Blank,et al.  The MasPar MP-1 architecture , 1990, Digest of Papers Compcon Spring '90. Thirty-Fifth IEEE Computer Society International Conference on Intellectual Leverage.

[23]  Howard Jay Siegel,et al.  Instruction execution trade-offs for SIMD vs. MIMD vs. mixed mode parallelism , 1991, [1991] Proceedings. The Fifth International Parallel Processing Symposium.

[24]  Kenneth E. Batcher.  STARAN parallel processor system hardware , 1974, AFIPS '74.

[25]  Karsten Schwan,et al.  Software management of Cm*: a distributed multiprocessor , 1977, AFIPS '77.