
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
David M. Nicol, Rahul Simha, Don Towsley, "Static Assignment of Stochastic Tasks Using Majorization," IEEE Transactions on Computers, vol. 45, no. 6, pp. 730740, June, 1996.  
BibTex  x  
@article{ 10.1109/12.506428, author = {David M. Nicol and Rahul Simha and Don Towsley}, title = {Static Assignment of Stochastic Tasks Using Majorization}, journal ={IEEE Transactions on Computers}, volume = {45}, number = {6}, issn = {00189340}, year = {1996}, pages = {730740}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.506428}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Static Assignment of Stochastic Tasks Using Majorization IS  6 SN  00189340 SP730 EP740 EPD  730740 A1  David M. Nicol, A1  Rahul Simha, A1  Don Towsley, PY  1996 KW  Task assignment KW  task allocation KW  load balancing KW  majorization KW  processor allocation KW  resource allocation KW  performance of parallel systems. VL  45 JA  IEEE Transactions on Computers ER   
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
[1] M.J. Berger and J. Oliger, "Adaptive Mesh Refinement for Hyperbolic Partial Differential Equations," J. Comp. Phys., vol. 53, pp. 484512, 1984.
[2] G. Brassard and P. Bratley, Algorithmic Theory and Practice.Englewood Cliffs, N.J.: Prentice Hall, 1988.
[3] CS. 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] YC. Chow and W.H. Kohler, "Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System," IEEE Trans. Computers, vol. 28, pp. 354361, 1979.
[5] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness.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. 691697, 1986.
[7] J. Hong, X. Tan, and M. Chen, "From Local to Global: An Analysis of Nearest Neighbour Balancing on Hypercube," ACM SIGMETRICS, pp. 7382, 1989.
[8] B. Indurkhya, H.S. Stone, and L. XiCheng, "Optimal Partitioning of Randomly Generated Distributed Programs," IEEE Trans. Software Eng., vol. 12, no. 3, pp. 483495, 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,0011,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. 7887, 1984.
[12] D.M. Nicol, "Optimal Partitioning of Random Programs Across Two Processors," IEEE Trans. Software Eng., vol. 15, no. 2, pp. 134141, 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,0731,087, Sept. 1988.
[14] D.M. Nicol, "Communication Efficient Global Load Balancing," Proc. 1992 Scalable High Performance Computing Conf., pp. 292299,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. 854872, 1987.
[18] K.E. Stecke and T. Morin, "Optimality of Balanced Workloads in Flexible Manufacturing Systems," European J. Operational Research, vol. 20, pp. 6882, 1985.
[19] A. Tantawi and D. Towsley, "Optimal Static Load Balancing in Distributed Computer Systems," J. ACM, vol. 32, pp. 445465, 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,0451,054, Dec. 1986.
[21] R.R. Weber, "On the Optimal Assignment of Customers to Parallel Servers," J. Applied Probability, vol. 15, pp. 406413.
[22] D.D. Yao, "Majorization and Arrangement Orderings in Open Queueing Networks," Annals of Operations Research, vol. 9, pp. 531543, 1987.