Parallel processing: the Cm* experience
Parallel processing: the Cm* experience
The rice parallel processing testbed
SIGMETRICS '88 Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Performance of parallel programs: model and analyses
Performance of parallel programs: model and analyses
The influence of random delays on parallel execution times
SIGMETRICS '93 Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Stochastic performance models of parallel task systems (extended abstract)
SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Predicting application behavior in large scale shared-memory multiprocessors
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Impact of Memory Contention on Dynamic Scheduling on NUMA Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Exploiting lookahead in synchronous parallel simulation
WSC '93 Proceedings of the 25th conference on Winter simulation
Performance analysis for parallel solutions to generic search problems
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Analyzing the expected execution times of parallel programs
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Performance Metrics for Embedded Parallel Pipelines
IEEE Transactions on Parallel and Distributed Systems
Stochastic Prediction of Execution Time for Dynamic Bulk Synchronous Computations
The Journal of Supercomputing
Some Ergodic Results on Stochastic Iterative Discrete Events Systems
Discrete Event Dynamic Systems
Beyond Execution Time: Expanding the Use of Performance Models
IEEE Parallel & Distributed Technology: Systems & Technology
Stochastic Bounds for Parallel Program Execution Times with Processor Constraints
IEEE Transactions on Computers
Performance Modeling and Prediction of Nondedicated Network Computing
IEEE Transactions on Computers
Optimal Remapping in Dynamic Bulk Synchronous Computations via a Stochastic Control Approach
IEEE Transactions on Parallel and Distributed Systems
Stochastic Prediction of Execution Time for Dynamic Bulk Synchronous Computations
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Performance Prediction of Data-Dependent Task Parallel Programs
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Symbolic Performance Prediction of Data-Dependent Parallel Programs
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Performance Sensitivity of Space-Sharing Processor Scheduling in Distributed-Memory Multicomputers
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Optimal periodic remapping of dynamic bulk synchronous computations
Journal of Parallel and Distributed Computing
Parallel program performance prediction using deterministic task graph analysis
ACM Transactions on Computer Systems (TOCS)
Low-Cost Static Performance Prediction of Parallel Stochastic Task Compositions
IEEE Transactions on Parallel and Distributed Systems
The Journal of Supercomputing
A semi-static approach to mapping dynamic iterative tasks onto heterogeneous computing systems
Journal of Parallel and Distributed Computing
Multiprocessor scheduling under precedence constraints: polyhedral results
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Journal of Parallel and Distributed Computing - Special issue on parallel bioinspired algorithms
Performance modeling and analysis of correlated parallel computations
Parallel Computing
Multiprocessor scheduling under precedence constraints: Polyhedral results
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
| Hi-index | 0.01 |
New methods are presented for bounding and approximating the mean execution time ofpartitioning algorithm, and these methods are compared to previous approaches.Distribution-driven and program-driven simulations show that two of the methods areusually accurate to within 10% and give good estimates even when certain independenceassumptions are violated. Asymptotic approximations and upper bounds are derived forthe average execution time of multiphase algorithms when there is no contention forprocesses in the parallel phase. In addition, the authors bound the average executiontime under static and dynamic scheduling policies and determine the optimum number ofparallel tasks to be created to minimize the execution time bounds with constantscheduling overhead.