Communications of the ACM - Special section on computer architecture
Simulating computer systems: techniques and tools
Simulating computer systems: techniques and tools
Processor allocation in an N-cube multiprocessor using gray codes
IEEE Transactions on Computers
Journal of Parallel and Distributed Computing
Subcube Allocation in Hypercube Computers
IEEE Transactions on Computers
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
Performance analysis of job scheduling policies in parallel supercomputing environments
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Communications of the ACM
Non-contiguous processor allocation algorithms for distributed memory multicomputers
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
A Top-Down Processor Allocation Scheme for Hypercube Computers
IEEE Transactions on Parallel and Distributed Systems
Job Scheduling is More Important than Processor Allocation for Hypercube Computers
IEEE Transactions on Parallel and Distributed Systems
A Batch Scheduler for the Intel Paragon MPP System with a Non-contiguous Node Allocation Algorithm
IPPS '96 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
ProcSimity: an experimental tool for processor allocation and scheduling in highly parallel systems
FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)
The impact of spatial layout of jobs on parallel I/O performance
Proceedings of the sixth workshop on I/O in parallel and distributed systems
Dynamic Processor Allocation in Large Mesh-Connected Multicomputers
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
The multicast address allocation problem: theory and practice
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on The global Internet
Task migration in n-dimensional wormhole-routed mesh multicomputers
Journal of Systems Architecture: the EUROMICRO Journal
The impact of spatial layout of jobs on I/O hotspots in mesh networks
Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part I
Efficient Subtorus Processor Allocation in a Multi-Dimensional Torus
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 2
An efficient free-list submesh allocation scheme for two-dimensional mesh-connected multicomputers
Journal of Systems and Software
Distributed dynamic processor allocation for multicomputers
Parallel Computing
An efficient non-contiguous processor allocation strategy for 2D mesh connected multicomputers
Information Sciences: an International Journal
Availability-based noncontiguous processor allocation policies for 2D mesh-connected multicomputers
Journal of Systems and Software
User-aware dynamic task allocation in networks-on-chip
Proceedings of the conference on Design, automation and test in Europe
A Novel Non-exclusive Dual-Mode Architecture for MPSoCs-Oriented Network on Chip Designs
SAMOS '08 Proceedings of the 8th international workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation
Processor allocation and job scheduling on 3D mesh interconnection networks
International Journal of Computers and Applications
Routing-contained virtualization based on Up*/Down* forwarding
HiPC'07 Proceedings of the 14th international conference on High performance computing
An adaptive job scheduling scheme for mesh-connected multicomputers
The Journal of Supercomputing
Proceedings of the 2011 International Conference on Communication, Computing & Security
Performance evaluation of noncontiguous allocation algorithms for 2D mesh interconnection networks
Journal of Systems and Software
Scalable node allocation for improved performance in regular and anisotropic 3D torus supercomputers
EuroMPI'11 Proceedings of the 18th European MPI Users' Group conference on Recent advances in the message passing interface
Power-aware run-time incremental mapping for 3-D networks-on-chip
NPC'11 Proceedings of the 8th IFIP international conference on Network and parallel computing
Communication-aware processor allocation for supercomputers
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Improvements to the structural simulation toolkit
Proceedings of the 5th International ICST Conference on Simulation Tools and Techniques
Using task migration to improve non-contiguous processor allocation in NoC-based CMPs
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 0.00 |
Current processor allocation techniques for highly parallel systems are typically restricted to contiguous allocation strategies for which performance suffers significantly due to the inherent problem of fragmentation. As a result, message-passing systems have yet to achieve the high utilization levels exhibited by traditional vector supercomputers. We are investigating processor allocation algorithms which lift the restriction on contiguity of processors in order to address the problem of fragmentation.Three noncontiguous processor allocation strategies驴Paging allocation, Random allocation, and the Multiple Buddy Strategy (MBS)驴are proposed and studied in this paper. Simulations compare the performance of the noncontiguous strategies with that of several well-known contiguous algorithms. We show that noncontiguous allocation algorithms perform better overall than the contiguous ones, even when message-passing contention is considered. We also present the results of experiments on an Intel Paragon XP/S-15 with 208 nodes that show noncontiguous allocation is feasible with current technologies.