GreedEx---a scalable clearing mechanism for utility computing

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

Authors Jochen Stößer, Dirk Neumann 

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

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)

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

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 1946761 (Why is no real title available?)
• CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
• Predicting application run times with historical information
• Project Scheduling Under Partially Renewable Resource Constraints
• Trading grid services - a multi-attribute combinatorial approach
• Truth revelation in approximately efficient combinatorial auctions

Cited in

(1)

• scientific article; zbMATH DE number 2087946 (Why is no real title available?)

Describes a project that uses

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)