This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Simulation Study of Two Distributed Task Allocation Procedures
January 1988 (vol. 14 no. 1)
pp. 54-61

The authors concentrate on the simulation study of two distributed task allocation procedures: the load balancing and the LOCO procedure. The first is widely used in general-purpose processing. The second was recently introduced and analyzed in the processing environment corresponding to the complex multitask jobs typical of some supercomputing and artificial-intelligence-oriented systems. Both procedures are simulated and compared in realistic situations, where both processing resources and interconnection network may represent the system bottleneck. Both were tested using carrier-sense multiple-access communications protocols. The CSMA/CD protocol performed better than TDMA with load balancing, but no difference was found with the LOCO procedure. For a large number of special-purpose processing resources and a large number of jobs in the system, LOCO produced better results than load balancing.

[1] K. E. Batcher, "Design of a massively parallel processor,"IEEE Trans. Comput., vol. C-29, no. 9, pp. 836-840, Sept. 1980.
[2] T. C. K. Chou and J. A. Abraham, "Load balancing in distributed systems,"IEEE Trans. Software Eng., vol. SE-8, no. 4, pp. 401- 412, July 1982.
[3] Y.-C. Chow and W. H. Kohler, "Models for dynamic balancing in a heterogeneous multiple processor system,"IEEE Trans. Comput., vol. C-28, no. 5, pp. 354-361, May 1979.
[4] P. H. Enslow, "What is a distributed data processing system,"Computer, vol. 11, no. 1, pp. 13-21, Jan. 1978.
[5] M. J. Flynn, "Some computer organizations and their effectiveness."IEEE Trans. Comput., vol. C-21, pp. 948-960, 1972.
[6] D. D. Gajski, D. H. Lawrie, D. J. Kuck, and A. H. Sameh, "Cedar," inProc. IEEE Spring Compcon 84, San Francisco, CA, Feb./ Mar. 1984, pp. 306-309.
[7] A. Gottlieb, R. Grishman, C. P. Kruskal, R. L. McAuliffe, and M. Snir, "The NYU ultracomputer--Designing an MIMD shared memory parallel computer,"lEEE Trans. Comput., vol. C-32, no. 2, pp. 175-189, Feb. 1983.
[8] F. Hayes-Rothet al., Building Expert Systems. New York: Addison Wesley, 1983.
[9] K. Hwang, W. Croft, G. Goble, B. Wah, F. Briggs, W. Simmons, and C. Coates, "A UNIX-based local computer network with load balancing,"Computer, vol. 10, no. 4, pp. 55-66, Apr. 1982.
[10] E. D. Jensen and N. Pleszkoch, "ArchOS: A physically dispersed operating system,"IEEE Distributed Processing Tech. Committee Newslett., vol. 6, no. SI-2, pp. 15-24, June 1984.
[11] L. Kleinrock,Queueing Systems, vols. I and II. New York: Wiley, 1976.
[12] H. Kobayashi,Modeling and Analysis: An Introduction to System Performance Evaluation Methodology. Reading, MA: Addison-Wesley, 1978.
[13] V. Milutinovic´, J. Crnkovic´, L.-Y. Chang, and H. J. Siegel, "The LOCO approach to distributed task allocation in AIDA by VERDI," inProc. 5th IEEE Conf. Distributed Computing Systems, Denver, CO, May 1985.
[14] L. M. Ni and K. Hwang, "Optimal load balancing strategies for multiple processor systems," inProc. IEEE/ACM Int. Conf. Parallel Processing, Bellaire, MI, Aug. 1981, pp. 352-357.
[15] D. Roberts, "A study of the artificial intelligence software environment,"Purdue Univ. Internal Rep.EE 496-84, Aug. 1984.
[16] H. J. Siegel, L. J. Siegel, F. Kemmerer, P. T. Mueller, H. E. Smalley, and S. D. Smith, "PASM: A partitionable SIMD/MIMD system for image processing and pattern recognition,"IEEE Trans. Comput., vol. C-29, no. 9, pp. 791-801, Sept. 1980.
[17] J. A. Stankovic, K. Ramamrithan, and H. K. Walter, "A review of current research and critical issues in distributed system software."IEEE Distributed Processing Tech. Committee Nawslett., pp. 14- 47, Mar. 1, 1985.
[18] S. J. Stolfo, and D. E. Shaw, "DADO: A tree-structured machine architecture for production systems," inProc. AAAI Nat. Conf. Artificial Intell., Pittsburgh, PA, 1982.
[19] A. N. Tantawi and D. Towsley, "Optimal load balancing in distributed computer systems," Univ. Massachusetts, Tech. Rep. RC- 10346, Jan. 1984.
[20] B. W. Wah, "Comparative study of distributed resource sharing on multiprocessors,"IEEE Trans. Comput., vol. C-33, no. 8, pp. 700- 711, Aug. 1984.
[21] B. W. Wah and J.-Y. Juang, "An efficient protocol for load balancing on CSMA/CD networks, " inProc. IEEE Conf. Local Computer Networks, Minneapolis, MN, Oct. 1983, pp. 55-61.
[22] B. W. Wah and Y. W. Ma, "MANIP: A multicomputer architecture for solving combinatorial extremum search problems."IEEE Trans. Comput., vol. C-33, no. 5, pp. 377-390, May 1984.
[23] Y.-T. Wang and R. J. T. Morris, "Load sharing in distributed systems,"IEEE Trans. Comput., vol. C-34, no. 3, pp. 204-217, Mar. 1985.

Index Terms:
distributed task allocation procedures; simulation study; load balancing; LOCO procedure; general-purpose processing; complex multitask jobs; supercomputing; artificial-intelligence-oriented systems; interconnection network; system bottleneck; carrier-sense multiple-access; communications protocols; CSMA/CD; TDMA; multiprogramming; protocols; virtual machines
Citation:
V.M. Milutinovic, J.J. Crnkovic, C.E. Houstis, "A Simulation Study of Two Distributed Task Allocation Procedures," IEEE Transactions on Software Engineering, vol. 14, no. 1, pp. 54-61, Jan. 1988, doi:10.1109/32.4622
Usage of this product signifies your acceptance of the Terms of Use.