The Community for Technology Leaders
Green Image
<p>The job scheduling problem in a partitionable mesh-connected system in which jobs require square meshes and the system is a square mesh whose size is a power of two is discussed. A heuristic algorithm of time complexity O(n(log n+log p)), in which n is the number of jobs to be scheduled and p is the size of the system is presented. The algorithm adopts the largest-job-first scheduling policy and uses a two-dimensional buddy system as the system partitioning scheme. It is shown that, in the worst case, the algorithm produces a schedule four times longer than an optimal schedule, and, on the average, schedules generated by the algorithm are twice as long as optimal schedules.</p>
Index Termspartitionable mesh; two-dimensional buddy system partitioning; job scheduling; squaremeshes; heuristic algorithm; time complexity; largest-job-first scheduling; worst case;optimal schedule; average; computational complexity; multiprocessor interconnectionnetworks; parallel algorithms; scheduling

K. Cheng and K. Li, "Job Scheduling in a Partitionable Mesh Using a Two-Dimensional Buddy System Partitioning Scheme," in IEEE Transactions on Parallel & Distributed Systems, vol. 2, no. , pp. 413-422, 1991.
89 ms
(Ver 3.3 (11022016))