GreedEx---a scalable clearing mechanism for utility computing

DOI10.1007/s10660-008-9023-zzbMath1161.90406OpenAlexW2013730740MaRDI QIDQ1020573

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

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)

Uses Software

• Globus Toolkit
• GreedEx
• CABOB

Cites Work

• Predicting application run times with historical information
• Trading grid services - a multi-attribute combinatorial approach
• CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
• Project Scheduling Under Partially Renewable Resource Constraints
• Truth revelation in approximately efficient combinatorial auctions
• Unnamed Item
• Unnamed Item

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