A dynamic processor management strategy on the reconfigurable meshes

Authors:
Kyung-Hee Seo;Sung-Chun Kim
Affiliations:
School of Computer Science, Sungshin Women;s University, 249-1, DongSun-Dong, SungBuk-Gu, Seoul, 136-742, Korea.
Venue:
International Journal of High Performance Computing and Networking
Year:
2005

Citing 8
Cited 0

Meshes with reconfigurable buses

Proceedings of the fifth MIT conference on Advanced research in VLSI
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
An Adaptive Submesh Allocation Strategy for Two-Dimensional Mesh Connected Systems

ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 02
Job Scheduling in Mesh Multicomputers

ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 02

Quantified Score

Hi-index	0.00

Visualization

Abstract

A reconfigurable mesh consists of a mesh connected topology augmented by a dynamically reconfigurable bus system. The reconfigurable mesh combines two attractive features of massively parallel system, namely constant diameter and the flexibility of the bus system. Efficient utilisation of processing resources in a large, multi user parallel system depends on the reliable processor management scheme. This paper presents a dynamic and reliable processor allocation strategy to increase the performance of 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 nonboundary faulty nodes. To utilise the nonrectangular shaped system parts, our strategy tries to allocate L shaped submeshes instead of signalling the allocation failure. Extensive simulations show that the strategy performs more efficiently than other strategies in terms of the completion time, the job response time and the system utilisation.