2005 · 51 citations · 22 references
ComputingComputer ScienceComputer SystemsDistributed SystemsHeterogeneous ComputingOptimizationCpu SchedulingDistributed Heterogeneous SystemsHeterogeneous System ArchitectureMachine SchedulingPerformance OptimizationScheduling OptimizationExecution Time AnalysisExecution Time EstimationHeterogeneity-aware SchedulingHeterogeneous Computing SystemsHeterogeneous Task SchedulingHigh-performance Computing OptimizationMachine-dependent OptimizationSupercomputer Architecture
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.
22
Tom Blank · 2002 · 281 citations
Wendell J. Bouknight, Stewart A. Denenberg, Deacon McIntyre et al. · Proceedings of the IEEE · 1972 · 235 citations
The Characteristics of Parallel Algorithms.
W. G., Leah H. Jamieson, Dennis Gannon et al. · Mathematics of Computation · 1988 · 226 citations