A Task Allocation Model for Distributed Computing Systems

IEEE Transactions on Computers

Volumn C-31, Issue 1, 1982, Pages 41-47

  Richard Ma, Perng Yi ^a   Lee, Edward Y S ^a   Tsuchiya, Masahiro ^a  

^a NORTHROP GRUMMAN CORPORATION   (United States)

Author keywords

Branch and bound; distributed processing; interprocessor communication; load balance; NP problem; task allocation

Indexed keywords

COMPUTER SYSTEMS, DIGITAL;

EID: 0019911835     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1982.1675884     Document Type: Article

References (15)

1. V. B. Gylys and J. A. Edwards, “Optimal partitioning of workload for distributed systems,” in Dig. COMPCON Fall 1976, 1976, pp. 353–357.
2. W. W. Chu, “Introduction in the Special Issue on distributed processing systems,” IEEE Trans. Comput., vol. C-29, pp. 1037–1038, Dec. 1980.
3. W. W. Chu, L. J. Holloway, M. Lan, and K. Efe, “Task allocation in distributed data processing,” Computer, vol. 13, pp. 57–69, Nov. 1980.
4. H. S. Stone, “Multiprocessor scheduling with the aid of network flow algorithm,” IEEE Trans. Software Eng., vol. SE-3, pp. 85–93, Jan. 1977.
5. E. Y. S. Lee and P. Ma, “Final report of the distributed processing design technology development (DPDTD) program—Vol. II research results,” TRW Defense Space Syst. Group, Mar. 1981.
6. C. R. Vick, “A next generation of supercomputers: From mainframes to micros,” presented at Euromicro 1980, London, England, Sept. 1980.
7. B. W. Wah, “An efficient heuristic for file placement on distributed database,” in Proc. COMPSAC 1980, Oct. 1980, pp. 462–468.
8. C. C. Price, “The assignment of computational tasks among processors in a distributed system,” in Proc. Nat. Comput. Conf, May 1981, pp. 291–296.
9. P. Chen and J. Akoka, “Optimal design of distributed information system,” IEEE Trans. Comput., vol. C-29, pp. 1068–1079, Dec. 1980.
10. O. I. El-Dessouki and W. H. Huan, “Distributed enumeration on network computers,” IEEE Trans. Comput., vol. C-29, pp. 818–825, Sept. 1980.
11. W. W. Chu, “Optimal file allocation in a multiple computing system,” IEEE Trans. Comput., vol. C-18, pp. 885–889, Oct. 1969.
12. E. G. Coffman, Jr., Ed., Computer and Job-Shop Scheduling Theory. New York: Wiley, 1976.
13. M. L. Green et al., “The DDP underlay simulation experiment: Tactical applications and d-RTOS models,” TRW Defense Space Syst. Group, May 1980.
14. R. H. Hoffman, R. W. Smith, and J. T. Ellis, “Simulation software development for the BMDATC DDP underlay experiment,” in Proc. COMPSAC 1980, Chicago, Oct. 1980, pp. 569–577.
15. M. W. Alford, “A requirements engineering methodology for real-time processing requirements,” IEEE Trans. Software Eng., vol. SE-3, pp. 60–68, Jan. 1977.