A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Core Jini
IEEE Transactions on Computers
An Introduction to Spread-Spectrum Communications
An Introduction to Spread-Spectrum Communications
Predicting Application Run Times Using Historical Information
IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Core Algorithms of the Maui Scheduler
JSSPP '01 Revised Papers from the 7th International Workshop on Job Scheduling Strategies for Parallel Processing
Run-Time Statistical Estimation of Task Execution Times for Heterogeneous Distributed Computing
HPDC '96 Proceedings of the 5th IEEE International Symposium on High Performance Distributed Computing
User-Centric Performance Analysis of Market-Based Cluster Batch Schedulers
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Utilization and Predictability in Scheduling the IBM SP2 with Backfilling
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
The application of microeconomics to the design of resource allocation and control algorithms
The application of microeconomics to the design of resource allocation and control algorithms
Libra: a computational economy-based job scheduling system for clusters
Software—Practice & Experience
Balancing Risk and Reward in a Market-Based Task Service
HPDC '04 Proceedings of the 13th IEEE International Symposium on High Performance Distributed Computing
Double Auction Protocols for Resource Allocation in Grids
ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01
Combinatorial Auctions
Analyzing Market-Based Resource Allocation Strategies for the Computational Grid
International Journal of High Performance Computing Applications
Profitable services in an uncertain world
SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
A taxonomy of market-based resource management systems for utility-driven cluster computing
Software—Practice & Experience
Soft Benchmarks-Based Application Performance Prediction Using a Minimum Training Set
E-SCIENCE '06 Proceedings of the Second IEEE International Conference on e-Science and Grid Computing
A commodity market algorithm for pricing substitutable Grid resources
Future Generation Computer Systems
Precise and realistic utility functions for user-centric performance analysis of schedulers
Proceedings of the 16th international symposium on High performance distributed computing
On the User-Scheduler Dialogue: Studies of User-Provided Runtime Estimates and Utility Functions
International Journal of High Performance Computing Applications
Pricing for Utility-Driven Resource Management and Allocation in Clusters
International Journal of High Performance Computing Applications
A case for cooperative and incentive-based federation of distributed clusters
Future Generation Computer Systems
Predict task running time in grid environments based on CPU load predictions
Future Generation Computer Systems
Economic Grid Resource Management for CPU Bound Applications with Hard Deadlines
CCGRID '08 Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid
Applying double auctions for scheduling of workflows on the Grid
Proceedings of the 2008 ACM/IEEE conference on Supercomputing
A Simulation Framework for Studying Economic Resource Management in Grids
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
The Power of Preemption in Economic Online Markets
GECON '08 Proceedings of the 5th international workshop on Grid Economics and Business Models
Market-based grid resource allocation using a stable continuous double auction
GRID '07 Proceedings of the 8th IEEE/ACM International Conference on Grid Computing
Evaluating the cost-benefit of using cloud computing to extend the capacity of clusters
Proceedings of the 18th ACM international symposium on High performance distributed computing
Dynamic resource selection heuristics for a non-reserved bidding-based Grid environment
Future Generation Computer Systems
An auction method for resource allocation in computational grids
Future Generation Computer Systems
Economic grid resource management using spot and futures markets
Economic grid resource management using spot and futures markets
GECON'07 Proceedings of the 4th international conference on Grid economics and business models
Performance of mobile ad hoc networking routing protocols in realistic scenarios
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume II
T-Alloc: A practical energy efficient resource allocation algorithm for traditional data centers
Future Generation Computer Systems
A weighted-fair-queuing (WFQ)-based dynamic request scheduling approach in a multi-core system
Future Generation Computer Systems
| Hi-index | 0.00 |
General purpose compute clusters are used by a wide range of organizations to deliver the necessary computational power for their processes. In order to manage the shared use of such clusters, scheduling policies are installed to determine if and when the jobs submitted to the cluster are executed. Value-based scheduling policies differ from other policies in that they allow users to communicate the value of their computation to the scheduling mechanism. The design of market mechanisms whereby users are able to bid for resources in a fine-grained manner has proven to be an attractive means to implement such policies. In the clearing phase of the mechanism, supply and demand for resources are matched in pursuit of a value-maximizing job schedule and resource prices are dynamically adjusted to the level of excess demand in the system. Despite their success in simulations and research literature, such fine-grained value-based scheduling policies have been rarely used in practice as they are often considered too fragile, too onerous for end-users to work with, and difficult to implement. A coarse-grained form of value-based scheduling that mitigates the aforementioned disadvantages involves the installation of a priority queuing system with fixed costs per queue. At present, however, it is unclear whether such a coarse-grained policy underperforms in value realization when compared to fine-grained scheduling through auctions, and if so, to what extent. Using workload traces of general purpose clusters we make the comparison and investigate under which conditions efficiency can be gained with the fine-grained policy.