An Integrated Processor Management Scheme for the Mesh-Connected Multicomputer Systems
نویسندگان
چکیده
The performance of a multicomputer system depends on the processor management strategy. Processor management deals with processor allocation and job scheduling. Most of the processor allocation and job scheduling schemes proposed in the literature incur high implementation complexity and are therefore impractical to be integrated. In this paper, we propose an integrated processor management scheme that includes a bypass-queue scheduling policy and a xed-orientation allocation algorithm. Both policies have very low complexities and are hence suitable to be integrated. Both policies improve the system performance considerably when applied in isolation. The integrated scheme provides even better performance.
منابع مشابه
Improving Performance of Mesh-connected Multicomputers by Reducing Fragmentation
Fragmentation is the main performance bottleneck of multicomputer systems. In this paper, we classify the fragmentation problems in multicomputer systems according to their causes. It is noted that among all kinds of fragmentation, physical fragmentation is seldom addressed by contemporary allocation schemes. Two novel processor allocation schemes that reduce physical fragmentation for the mesh...
متن کاملAn Economic Model for Resource Adaptation in 2D Mesh Multicomputer Networks
In the current partitionable Mesh-connected processors parallel machine, the system administrator (SA) can provide a means for offering the required quality of service (QoS) for a multiple classes of users. We consider the approach where the SA rents free processors in a 2D mesh-connected multicomputer with QoS guarantees for the users. Free processors are managed by the SA resource management ...
متن کاملA Minimal Fragmentation Algorithm for Task Allocation in Mesh - Connected Multicomputers
—Efficient allocation of processors to incoming tasks in tightly coupled systems is crucial for achieving high performance. A good allocation algorithm should identify available processors with minimum overhead. In addition, it should be submesh recognition complete and should minimize fragmentation as far as possible. In this paper, we propose an efficient task allocation mechanism called the ...
متن کاملA Quad-Tree Based Dynamic Processor Allocation Scheme for Mesh-Connected Parallel Machines
In this paper, two quad-tree (QT) baseddynamic processor allocation/deallocation heuristic algorithms are proposed for a partitionable Mesh-connected parallel multicomputer: the QTTL (Quad Tree Top Left) and the QTR (Quad Tree Root) partition first heuristics. For each QT-based algorithm, a theoretical analysis of its computational time complexity is presented in terms of the numbers of allocat...
متن کاملTask migration in n-dimensional wormhole-routed mesh multicomputers
In a mesh multicomputer performing jobs needs to schedule submeshes according to some processor allocation scheme In order to assign the incoming jobs to a free submesh a task compaction scheme is needed to generate a larger contiguous free region The overhead of com paction depends on the e ciency of the task migration scheme In this paper two simple task migration schemes are rst proposed in ...
متن کامل