GreedEx---a scalable clearing mechanism for utility computing

DOI10.1007/S10660-008-9023-ZzbMATH Open1161.90406OpenAlexW2013730740MaRDI QIDQ1020573FDOQ1020573

Dirk Neumann, Jochen Stößer

Publication date: 29 May 2009

Published in: Electronic Commerce Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10660-008-9023-z

Recommendations

• A computational economy for grid computing and its implementation in the Nimrod-G resource broker
• A pricing mechanism for resource management in grid computing

zbMATH Keywords

truthfulmarket-based schedulingscalable heuristic

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36)

Cites Work

• CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
• Project Scheduling Under Partially Renewable Resource Constraints
• Title not available (Why is that?)
• Truth revelation in approximately efficient combinatorial auctions
• Title not available (Why is that?)
• Trading grid services - a multi-attribute combinatorial approach
• Predicting application run times with historical information

Cited In (1)

• Title not available (Why is that?)

Uses Software

• Globus Toolkit
• GreedEx
• CABOB

This page was built for publication: GreedEx---a scalable clearing mechanism for utility computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1020573)