Title
Opportunity cost algorithms for reduction of I/O and interprocess communication overhead in a computing cluster
Abstract
Computing Clusters (CC) consisting of several connected machines, could provide a high-performance, multiuser, time-sharing environment for executing parallel and sequential jobs. In order to achieve good performance in such an environment, it is necessary to assign processes to machines in a manner that ensures efficient allocation of resources among the jobs. This paper presents opportunity cost algorithms for online assignment of jobs to machines in a CC. These algorithms are designed to improve the overall CPU utilization of the cluster and to reduces the I/O and the Interprocess Communication (IPC) overhead. Our approach is based on known theoretical results on competitive algorithms. The main contribution of the paper is how to adapt this theory into working algorithms that can assign jobs to machines in a manner that guarantees near-optimal utilization of the CPU resource for jobs that perform I/O and IPC operations. The developed algorithms are easy to implement. We tested the algorithms by means of simulations and executions in a real system and show that they outperform existing methods for process allocation that are based on ad hoc heuristics.
Year
DOI
Venue
2003
10.1109/TPDS.2003.1167369
Parallel and Distributed Systems, IEEE Transactions
Keywords
Field
DocType
competitive algorithms,message passing,processor scheduling,time-sharing systems,workstation clusters,CC,CPU resource,CPU utilization,I/O reduction,IPC operations,ad hoc heuristics,competitive algorithms,computing cluster,connected machines,interprocess communication overhead,load balancing,multiuser time-sharing environment,near-optimal utilization,online job assignment,opportunity cost algorithms,parallel jobs,process allocation,resource allocation,sequential jobs
Cluster (physics),Computer science,Load balancing (computing),Input/output,Inter-process communication,Computer cluster,Opportunity cost,Distributed computing
Journal
Volume
Issue
ISSN
14
1
1045-9219
Citations 
PageRank 
References 
21
1.15
28
Authors
2
Name
Order
Citations
PageRank
Arie Keren120417.85
Amnon Barak2590119.00