
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
K. Li, K.H. Cheng, "Job Scheduling in a Partitionable Mesh Using a TwoDimensional Buddy System Partitioning Scheme," IEEE Transactions on Parallel and Distributed Systems, vol. 2, no. 4, pp. 413422, October, 1991.  
BibTex  x  
@article{ 10.1109/71.97898, author = {K. Li and K.H. Cheng}, title = {Job Scheduling in a Partitionable Mesh Using a TwoDimensional Buddy System Partitioning Scheme}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {2}, number = {4}, issn = {10459219}, year = {1991}, pages = {413422}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.97898}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Job Scheduling in a Partitionable Mesh Using a TwoDimensional Buddy System Partitioning Scheme IS  4 SN  10459219 SP413 EP422 EPD  413422 A1  K. Li, A1  K.H. Cheng, PY  1991 KW  Index Termspartitionable mesh; twodimensional buddy system partitioning; job scheduling; squaremeshes; heuristic algorithm; time complexity; largestjobfirst scheduling; worst case;optimal schedule; average; computational complexity; multiprocessor interconnectionnetworks; parallel algorithms; scheduling VL  2 JA  IEEE Transactions on Parallel and Distributed Systems ER   
The job scheduling problem in a partitionable meshconnected 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 largestjobfirst scheduling policy and uses a twodimensional 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.
[1] E. G. Coffman, Jr., G. S. Lueker, and A. H. G. Rinnooy Kan, "Asymptotic methods in the probabilistic analysis of sequencing and packing heuristics,"Management Sci., pp. 266290, Mar. 1988.
[2] W. Feller,An Introduction to Probability Theory and Its Applications, vol. 1, 3rd ed. New York: Wiley, 1968.
[3] M. R. Garey and D. S. Johnson, "Approximation algorithms for combinatorial problems: An annotated bibliography," inAlgorithms and Complexity: New Directions and Recent Results, J. F. Traub, ed. New York: Academic, 1976, pp. 4152.
[4] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NPCompleteness. San Francisco, CA: Freeman, 1979.
[5] E. Horowitz and S. Sahni,Fundamentals of Computer Algorithms. Rockville, MD: Computer Sci. Press, 1978.
[6] W. H. Lee and M. Malek, "MOPAC: A partitionable and reconfigurable multicomputer array," inProc. 12th Int. Conf. Parallel Processing, 1983, pp. 506510.
[7] K. Li and K. H. Cheng, "Complexity of resource allocation and job scheduling problems in partitionable mesh connected systems," inProc. 1st IEEE Symp. Parallel Distributed Processing, May 1989, pp. 358365.
[8] K. Li and K. H. Cheng, "Static job scheduling in partitionable mesh connected systems,"J. Parallel Distributed Comput., vol. 10, no. 2, pp. 152159, Oct. 1990.
[9] K. Li and K. H. Cheng, "A two dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system," inProc. 18th ACM Comput. Sci. Conf., Feb. 1990, pp. 2228;J. Parallel Distributed Comput., vol. 12, no. 1, pp. 7983, May 1991.
[10] K. Li and K. H. Cheng, "Worst case performance analysis of the two dimensional binary buddy system,"Int. J. Comput. Math., vol. 38, pp. 123132, 1991.
[11] J. L. Peterson and T. A. Norman, "Buddy systems,"Commun. ACM, vol. 20, no. 6, pp. 421431, 1977.