A parallel workload model and its implications for processor allocation
Cluster Computing
Using moldability to improve the performance of supercomputer jobs
Journal of Parallel and Distributed Computing
When the Herd Is Smart: Aggregate Behavior in the Selection of Job Request
IEEE Transactions on Parallel and Distributed Systems
A Symbolic Approachto Modeling Cellular Behavior
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Predicting Queue Times on Space-Sharing Parallel Computers
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
A Model for Moldable Supercomputer Jobs
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Scheduling a Metacomputer with Uncooperative Sub-schedulers
IPPS/SPDP '99/JSSPP '99 Proceedings of the Job Scheduling Strategies for Parallel Processing
Adaptive Selection of Partition Size for Supercomputer Requests
IPDPS '00/JSSPP '00 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Another approach to backfilled jobs: applying virtual malleability to expired windows
Proceedings of the 19th annual international conference on Supercomputing
Critical Path and Area Based Scheduling of Parallel Task Graphs on Heterogeneous Platforms
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Robust scheduling of moldable parallel jobs
International Journal of High Performance Computing and Networking
Moldable parallel job scheduling using job efficiency: an iterative approach
JSSPP'06 Proceedings of the 12th international conference on Job scheduling strategies for parallel processing
Adaptive job scheduling via predictive job resource allocation
JSSPP'06 Proceedings of the 12th international conference on Job scheduling strategies for parallel processing
DistRM: distributed resource management for on-chip many-core systems
CODES+ISSS '11 Proceedings of the seventh IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Provisioning spot market cloud resources to create cost-effective virtual clusters
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
Pitfalls in parallel job scheduling evaluation
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
Failure-aware resource provisioning for hybrid Cloud infrastructure
Journal of Parallel and Distributed Computing
A job scheduling approach for multi-core clusters based on virtual malleability
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
Game-theoretic analysis of decentralized core allocation schemes on many-core systems
Proceedings of the Conference on Design, Automation and Test in Europe
Distributed run-time resource management for malleable applications on many-core platforms
Proceedings of the 50th Annual Design Automation Conference
Efficient multiprogramming for multicores with SCAF
Proceedings of the 46th Annual IEEE/ACM International Symposium on Microarchitecture
| Hi-index | 0.00 |
We propose a new model for parallel speedup that is based on two parameters, the average parallelism of a program and its variance in parallelism. We present a way to use the model to estimate these program characteristics using only observed speedup curves (as opposed to the more detailed program knowledge otherwise required). We apply this method to speedup curves from real programs on a variety of architectures and show that the model fits the observed data well. We propose several applications for the model, including the selection of cluster sizes for parallel jobs.