Attacking the process migration bottleneck
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
Processor allocation in an N-cube multiprocessor using gray codes
IEEE Transactions on Computers
Communications of the ACM
Topological Properties of Hypercubes
IEEE Transactions on Computers
Preemptive scheduling of independent jobs on a hypercube
Information Processing Letters
Scheduling in multiprogrammed parallel systems
SIGMETRICS '88 Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Distributed scheduling for a changing environment
Distributed scheduling for a changing environment
Operating system concepts (3rd ed.)
Operating system concepts (3rd ed.)
The performance of multiprogrammed multiprocessor scheduling algorithms
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Scheduling independent jobs on partitionable hypercubes
Journal of Parallel and Distributed Computing
Subcube Allocation in Hypercube Computers
IEEE Transactions on Computers
Transparent process migration: design alternatives and the sprite implementation
Software—Practice & Experience
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Preemptable remote execution facilities for the V-system
Proceedings of the tenth ACM symposium on Operating systems principles
A comparative analysis of disk scheduling policies
Communications of the ACM
Communications of the ACM
Computer Performance Modeling Handbook
Computer Performance Modeling Handbook
A Top-Down Processor Allocation Scheme for Hypercube Computers
IEEE Transactions on Parallel and Distributed Systems
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Disjoint Task Allocation Algorithms for MIN Machines with Minimal Conflicts
IEEE Transactions on Parallel and Distributed Systems
Scheduling Master-Slave Multiprocessor Systems
IEEE Transactions on Computers
On-Line Task Migration in Hypercubes Through Double Disjoint Paths
IEEE Transactions on Computers - Special issue on mobile computing
Noncontiguous Processor Allocation Algorithms for Mesh-Connected Multicomputers
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A Fast and Efficient Processor Allocation Scheme for Mesh-Connected Multicomputers
IEEE Transactions on Computers
Non-contiguous processor allocation algorithms for distributed memory multicomputers
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
A Fault-Tolerant Distributed Subcube Management Scheme for Hypercube Multicomputer Systems
IEEE Transactions on Parallel and Distributed Systems
Good Processor Management = Fast Allocation + Efficient Scheduling
ICPP '97 Proceedings of the international Conference on Parallel Processing
Real-Time Job Scheduling in Hypercube Systems
ICPP '97 Proceedings of the international Conference on Parallel Processing
Effect of Job Size Characteristics on Job Scheduling Performance
IPDPS '00/JSSPP '00 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
The Forgotten Factor: Facts on Performance Evaluation and Its Dependence on Workloads
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Job Scheduling in a Multi-layer Vision System
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Workload Modeling for Performance Evaluation
Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
Improving system performance in contiguous processor allocation for mesh-connected parallel systems
Journal of Systems and Software
Multitoroidal Interconnects For Tightly Coupled Supercomputers
IEEE Transactions on Parallel and Distributed Systems
A dynamic processor management strategy on the reconfigurable meshes
International Journal of High Performance Computing and Networking
Comparative evaluation of contiguous allocation strategies on 3D mesh multicomputers
Journal of Systems and Software
Proceedings of the 2011 International Conference on Communication, Computing & Security
Energy characteristic of a processor allocator and a network-on-chip
International Journal of Applied Mathematics and Computer Science - SPECIAL SECTION: Efficient Resource Management for Grid-Enabled Applications
Communication-aware processor allocation for supercomputers
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Exploring portfolio scheduling for long-term execution of scientific workloads in IaaS clouds
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Hi-index | 0.01 |
Managing computing resources in a hypercube entails two steps. First, a job must bechosen to execute from among those waiting (job scheduling). Next a particular subcubewithin the hypercube must be allocated to that job (processor allocation). Whereasprocessor allocation has been well studied, job scheduling has been largely neglected.The goal of this paper is to compare the roles of processor allocation and job schedulingin achieving good performance on hypercube computers. We show that job schedulinghas far more impact on performance than does processor allocation. We propose a newfamily of scheduling disciplines, called Scan, that have particular performanceadvantages. We show that performance problems that cannot be resolved throughcareful processor allocation can be solved by using Scan job-scheduling disciplines.Although the Scan disciplines carry far less overhead than is incurred by even thesimplest processor allocation strategies, they are far more able to improve performancethan even the most sophisticated strategies. Furthermore, when Scan disciplines areused, the abilities of sophisticated processor allocation strategies to further improveperformance are limited to negligible levels. Consequently, a simple O(n) allocationstrategy can be used in place of these complex strategies.