A reliable processor-allocation strategy for mesh-connected parallel systems

Efficient utilization of processing resources in a large, multi-user parallel computer system depends on the reliable processor allocation algorithms. The paper presents and LSSA (L-shaped submesh allocation) strategy to reduce external fragmentation and job response time, simultaneously. LSSA manip...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001 pp. 243 - 248
Main Authors: Kyung-Hee Seo, Sung-Chun Kim
Format: Conference Proceeding
Language:English
Published: IEEE 2001
Subjects:
Computer science
Delay
Maintenance
Resource management
Robustness
Shape
System performance
Topology
Very large scale integration
ISBN:0769511538, 9780769511535
ISSN:1521-9097
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Efficient utilization of processing resources in a large, multi-user parallel computer system depends on the reliable processor allocation algorithms. The paper presents and LSSA (L-shaped submesh allocation) strategy to reduce external fragmentation and job response time, simultaneously. LSSA manipulates the shape of the required submesh to fit into the fragmented mesh system and accommodates incoming jobs faster than other strategies. LSSA can be applied to mesh-connected parallel systems with faulty processors. The basic idea is to reconfigure a faulty mesh system into a maximum convex system using the fault-free upper or lower boundary nodes to compensate for the non-boundary faulty nodes. To utilize the non-rectangular shaped system parts, LSSA tries to allocate L-shaped submeshes instead of signaling the allocation failure. 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.
ISBN:0769511538
9780769511535
ISSN:1521-9097
DOI:10.1109/ICPADS.2001.934826