Fast Allocation of Processes in Distributed and Parallel Systems

IEEE Transactions on Parallel and Distributed Systems

Volumn 4, Issue 2, 1993, Pages 164-174

  Woodside, C Murray ^a   Monforton, Gerald G ^b  

^a CARLETON UNIVERSITY   (Canada)

^b NORTEL NETWORKS   (Canada)

Author keywords

Bin packing; communication costs; computing; distributed; heuristic load balancing; MULTIFIT; parallel com puting; process allocation; throughput bound optimization

Indexed keywords

OPTIMIZATION; PARALLEL PROCESSING SYSTEMS;

BIN-PACKING PROBLEM; PROCESS ALLOCATION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0027540696     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.207592     Document Type: Article

References (13)

1. E. G. Coffman, Computer and Job Shop Scheduling Theory. New York: Wiley, 1976.
2. E. G. Coffman Jr., M. R. Garey, and D. S. Johnson, “An application of bin-packing to multiprocessor scheduling,” SIAM J. Compute., vol. 7, pp. 1–17, Feb. 1978.
3. S. H. Bokhari, “Partitioning problems in parallel pipelined and distributed computing,” IEEE Trans. Comput., vol. 37, pp. 48–57, Jan. 1988.
4. K. Efe, “Heuristic models of task assignment scheduling in distributed systems,” IEEE Comput. Mag., pp. 50–56, June 1982.
5. E. A. Williams, “Design, analysis and implementation of distributed systems from a performance perspective,” Ph.D. dissertation, Univ. of Texas at Austin, 1983.
6. H. Stone, “Multiprocessor scheduling with the aid of network flow algorithms,” IEEE Trans. Software Eng., pp. 85–93, Jan. 1977.
7. W. W. Chu, L. J. Holloway, M. T. Lan. and K. Efe, “Task allocation in distributed data processing,” IEEE Comput. Mag., pp. 57–69, Nov. 1980.
8. W. W. Chu and Kin K. Leung, “Task response time model and its applications for real-time distributed processing systems,” in Proc. Real-Time Syst. Symp., Austin, TX, Dec. 1984, pp. 225–236.
9. V. M. Lo, “Heuristic algorithms for task assignment in distributed systems,” IEEE Trans. Comput., pp. 1384–1397, Nov. 1988.
10. R. Constantine, “Analytic performance of software pipelines with rendezvous and communicating tasks,” Master's thesis, Dep. of Systems and Comput. Eng., Carleton Univ., 1989.
11. C. M. Woodside, J. E. Neilson, J. W. Miernik, D. C. Petriu, and R. Constantin, “Performance of concurrent rendezvous systems with complex pipeline structures,” in Proc. Fourth Int. Conf. Modelling Techniques and Tools for Comput. Perform. Eval, Sept. 1988, pp. 361–378.
12. M. R. Garey, R. L. Graham, and J. D. Ullman, “Worst case analysis of memory allocation algorithms,” in Proc. Fourth Annu. ACM Symp. Theory of Comput., 1972, pp. 143–150.
13. D. K. Friesen and M. A. Langston, “Evaluation of a multifit-based scheduling algorithm,” J. Algorithms, no. 7, pp. 35–59, 1986.