Bidding specification language and winner determination for Grid computing scheduling

DOIResolve DOI: http://doi.org/10.1109/CSCWD.2013.6580980
AuthorSearch for: ; Search for: ; Search for:
TypeArticle
Proceedings titleProceedings of the 2013 IEEE 17th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2013
Conference2013 IEEE 17th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2013, 27 June 2013 through 29 June 2013, Whistler, BC
ISBN9781467360852
Article number6580980
Pages305312; # of pages: 8
SubjectBidding languages; Grid/Cloud computing; Resource-scheduling; Winner determination; Winner determination algorithm; Interactive computer systems; Scheduling; Specification languages; Surface measurement; Grid computing
AbstractIn the Grid computing environment, computation, services, and storage belong to different organizations or individuals with different objectives. Entities in this domain are autonomous and self-interested; however, they are willingly to share their resources to achieve their individual and collective goals. In such open environment, the scheduling decision is a challenge given the decentralized nature of the environment. Each entity has specific requirements that need to achieve. This work analysis the environment structure for the Grid, proposes a bidding language that is expressive and a winner determination algorithm that is adequate for the Grid computing environment. © 2013 IEEE.
Publication date
LanguageEnglish
AffiliationNational Research Council Canada (NRC-CNRC); Construction (CONST-CONST)
Peer reviewedYes
NPARC number21269646
Export citationExport as RIS
Report a correctionReport a correction
Record identifier653061ee-0091-4dbe-bd9b-68db8a97bb3c
Record created2013-12-13
Record modified2016-05-09
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)