This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Static Assignment of Stochastic Tasks Using Majorization
June 1996 (vol. 45 no. 6)
pp. 730-740

Abstract—We consider the problem of statically assigning many tasks to a (smaller) system of homogeneous processors, where a task's structure is modeled as a branching process, all tasks are assumed to have identical behavior, and the tasks may synchronize frequently. We show how the theory of majorization can be used to obtain a partial order among possible task assignments. We show that if the vector of numbers of tasks assigned to each processor under one mapping is majorized by that of another mapping, then the former mapping is better than the latter with respect to a large number of objective functions. In particular, we show how the metrics of finishing time, the space-time product, and reliability are all captured. We also apply majorization to the problem of partitioning a pool of processors for distribution among parallelizable tasks. Limitations of the approach, which include the static nature of the assignment, are also discussed.

[1] M.J. Berger and J. Oliger, "Adaptive Mesh Refinement for Hyperbolic Partial Differential Equations," J. Comp. Phys., vol. 53, pp. 484-512, 1984.
[2] G. Brassard and P. Bratley, Algorithmic Theory and Practice.Englewood Cliffs, N.J.: Prentice Hall, 1988.
[3] C-S. Chang, "A New Ordering for Stochastic Majorization: Theory and Applications," IBM Report RC 16028, T.J. Watson Research Center, Yorktown Heights, N.Y., 1990.
[4] Y-C. Chow and W.H. Kohler, "Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System," IEEE Trans. Computers, vol. 28, pp. 354-361, 1979.
[5] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[6] E. Gelenbe, R. Nelson, T. Phillips, and A. Tantawi, "An Approximation of the Processing Time for a Random Graph Model of Parallel Computation," Proc. Int'l Conf. Parallel Processing, pp. 691-697, 1986.
[7] J. Hong, X. Tan, and M. Chen, "From Local to Global: An Analysis of Nearest Neighbour Balancing on Hypercube," ACM SIGMETRICS, pp. 73-82, 1989.
[8] B. Indurkhya, H.S. Stone, and L. Xi-Cheng, "Optimal Partitioning of Randomly Generated Distributed Programs," IEEE Trans. Software Eng., vol. 12, no. 3, pp. 483-495, Mar. 1986.
[9] C.P. Kruskal and A. Weiss, "Allocating Independent Subtasks on Parallel Processors," IEEE Trans. Software Eng., vol. 11, no. 10, pp. 1,001-1,016, Oct. 1985.
[10] A.W. Marshall and I. Olkin, Inequalities: Theory of Majorization and Its Applications. Academic Press, 1979.
[11] P. Mussi and P. Nain, "Evaluation of Parallel Execution of Program Tree Structures," ACM SIGMETRICS, pp. 78-87, 1984.
[12] D.M. Nicol, "Optimal Partitioning of Random Programs Across Two Processors," IEEE Trans. Software Eng., vol. 15, no. 2, pp. 134-141, Feb. 1989.
[13] D.M. Nicol and J.H. Saltz, "Dynamic Remapping of Parallel Computations with Varying Resource Demands," IEEE Trans. Computers., vol. 37, no. 9, pp. 1,073-1,087, Sept. 1988.
[14] D.M. Nicol, "Communication Efficient Global Load Balancing," Proc. 1992 Scalable High Performance Computing Conf., pp. 292-299,Williamsburg, Va., Apr. 1992.
[15] C.H. Papadimitriu and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, 1987.
[16] S. Ross, Stochastic Processes. Wiley, 1983.
[17] J.G. Shanthikumar, "Stochastic Majorization of Random Variables with Proportional Equilibrium Rates," Adv. Appl. Prob., vol. 19, pp. 854-872, 1987.
[18] K.E. Stecke and T. Morin, "Optimality of Balanced Workloads in Flexible Manufacturing Systems," European J. Operational Research, vol. 20, pp. 68-82, 1985.
[19] A. Tantawi and D. Towsley, "Optimal Static Load Balancing in Distributed Computer Systems," J. ACM, vol. 32, pp. 445-465, 1985.
[20] A. Thomasian and P.F. Bay, "Analytic Queueing Network Models for Parallel Processing of Task Systems," IEEE Trans. Computers, vol. 35, no. 12, pp. 1,045-1,054, Dec. 1986.
[21] R.R. Weber, "On the Optimal Assignment of Customers to Parallel Servers," J. Applied Probability, vol. 15, pp. 406-413.
[22] D.D. Yao, "Majorization and Arrangement Orderings in Open Queueing Networks," Annals of Operations Research, vol. 9, pp. 531-543, 1987.

Index Terms:
Task assignment, task allocation, load balancing, majorization, processor allocation, resource allocation, performance of parallel systems.
Citation:
David M. Nicol, Rahul Simha, Don Towsley, "Static Assignment of Stochastic Tasks Using Majorization," IEEE Transactions on Computers, vol. 45, no. 6, pp. 730-740, June 1996, doi:10.1109/12.506428
Usage of this product signifies your acceptance of the Terms of Use.