By Topic

A performance comparison of processor allocation and job scheduling algorithms for mesh-connected multiprocessors

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Babbar, D. ; Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA ; Krueger, P.

Due to its simplicity, regularity and suitability for VLSI implementation, the mesh topology for multiprocessors has drawn considerable attention. Several processor allocation strategies for mesh-connected multiprocessors have been proposed in recent years. In this paper, we present the results of a performance study of all the proposed strategies known to authors. Originally each of these allocation strategies was proposed for use with First-Come-First-Served job scheduling. In this paper we also propose and evaluate new variants of these strategies using the Scan scheduling discipline. We find Scan to significantly improve the performance of all the allocation strategies. A wide range of workloads and system sizes are considered. In addition, we compare the overheads of these algorithms and study the effects of overheads on performance

Published in:

Parallel and Distributed Processing, 1994. Proceedings. Sixth IEEE Symposium on

Date of Conference:

26-29 Oct 1994