Improving system performance in contiguous processor allocation for mesh-connected parallel systems

Authors:
Kyung-Hee Seo;Sung-Chun Kim
Affiliations:
Department of Computer Science, Sungshin Women's University, SungBuk-Ku, DongSun-Dong 249-1, Seoul, South Korea;Department of Computer Science, Sogang University, Mapo-Ku, ShinSu-Dong 1, Seoul, South Korea
Venue:
Journal of Systems and Software
Year:
2003

Citing 5
Cited 3

A two dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system

CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Cost Trade-offs in Graph Embeddings, with Applications

Journal of the ACM (JACM)
Scalable Parallel Computing: Technology,Architecture,Programming

Scalable Parallel Computing: Technology,Architecture,Programming
Job Scheduling is More Important than Processor Allocation for Hypercube Computers

IEEE Transactions on Parallel and Distributed Systems
(R) A Flexible Processor Allocation Strategy for Mesh Connected Parallel Systems

ICPP '96 Proceedings of the Proceedings of the 1996 International Conference on Parallel Processing - Volume 3

Comparative evaluation of contiguous allocation strategies on 3D mesh multicomputers

Journal of Systems and Software
A performance comparison of the contiguous allocation strategies in 3D mesh connected multicomputers

ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
Comparison of allocation algorithms in mesh oriented structures for different scheduling techniques

ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fragmentation is the main performance bottleneck of large, multiuser parallel computer systems. Current contiguous processor allocation techniques for mesh-connected parallel systems are restricted to rectangular submesh allocation strategies causing significant fragmentation problems. This paper presents an L-shaped submesh allocation (LSSA) strategy, which lifts the restriction on the rectangular shape formed by allocated processors in order to address the problem of fragmentation. LSSA can manipulate the shape of the required submesh to fit into the fragmented mesh system. As other strategies, LSSA first tries to allocate the conventional rectangular submeshes. If it fails, LSSA further tries to allocate more flexible L-shaped submeshes instead of signaling the allocation failure. Thus, LSSA accommodates incoming jobs faster than other strategies and results in the reduction of job response time. Extensive simulations show that LSSA performs more efficiently than other strategies in terms of the external fragmentation, the job response time and the system utilization.