AGORA: An architecture for strategyproof computing in grids

Proceedings - ISPDC 2004: Third International Symposium on Parallel and Distributed Computing/HeteroPar '04: Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Hete

Volumn , Issue , 2004, Pages 217-224

  Grosu, Daniel ^a  

^a Wayne State University   (United States)

Author keywords

Grid computing; Mechanism design; Resource management; Strategy proof mechanism

Indexed keywords

GRID COMPUTING; MECHANISM DESIGN; RESOURCE MANAGEMENT; STRATEGYPROOF MECHANISM;

COMPUTER ARCHITECTURE; COMPUTER SIMULATION; DATA PROCESSING; NETWORK PROTOCOLS; PROBLEM SOLVING; RESOURCE ALLOCATION;

PARALLEL PROCESSING SYSTEMS;

EID: 19644370400     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPDC.2004.9     Document Type: Conference Paper

References (27)

1. D. Abramson, R. Buyya, and J. Giddy. A computational economy for grid computing and its implementation in the Nimrod-G resource broker. Future Generation Computing Systems, 18(8):1061-1074. October 2002.
2. Globus Alliance. http://www.globus.org.
3. A. Archer and E. Tardos. Truthful mechanism for one-parameter agents. In Proc. of the 42nd IEEE Symp. on Foundations of Computer Science, pages 482-491, October 2001.
4. A. Archer and E. Tardos. Frugal path mechanisms. In Proc. of the 13th Annual ACM-SIAM Symp. on Discrete Algorithms, pages 991-999, January 2002.
5. R. Buyya, D. Abramson, J. Giddy, and H. Stockinger. Economic models for resource allocation and scheduling in grid computing. Concurrency and Computation: Practice and Experience. 14(13-15):1507-1542, 2002.
6. K. M. Chao, R. Anane, J. H. Chen, and R. Gatward. Negotiating agents in a market-oriented grid. In Proc. of the 2nd IEEE-ACM International Symposium on Cluster Computing and the Grid, pages 406-407, May 2002.
7. C. Chen, M. Maheswaran, and M. Toulouse. Supporting co-allocation in an auctioning-based resource allocator for grid systems. In Proc. of the 11th IEEE Heterogeneous Computing Workshop, April 2002.
8. C. Ernemann, V. Hamscher, and R. Yahyapour. Economic scheduling in grid computing. In Proc. of the 8-th Intl. Workshop on Job Scheduling Strategies for Parallel Processing, pages 128-152. July 2002.
9. J. Feigenbaum, C. Papadimitriou, R. Sami, and S. Shenker. A BGP-based mechanism for lowest-cost routing. In Proc. of the 21st ACM Symp. on Principles of Distributed Computing, pages 173-182, July 2002.
10. J. Feigenbaum, C. Papadimitriou, and S. Shenker. Sharing the cost of multicast transmissions. Journal of Computer and System Sciences, 63(1):21-41, August 2001.
11. J. Feigenbaum and S. Shenker. Distributed algorithmic mechanism design: Recent results and future directions. In Proc. of the 6th ACM Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pages 1-13, September 2002.
12. I. Foster and C. Kesselman. The Grid: a Blueprint for a New Computing Infrastructure. 2nd edition, Morgan Kaufmann, San Francisco, CA, 2003.
13. I. Foster, C. Kesselman, J. Nick, and S. Tuecke. The Physiology of the Grid: An Open Grid Services Architecture for Distributed Systems Integration. Globus Project, June 2002.
14. I. Foster, C. Kesselman, J. M. Nick, and S. Tuecke. Grid services for distributed system integration. IEEE Computer Magazine, 35(6):37-46, June 2002.
15. D. Grosu and A. T. Chronopoulos. Algorithmic mechanism design for load balancing in distributed systems. In Proc. of the 4th IEEE Intl. Conf. on Cluster Computing, pages 445-450, September 2002.
16. D. Grosu and A. T. Chronopoulos. A load balancing mechanism with verification. In Proc. of the 17th IEEE Intl. Parallel and Distributed Processing Symp. Workshop on Advances in Parallel and Distributed Computational Models, pages 163-170, April 2003.
17. J. Nabrzyski, J. M. Schopf, and J. Weglarz. Grid Resource Management. State of the Art and Future Trends. Kluwer Academic Publishers, Boston, MA, 2003.
18. C. Ng, D. Parkes, and M. Seltzer. Strategyproof computing: Systems infrastructures for self-interested parties. In Proc. of the 1st Workshop on Economics of Peer-to-Peer Systems, June 2003.
19. C. Ng, D. Parkes, and M. Seltzer. Virtual worlds: Fast and strategyproof auctions for dynamic resource allocation. In Proc. of the ACM Conference on Electronic Commerce, pages 238-239, June 2003.
20. N. Nisan, S. London, O. Regev, and N. Camiel. Globally distributed computation over Internet - The POPCORN project. In Proc. of the 18th IEEE International Conference on Distributed Computing Systems, pages 592-601, May 1998.
21. N. Nisan and A. Ronen. Algorithmic mechanism design. Games and Economic Behaviour, 35(1/2):166-196, April 2001.
22. M. Osborne and A. Rubinstein. A Course in Game Theory. MIT Press, Cambridge, Mass., 1994.
23. X. Tang and S. T. Chanson. Optimizing static job scheduling in a network of heterogeneous computers. In Proc. of the Intl. Conf. on Parallel Processing, pages 373-382, August 2000.
24. S. Tuecke, K. Czajkowski, I. Foster, J. Frey, S. Graham, C. Kesselman, T. Maguire, T. Sandholm, D. Snelling, and P. Vanderbilt. Open Grid Services Infrastructure (OGSI), Vesrion 1.0. Global Grid Forum, June 2003.
25. S. Vazhkudai and G. von Laszewski. A greedy grid - the grid economic engine directive. In Proc. of the 15th IEEE International Parallel and Distributed Processing Symposium, April 2001.
26. W. E. Walsh, M. P. Wellman, P. R. Wurman, and J. K. MacKie-Mason. Some economics of market-based distributed scheduling. In Proc. of the 18th IEEE International Conference on Distributed Computing Systems, pages 612-621, May 1998.
27. R. Wolski, J. S. Plank, T. Bryan, and J. Brevik. G-commerce: market formulations controlling resource allocation on the computational grid. In Proc. of the 15th IEEE International Parallel and Distributed Processing Symposium, April 2001.