Cost-Optimal job allocation schemes for bandwidth-constrained distributed computing systems

Authors:
Preetam Ghosh;Kalyan Basu;Sajal K. Das
Affiliations:
Center for Research in Wireless Mobility and Networking (CReWMaN), The University of Texas at Arlington;Center for Research in Wireless Mobility and Networking (CReWMaN), The University of Texas at Arlington;Center for Research in Wireless Mobility and Networking (CReWMaN), The University of Texas at Arlington
Venue:
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
Year:
2005

Citing 6
Cited 3

Optimal static load balancing in distributed computer systems

Journal of the ACM (JACM)
Optimal load balancing and scheduling in a distributed computer system

Journal of the ACM (JACM)
Optimal load balancing in distributed computer systems

Optimal load balancing in distributed computer systems
Load Balancing in Distributed Systems: An Approach Using Cooperative Games

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
An Extended Alternating-Offers Bargaining Protocol for Automated Negotiation in Multi-agent Systems

On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
Optimizing Static Job Scheduling in a Network of Heterogeneous Computers

ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing

A Game Theory-Based Pricing Strategy to Support Single/Multiclass Job Allocation Schemes for Bandwidth-Constrained Distributed Computing Systems

IEEE Transactions on Parallel and Distributed Systems
Mobility-aware cost-efficient job scheduling for single-class grid jobs in a generic mobile grid architecture

Future Generation Computer Systems
Price-based user-optimal job allocation scheme for grid systems

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper formulates the job allocation problem in distributed systems with bandwidth-constrained nodes. The bandwidth limitations of the nodes play an important role in the design of cost-optimal job allocation schemes. In this paper, we present a pricing strategy for generalized distributed systems by formulating an incomplete information bargaining game on two variables (price and percentage of bandwidth allocated for distributed computing jobs at each node). Next, we present a cost-optimal job allocation scheme for single class jobs that involve the communication delay and hence link bandwidth. We show that our algorithms are comparable to existing job allocation algorithms in minimizing the expected system response time.