By Topic

Effect of task allocation methods for mesh-connected parallel computers considering task size limitation and machine size extension

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

5 Author(s)
Suzaki, K. ; Electrotech. Lab., Ibaraki, Japan ; Tanuma, H. ; Hirano, S. ; Ichisugi, Y.
more authors

We analyzed the behavior of task allocation methods “Two Dimensional Buddy”, “Adaptive Scan” and time sharing systems that use them for mesh-connected parallel computers under task size limitation and machine size extension. The efficiency of task allocation methods for mesh-connected parallel computers is expected to be impressed by the shapes and sizes of rectangular processor partitions which are required by tasks and a machine. In general the task allocation methods are expected to improve packing ability of tasks if the number of processor for a task is limited. However the execution time of the task is expanded. We examined performance trade-off between increased packing ability and task size limitation under task size scalability. Furthermore, we examined how to extend a parallel computer efficiently. From simulation results we confirmed that task size limitation improved performance of task allocation methods and that rectangular extension is better than square extension

Published in:

Algorithms & Architectures for Parallel Processing, 1996. ICAPP 96. 1996 IEEE Second International Conference on

Date of Conference:

11-13 Jun 1996