An Application of Bayesian Decision Theory to Decentralized Control of Job Scheduling

IEEE Transactions on Computers

Volumn C-34, Issue 2, 1985, Pages 117-130

  Stankovic, John A ^a  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

Bayesian decision theory; cooperation; decentralized control; distributed processing; heuristic technique; job scheduling; simulation; statistical decision theory

Indexed keywords

COMPUTER OPERATING SYSTEMS; COMPUTER SIMULATION; CONTROL SYSTEMS; DECISION THEORY AND ANALYSIS; SCHEDULING;

BAYESIAN DECISION THEORY; DECENTRALIZED CONTROL; JOB SCHEDULING;

COMPUTER SYSTEMS, DIGITAL;

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

References (47)

1. P. A. Bernstein and N. Goodman, “Concurrency control in distributed database systems,” Comput. Surveys, vol. 13, no. 2, pp. 185–221, June 1981.
2. P. A. Bernstein and D. W. Shipman, “The correctness of concurrency control mechanisms in a system for distributed databases (SDD-1),” ACM Trans. Database Syst., vol. 5, no. 1, 52–68, Mar. 1980.
3. S. H. Bokhari, “Dual processor scheduling with dynamic reassignment,” IEEE Trans. Software Eng., vol. SE-5, no. 4, July 1979.
4. R. M. Bryant and R. A. Finkel, “A stable distributed scheduling algorithm,” in Proc. 2nd Int. Conf. Distrib. Comput. Syst., Apr. 1981.
5. Y. -C. Chow and W. Kohler, “Models for dynamic load balancing in a heterogeneous multiple processor system,” IEEE Trans. Comput., vol. C-28, May 1979.
6. T. C. K. Chow and J. A. Abraham, “Load balancing in distributed systems,” IEEE Trans. Software Eng., vol. SE-8, no. 4, 1982.
7. W. W. Chu, “Optimal file allocation in a multiple computing system,” IEEE Trans. Comput., vol. C-18, pp. 885–889, Oct. 1969.
8. W. W. Chu, L. H. Holloway, M. Lan, and K. Efe, “Task allocation in distributed data processing,” Computer, vol. 13, pp. 57–69, Nov. 1980.
9. D. W. Davies, E. Holler, E. D. Jensen, S. R. Kimbleton, B. W. Lamp-son, son, G. LeLann, K. J. Thurber, and R. W. Watson, Distributed Systems—Architecture and Implementation: Lecture Notes in Computer Science, Vol. 105. New York: Springer-Verlag, 1981.
10. K. Efe, “Heuristic models of task assignment scheduling in distributed systems,” Computer, vol. 15, June 1982.
11. I. El-Dessouki and W. H. Huan, “Distributed enumeration on network computers,” IEEE Trans. Comput., vol. C-29, pp. 818–825, Sept. 1980.
12. P. Enslow, “What is a distributed data processing system,” Computer, vol. 11, Jan. 1978.
13. D. J. Farber et al., “The distributed computer system,” in Proc. 7th Annu. IEEE Comput. Soc. Int. Conf., Feb. 1973.
14. M. J. Gonzalez, “Deterministic processor scheduling,” ACM Comput. Surveys, vol. 9, no. 3, 173–204, 1977.
15. A. N. Halter and G. W. Dean, Decisions Under Uncertainty. Chicago, IL: South-Western, 1971.
16. Y. Ho, “Team decision theory and information structures,” Proc. IEEE, vol. 68, June 1980.
17. R. A. Jarvis, “Optimization strategies in adaptive control: A selective survey,” IEEE Trans. Syst., Man, Cybern., vol. SMC-5, Jan. 1975.
18. E. D. Jensen, “The Honeywell experimental distributed processor-An overview of its objectives, philosophy and architectural facilities,” Computer, vol. 11, Jan. 1978.
19. A. K. Jones et al., “Staros, A multiprocessor operating system for the support of task forces,” in Proc. 7th Symp. Oper. Syst. Princ., 1979, pp. 117–127.
20. L. Kleinrock and A. Nilsson, “On optimal scheduling algorithms for time-shared systems,” J. Assoc. Comput. Mach., vol. 28, no. 3, pp. 477–486, July 1981.
21. R. E. Larsen, P. L. McEntire, and J. G. O’Reilly, Tutorial: Distributed Control. Silver Spring, MD: IEEE Computer Society Press, 1982.
22. G. LeLann, “Distributed systems-Towards a formal approach,” in Proc. IFIP Cong., Toronto, Ont., Canada, Aug. 1980, 155–160.
23. B. W. Lindgren, Elements of Decision Theory. New York: MacMillan, 1981.
24. P. Y. R. Ma, E. Y. S. Lee, and M. Tsuchiya, “A task allocation model for distributed computing systems,” IEEE Trans. Comput., vol. C-31, pp. 41–47, Jan. 1982.
25. J. M. McQuillan, “Adaptive routing algorithms for distributed computer networks,” BBN Rep. 2831, May 1974.
26. J. M. McQuillan and D. C. Walden, “The ARPS network design decision,” Comput. Networks, Int. J. Distrib. Inform., vol. 1, no. 5, pp. 243–289, Aug. 1977.
27. D. Menasce, G. Popek, and R. Muntz, “A locking protocol for resource coordination in distributed databases,” ACM Trans. Database Syst., vol. 5, no. 2, pp. 103–138, June 1980.
28. K. S. Narendra, Ed., Proc. Workshop Appl. Adaptive Contr., Yale Univ., New Haven, CT, Aug. 1979.
29. J. Ousterhout, D. Scelza, and P. Sindu, “Medusa-An experiment in distributed operating system structure,” Commun. Assoc. Compst. Mach., vol. 23, Feb. 1980.
30. H. Raiffa and R. Schlaifer, “Applied statistical decision theory,” Div.- Res., Res., Grad. School Bus. Admin., Harvard Univ., Cambridge, MA, 1961.
31. K. Ramamritham and J. A. Stankovic, “Dynamic task scheduling in distributed hard real-time systems,” IEEE Software, July 1984.
32. N. Sandell, R. Varaiya, M. Athans, and M. Safonov, “Survey of decentralized control methods for large scale systems,” IEEE Trans. Auto. Contr., vol. AC-23, no. 2, Apr. 1978.
33. A. Segall, “The modeling of adaptive routing in data-communication networks,” IEEE Trans. Commun., vol. COM-25, pp. 85–95, Jan. 1977.
34. R. G. Smith, “The contract net protocol: High level communication and control in a distributed problem solver,” IEEE Trans. Comput., vol. C-29, Dec. 1980.
35. M. H. Soloman and R. A. Finkel, “Roscoe: A multi-microcomputer operating system,” in Proc. 2nd Rocky Mountain Symp. Micro-Comput., Aug. 1978, pp. 291–310.
36. J. A. Stankovic and A. van Dam, “Research directions in (cooperative) distributed processing,” in Research Directions in Software Technology. Cambridge, MA: M.I.T. Press, 1979.
37. J. A. Stankovic, “A methodology for making decisions in decentralized control algorithms,” Univ. Massachusetts, Amherst, MA, Tech. Rep., Mar. 1982.
38. J. A. Stankovic, “Software communication mechanisms: Procedure calls versus messages,” Computer, vol. 15, Apr. 1982.
39. J. A. Stankovic, N. Chowdhury, R. Mirchandaney, and I. Sidhu, “An evaluation of the applicability of different mathematical approaches to the analysis of decentralized control algorithms,” in Proc. COMPSAC, Nov. 1982.
40. J. A. Stankovic, “Simulations of three adaptive, decentralized controlled, job scheduling algorithms,” Comput. Networks, vol. 8, no. 3, June 1984.
41. J. A. Stankovic and I. Sidhu, “An adaptive bidding algorithm for processes, clusters and distributed groups,” in Proc. 4th Int. Conf. Distrib. Comput. Syst., May 1984.
42. H. S. Stone, “Multiprocessor scheduling with the aid of network flow algorithms,” IEEE Trans. Software Eng., vol. SE-3, Jan. 1977.
43. H. S. Stone and S. H. Bokhari, “Control of distributed processes,” Computer, puter, vol. 11, pp. 97–106, July 1978.
44. R. R. Tenney and N. R. Sandel, Jr., “Structures for distributed decision-making,” making,” IEEE Trans. Syst., Man, Cybern., vol. SMC-11, pp. 517–527, Aug. 1981.
45. “Strategies for distributed decisionmaking,” IEEE Trans. Syst., Man, Cybern., vol. SMC-11, pp. 527–538, Aug. 1981.
46. R. L. Winkler, Introduction to Bayesian Inference and Decision. New York: Holt, Rinehart and Winston, 1972.
47. L. Wittie and A. M. van Tilborg, “MICROS, A distributed operating system for micronet, A reconfigurable network computer,” IEEE Trans. Comput., vol. C-29, Dec. 1980.