Optimal selection theory for superconcurrency

Authors:
R. F. Freund
Affiliations:
Naval Ocean Systems Center
Venue:
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Year:
1989

Citing 1
Cited 16

Partitioning Problems in Parallel, Pipeline, and Distributed Computing

IEEE Transactions on Computers

Minimizing the Application Execution Time Through Scheduling of Subtasks and Communication Traffic in a Heterogeneous Computing System

IEEE Transactions on Parallel and Distributed Systems
A Stochastic Model for Heterogeneous Computing and Its Application in Data Relocation Scheme Development

IEEE Transactions on Parallel and Distributed Systems
A learning automata based framework for task assignment in heterogeneous computing systems

Proceedings of the 1999 ACM symposium on Applied computing
Statistical Prediction of Task Execution Times through Analytic Benchmarking for Scheduling in a Heterogeneous Environment

IEEE Transactions on Computers
Heterogeneous Computing: Challenges and Opportunities

Computer
Data Management and Control-Flow Aspects of an SIMD/SPMD Parallel Language/Compiler

IEEE Transactions on Parallel and Distributed Systems
An integrated technique for task matching and scheduling onto distributed heterogeneous computing systems

Journal of Parallel and Distributed Computing - Problems in parallel and distributed computing: Solutions based on evolutionary paradigms
Estimating the execution time distribution for a task graph in a heterogeneous computing system

HCW '97 Proceedings of the 6th Heterogeneous Computing Workshop (HCW '97)
A stochastic model of a dedicated heterogeneous computing system for establishing a greedy approach to developing data relocation heuristics

HCW '97 Proceedings of the 6th Heterogeneous Computing Workshop (HCW '97)
Scheduling Resources in Multi-User, Heterogeneous, Computing Environments with SmartNet

HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
Multiple Cost Optimization for Task Assignment in Heterogeneous Computing Systems Using Learning Automata

HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
Statistical Prediction of Task Execution Times Through Analytic Benchmarking for Scheduling in a Heterogeneous Environment

HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
Run-Time Statistical Estimation of Task Execution Times for Heterogeneous Distributed Computing

HPDC '96 Proceedings of the 5th IEEE International Symposium on High Performance Distributed Computing
Generational scheduling for dynamic task management in heterogeneous computing systems

Information Sciences: an International Journal
A distributed bio-inspired method for multisite grid mapping

Applied Computational Intelligence and Soft Computing - Special issue on theory and applications of evolutionary computation
COSPIM: a program optimization system for tightly-coupled heterogeneous environments

ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a mathematical programming approach to finding an optimal, heterogeneous suite of processors to solve supercomputing problems. This technique, called superconcurrency, works best when the computational requirements are diverse and significant portions of the code are not tightly-coupled. It is also dependent on new methods of benchmarking and code profiling, as well as eventual use of AI techniques for intelligent management of the selected superconcurrent suite.