Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/relaxed-criteria-g-negotiation-for-grid-resource-co-allocation-XvxbS33U08
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 2007 by ACM Inc.
- ISSN
- 1551-9031
- DOI
- 10.1145/1228621.1228625
- Publisher site
- See Article on Publisher Site
Abstract
Supporting resource co-allocation is essential for realizing the Grid vision because computational intensive applications may require more resources than a single computing machine can provide in one administrative domain. Given that the various stakeholders often have their own requirements and supply-and-demand patterns, successfully obtaining commitments through concurrent negotiations with multiple resource owners to simultaneously access several resources is a very challenging task. This position paper (i) suggests that a relaxed-criteria G-negotiation mechanism may be used to enhance the success rates of negotiation agents in Grid resource co-allocation, (ii) proposes a testbed for realizing the relaxed-criteria G-negotiation mechanism, (iii) discusses experimental designs for evaluating the proposed mechanism, and (iv) discusses previous results obtained from using a relaxed-criteria G-negotiation protocol for Grid resource allocation.
Journal
ACM SIGecom Exchanges – Association for Computing Machinery
Published: Jan 1, 2007