This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Assignments in Broadcast Networks
May 1988 (vol. 37 no. 5)
pp. 521-531
A program whose execution is distributed among several processors in a broadcast system has a total execution cost equal to the sum of processor costs and communication costs, which are functions of the amount of data transmitted and the average transmission delays. A critical delay x is a value of average transmission delay such that no assignment is minimum-cost for average delays both smalle

[1] M. Schwartz,Computer-Communication Network Design and Analysis. Englewood Cliffs, NJ: Prentice-Hall, 1977.
[2] A. S. Tanenbaum,Computer Networks, Englewood Cliffs, NJ: Prentice-Hall, 1981.
[3] H. S. Stone, "Multiprocessor scheduling with the aid of network flow algorithms,"IEEE Trans. Software Eng., vol. SE-3, pp. 85-93, Jan. 1977.
[4] H. S. Stone, "Critical load factors in two-processor distributed systems,"IEEE Trans. Software Eng., vol. SE-4, pp. 254-258, May 1978.
[5] D. Gusfield, "Parametric combinatorial computing and a problem of module distribution,"J. ACM, no. 3, pp. 551-563, 1983.
[6] G. S. Rao, H. S. Stone, and T. C. Hu, "Assignment of tasks in a distributed processor system with limited memory,"IEEE Trans. Comput., vol. C-28, pp. 291-299, Apr. 1979.
[7] R. M. Bryant and J. R. Agre, "A queueing network approach to the module allocation problem in distributed systems,"Perform. Eval. Rev., vol. 10, pp. 181-204, Fall 1981.
[8] W. W. Chu, L. J. Holloway, M. T. Lan, and K. Efe, "Task allocation in distributed data processing,"Computer, vol. 13, pp, 57-69, Nov. 1980.
[9] T. C. K. Chou and J. A. Abraham, "Load balancing in distributed systems,"IEEE Trans. Software Eng., vol. SE-8, pp. 401-412, July 1982.
[10] T. A. Gonsalves, "Heuristic algorithms for distributed processor scheduling with limited memory," Master's Thesis, Dep. Elec. Eng., Rice Univ., Houston, TX, June 1978.
[11] L. R. Ford, Jr, and D. R. Fulkerson,Flows in Networks. Princeton, NJ: Princeton University Press, 1962.
[12] J. F. Shoch and J. A. Hupp, "Measured performance of an Ethernet local area network,"Commun. ACM, vol. 23, no. 12, pp. 711-721, 1980.
[13] H. S. Stone, "Program assignment in three-processor systems and tricutset partitioning of graphs," Rep. ECE-CS-77-7, Dep. Elec. Comput. Eng., Univ. Massachusetts, Amherst, MA, July 1977.
[14] S. H. Bokhari, "A shortest tree algorithm for optimal assignments across space and time in a distributed processor system,"IEEE Trans. Software Eng., vol. SE-7, pp. 583-589, Nov. 1981.
[15] J. B. Sinclair, "Optimal assignments in broadcast networks with transmission delays," TR 8205, Dep. Elec. Eng., Rice Univ., Houston, TX, July 1982.
[16] J. B. Sinclair, "Efficient computation of optimal assignments for distributed tasks,"J. Parallel Distributed Comput., vol. 4, pp. 342-362, 1987.

Index Terms:
broadcast communication channels; computer networks distributed programs; broadcast networks; total execution cost; processor costs; communication costs; amount of data transmitted; average transmission delays; critical delay; optimal assignments; dynamic programming; tree-structured calls graphs; minimum channel utilization; compact graphical representation; minimum transmission costs; computer networks; data communication systems; delays; distributed processing; dynamic programming; graph theory; multiprocessor interconnection networks.
Citation:
J.B. Sinclair, "Optimal Assignments in Broadcast Networks," IEEE Transactions on Computers, vol. 37, no. 5, pp. 521-531, May 1988, doi:10.1109/12.4603
Usage of this product signifies your acceptance of the Terms of Use.