Dynamic allocation of communicating tasks in computational grids

IIE Transactions (Institute of Industrial Engineers)

Volumn 36, Issue 11, 2004, Pages 1037-1053

  Krothapalli, Naga ^a   Deshmukh, Abhijit V ^b  

^a iProspect   (United States)

^b UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA COMMUNICATION SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; HEURISTIC METHODS; LARGE SCALE SYSTEMS; MARKOV PROCESSES; MATHEMATICAL MODELS; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; RESOURCE ALLOCATION;

COMPUTATIONAL GRIDS; MARKOV DECISION PROCESS; TASK ALLOCATION;

OPERATIONS RESEARCH;

EID: 4744357459     PISSN: 0740817X     EISSN: None     Source Type: Journal    
DOI: 10.1080/07408170490438645     Document Type: Article

References (42)

1. Abramson, D., Buyya, R. and Giddy, J. (2002) A computational economy for grid computing and its implementation in the nimrod-g resource broker. Future Generation Computer Systems Journal, 18(8), 1061-1074.
2. Anderson, T., Culler, D. and Patterson, D. (1995) A case for now (networks of workstations). IEEE Micro, 15(1), 54-64.
3. Bellman, R. (1957) Dynamic Programming, Princeton University Press, Princeton, NJ.
4. Bokhari, S. (1981a) On the mapping problem. IEEE Transactions on Computers, 30, 207-214.
5. Bokhari, S. (1981b) A shortest tree algorithm for optimal assignments across space and time in a distributed processor system. IEEE Transactions on Software Engineering, 7(6), 583-589.
6. Bollinger, S. and Midkiff, S. (1991) Heuristic techniques for processor and link assignments in multicomputers. IEEE Transactions on Computers, 40(3), 325-333.
7. Boutilier, C., Dean, T. and Hanks, S. (1999) Decision-theoretic planning: structural assumptions and computational language. Journal of Artificial Intelligence Research, 11, 1-94.
8. Buyya, R. and Baker, M. (eds.) (2000) Grid Computing-GRID 2000: Proceeding of the 1st IEEE/ ACM International Workshop, Lecture Notes in Computer Science, Vol. 1971, Springer-Verlag, New York.
9. Cheng, J. and Wellman, M. (1998) The WALRAS algorithm: a convergent distributed implementation of general equilibrium outcomes. Computational Economics, 12, 1-24.
10. Deshmukh, A., Middelkoop, T., Krothpalli, A., Shields, W., Chandra, N. and Smith, C. (2001) Multiagent design architecture for intelligent synthesis environment, Journal of Aircraft, 38(2), 215-223.
11. Dietz, H. and Mattox, T. (2000) Klat2's flat neighborhood network, in Proceedings of the Extreme Linux Track in the 4th Annual Linux Showcase, Atlanta, GA.
12. Durfee, E. (1999) Distributed problem solving and planning, in Multiagent Systems, Weiss, G. (ed.), MIT Press, Cambridge, MA, pp. 121-164.
13. Durfee, E., Lesser, V. and Corkill, Di (1987) Coherent cooperation among communicating problem solvers. IEEE Transactions on Computers, 36(11), 1275-1291.
14. Foster, I. and Kesselman, C. (eds.) (1998) The Grid: Blueprint for a New Computing Infrastructure, Morgan Kauffmann, San Francisco, CA.
15. Garey, M. and Johnson, D. (1979) Computers and Intractability: A Guide to the Theory of NP Completeness, WH. Freeman, New York, NY.
16. Graham, R. (1966) Bounds for certain multiprocessing anomalies. Bell System Technical Journal, 45, 1563-1581.
17. Henderson, R. (1995) Job scheduling under the portable batch system, in Lecture Notes in Computer Science, Vol. 949, Feitelson, D. and Rudolph, L. (eds.), Springer-Verlag, New York, pp. 279-294.
18. Hochbaum, D. and Shmoys, D. (1988) A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach. SIAM Journal on Computing, 17(3), 539-551.
19. Howard, R. (1960) Dynamic Programming and Markov Processes. MIT Press, Cambridge, MA.
20. Johnston, W., Gannon, D. and Nitzberg, B. (1999) Grids as production computing environments: the engineering aspects of NASA's information power grid, in Proceedings of the 8th IEEE International Symposium on High Performance Distributed Computing, IEEE Computer Society Press, Los Alamitos, CA, pp. 3-6.
21. Klemperer, P. (1999) Auction theory: a guide to the literature. Journal of Economic Surveys, 13(3), 227-286.
22. Korpela, E., Werthimer, D., Anderson, D., Cobb, J. and Lebofsky, M. (2001) SETIΗome: massively distributed computing for SETI. Computing in Science and Engineering, 3(1), 78-83.
23. Krothapalli, N. and Deshmukh, A. (1999) Design of negotiation protocols for multi-agent manufacturing systems. International Journal of Production Research, 37(7), 1601-1624.
24. Litzkow, M., Livny, M. and Mukta, M. (1988) Condor - a hunter of idle workstations, in Proceedings of the 8th Conference on Distributed Computing Systems, University of Wisconsin, Madison, pp. 104-111.
25. Lo, V. (1988) Heuristic algorithms for task assignment in distributed sytems. IEEE Transactions on Computers, 37(11), 1384-1397.
26. McAfee, R. and McMillan, J. (1987) Auctions and bidding. Journal of Economic Literature, 25, 699-738.
27. McNaughton, R. (1959) Scheduling with deadlines and loss functions. Management Science, 6, 1-12.
28. Norman, M. and Thanisch, P. (1993) Models of machines and computation for mapping in multicomputers. ACM Computing Surveys, 25(3), 263-302.
29. Nowinski, K., Lesyng, B., Niezgodka, M. and Bala, P. (2001) Project eurogrid, in Proceedings of the PIONIER Conference, Poznan, pp. 187-191.
30. Puterman, M. (1994) Markov Decision Processes: Discrete Stochastic Dynamic Programming, Wiley, New York.
31. Sandholm, T. (1993) An implementation of the contract net protocol based on marginal cost calculations, in Proceedings of the National Conference on Artificial Intelligence, AAAI Press, Menlo Park, CA, pp. 256-262.
32. Schwartz, R. and Kraus, S. (1997) Bidding mechanisms for data allocation in multi-agent environments, in Agent Theories, Architectures, and Languages, Springer, New York, pages 61-75.
33. Serfozo, R. (1976) Monotone optimal policies for Markov decision processes. Mathematical Programming Studies, 6, 202-215.
34. Sinclair, J.B. (1987) Efficient computation of optimal assignments for distributed tasks, Journal of Parallel and Distributed Computing, 4(4), 342-362.
35. Song, H., Liu, X., Jakobsen, D., Bhagwan, R., Zhang, X., Taura, K. and Chien, A. (2000) The microgrid: a scientific tool for modeling computational grids. Scientific Programming, 8(3), 127-141.
36. Stone, H. (1977) Multiprocessor scheduling with the aid of network flow algorithms. IEEE Transactions on Software Engineering, 3, 85-93.
37. Walsh, W., Wellman, M., Wurman, P. and MacKie-Mason, J. (1998) Auction protocols for decentralized scheduling, in Proceedings of The 18th International Conference on Distributed Computing Systems, Amsterdam, The Netherlands, pp. 612-621.
38. Wellman, M. (1993) A market-oriented programming environment and its application to distributed multicommodity flow problems. Journal of Artificial Intelligence Research, 1, 1-22.
39. Whitt, W. (1986) Deciding which queue to join: some counterexamples. Operations Research, 34(1), 55-62.
40. Winston, W. (1977) Optimality of the shortest line discipline. Journal of Applied Probability, 14, 181-189.
41. Ygge, F. and Akkermans, H. (1996) Power load management as a computational market, in Proceedings of the Second International Conference on Multi-Agent Systems, Lesser, V. (ed.), pp. 393-400, AAAI Press, Menlo Park, CA.
42. Zhou, S., Zheng, X., Wang, J. and Delisle, P. (1993) Utopia: a load sharing facility for large, heterogeneous distributed computer systems. Software - Practice and Experience, 23(12), 1305-1336.