Algorithms of distributed task allocation for cooperative agents

Theoretical Computer Science

Volumn 242, Issue 1-2, 2000, Pages 1-27

  Kraus, Sarit ^a   Plotkin, Tatjana ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

Multiagents; Queueing networks; Task allocation

Indexed keywords

EID: 0346008343     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00175-3     Document Type: Article

References (50)

1. I.F. Akyildiz, J. Liebeherr, Application of norton's theorem on queueing networks with finite capacities, Proc. IEEE INFOCOM, Vol. 3, 23-27 April 1989, pp. 914-923.
2. F. Baskett, K.M. Chandy, R. Muntz, F. Palacios, Open, closed and mixed networks of queues with different classes of customers, J. ACM 22 (1975) 248-260.
3. A. Billionnet, M.C. Costa, A. Sutter, An efficient algorithm for a task allocation problem, J. ACM 39(3) (1992) 502-518.
4. J.P.C. Blanc, A note on waiting times in systems with queueing in parallel, J. Appl. Probab. 24 (1987) 540-546.
5. J. Blazewicz, J.K. Lenstra, A.H.G. Rinnoy Kan, Scheduling subject to resource constraints: classification and complexity, Discrete Appl. Math. 5 (1983) 11-24.
6. A.H. Bond, L. Gasser, An analysis of problems and research in DAI, in: A.H. Bond, L. Gasser (Eds.), Readings in Distributed Artificial Intelligence, Morgan Kaufmann, San Mateo, CA, 1988, pp. 3-35.
7. S. Bruell, G. Balbo, Computational Algorithms for Closed Queueing Networks, North-Holland, New York, 1982.
8. R.M. Bryant, J.R. Agre, A queueing network approach to the module allocation problem in distributed systems, Performance Evaluation Rev. 10(3) (1981) 181-204.
9. J.P. Buzen, Computational algorithms for closed queueing networks with exponential servers, Commun. ACM 16 (1973) 527-531.
10. S. Cammarata, D. McArthur, R. Steeb, Strategies of cooperation in distributed problem solving, Proc. IJCAI-83, 1983, pp. 767-770.
11. Y. Chow, W. Kohler, Models for dynamic load balancing in heterogeneous multiple processor system, IEEE Trans. Comput. C-28(5) (1979) 354-361.
12. E.G. Coffman (Ed.), Computer and Job-Shop Scheduling Theory, Wiley, New York, 1976.
13. B.W. Conolly, The autostrada queueing problem, J. Appl. Probab. 21 (1984) 394-403.
14. A.E. Conway, N.D. Georganas, Queueing Networks - Exact Computational Algorithms: A Unified Theory Based on Decomposition and Aggregation, MIT Press, Cambridge, 1989.
15. Y. Dallery, D. Towsley, Symmetry property of the throughput in closed tandem queueing networks with finite buffers, Oper. Res. Lett. 10(9) (1991) 541-547.
16. K. Decker, V. Lesser, A one-shot dynamic coordination algorithm for distributed sensor networks, Proc. AAAI-93, 1993, pp. 210-216.
17. I. Dukhovny, E. Koenigsberg, Invariance properties of queueing networks and their application to computer/communication systems, INFOR 19(3) (1981) 185-204.
18. E.H. Durfee, Coordination of Distributed Problem Solvers, Kluwer Academic Publishers, Boston, 1988.
19. E.H. Durfee, V.R. Lesser, Global plans to coordinate distributed problem solvers, Proc. IJCAI-87, 1987, pp. 875-883.
20. E.H. Durfee, J.S. Rosenschein, Distributed problem solving and multiagent systems: Comparisons and examples, Proc. 13th Int. DAI Workshop, Seattle, WA, 1994, pp. 94-104.
21. E. Ephrati, J.S. Rosenschein, The clarke tax as a consensus mechanism among automated agents, Proc. AAAI-91, California, 1991, pp. 173-178.
22. M. Georgeff, Communication and interaction in multiagent planning, Proc. National Conf. on Artificial Intelligence, Washington, DC, 1983, pp. 125-129.
23. R.L. Graham, E.L. Lawler, J.K. Lenstera, A.H.G. Rinnooy Kan, Optimization and approximation in deterministics sequencing and scheduling: a survey, Ann. Discrete Math. 5 (1979) 287-326.
24. D. Gross, C. Harris, Fundamentals of Queueing Theory, Wiley, New York, 1985.
25. B.J. Grosz, S. Kraus, Collaborative plans for complex group activities, Artificial Intell. J. 86 (1996) 269-357.
26. F.B. Hanson, J. Mei, C. Tier, H. Xu, PDAC: a data parallel algorithm for performance analysis of closed queueing networks, Parallel Comput. 19 (1993) 1345-1358.
27. N.R. Jennings, Controlling cooperative problem solving in industrial multiagent systems using joint intentions, Artificial Intell. J. 75(2) (1995) 1-46.
28. J.F.C. Kingman, Two similar queues in parallel, Ann. Math. Statist. 32 (1986) 1314-1323.
29. S. Kraus, J. Wilkenfeld, G. Zlotkin, Multiagent negotiation under time constraints, Artificial Intell. 75(2) (1995) 297-345.
30. H. Lee, Characteristics of optimal workload allocation for closed queueing networks, Performance Evaluat. 12 (1991) 255-268.
31. J. Lui, R. Muntz, D. Towsley, Bounding the mean response time of the minimum expected delay routing policy: an algorithmic approach, IEEE Trans. Comput. 44 (1995) 1371-1382.
32. Z. Liu, D. Towsley, Optimality of the round robin routing policy, J. Appl. Probab. (1998) to appear.
33. P.R. Ma, E. Lee, M. Tsuchiya, A task allocation model for distributed computing systems, IEEE Trans. Comput. C-31 1 (1982) 41-59.
34. T.W. Malone, R.E. Fikes, K.R. Grant, M.T. Howard, Enterprise: a marketlike task schedule for distributed computing environments, in: B.A. Huberman (Ed.), The Ecology of Computation, North-Holland, Amsterdam, 1988, pp. 177-205.
35. T.W. Malone, R.E. Fikes, M.T. Howard, Enterprise: a market-like task scheduler for distributed computing environments, in: B.A. Huberman (Ed.), The Ecology of Computation, North-Holland, Amsterdam, 1988, pp. 177-205.
36. T. Plotkin, E. Peterson, Symmetry and entropy in the problem of optimization of files distribution, Automat. Control Comput. Sci. 17(5) (1983) 5-11.
37. J.S. Rosenschein, Synchronization of multiagent plans, in: A.H. Bond, L. Gasser (Eds.), Readings in Distributed Artificial Intelligence, Morgan Kaufmann, San Mateo, CA, 1988, pp. 187-191.
38. J.S. Rosenschein, G. Zlotkin, Rules of Encounter: Designing Conventions for Automated Negotiation Among Computers, MIT Press, Boston, 1994.
39. T. Sandholm, An implementation of the contract net protocol based on marginal cost calculations, Proc. AAAI-93, 1993, pp. 256-262.
40. O. Shehory, S. Kraus, Task allocation via coalition formation among autonomous agents, Proc. IJCAI95, Montreal, Canada, 1995, pp. 655-661.
41. T.M. Sigmon, K.S. Trivedy, R.A. Wagner, Optimal selection of cpu speed, device capacities, and file assignments, Assoc. Comput. Mach. 27 (1980) 457-473.
42. J.B. Sinclair, Efficient computation of optimal assignments for distributed tasks, J. Parallel Distributed Comput. 4 (1987) 342-362.
43. R.G. Smith, R. Davis, Negotiation as a metaphor for distributed problem solving, Artificial Intell. 20 (1983) 63-109.
44. E. Sonenberg, G. Tidhar, E. Werner, D. Kinny, M. Ljungberg, A. Rao, Planned team activity, Technical Report 26, Australian Artificial Intelligence Institute, Australia, 1992.
45. V.S. Tanaev, Y.N. Sotskov, V.A. Strusevich, Scheduling Theory, Multi-Stage Systems, Kluwer Academic Publishers, Dordrecht, Netherlands, 1994.
46. D. Towsley, Queueing network models with state-dependent routing, J. ACM 27(2) (1980) 323-337.
47. K. Trivedi, R. Wagner, T. Sigmon, Optimal selection of cpu speed, device capabilities and file assignments, J. Assoc. Comput. Math. 27(3) (1980) 457-473.
48. S. Tucci, E.A. MacNair, Implementation of mean-value analysis for open, closed and mixed queueing networks, Comput. Performance 3 (4) (1982) 233-239.
49. W. Winston, Optimality of the shortest line displine, J. Appl. Probab. 14 (1997) 181-189.
50. Y. Zhao, W.K. Grassmann, Numerically stable algorithm for two server queue models, Queueing Systems 8 (1991) 59-80.