Load sequencing for a parallel processing utility

Authors:
Saravut Charcranoon;Thomas G. Robertazzi;Serge Luryi
Affiliations:
Department of Electrical and Computer Engineering, Stony Brook University, Stony Brook, NY;Department of Electrical and Computer Engineering, Stony Brook University, Stony Brook, NY;Department of Electrical and Computer Engineering, Stony Brook University, Stony Brook, NY
Venue:
Journal of Parallel and Distributed Computing
Year:
2004

Citing 10
Cited 0

Middleware for software leasing over the Internet

Proceedings of the 1st ACM conference on Electronic commerce
Parallel Processor Configuration Design with Processing/Transmission Costs

IEEE Transactions on Computers
Why license when you can rent? Risks and rewards of the application service provider model

SIGCPR '01 Proceedings of the 2001 ACM SIGCPR conference on Computer personnel research
Scheduling Divisible Loads in Parallel and Distributed Systems

Scheduling Divisible Loads in Parallel and Distributed Systems
Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization
An Economic Model to Study Dependencies between Independent Software Vendors and Application Service Providers

Electronic Commerce Research
Application Service Providers: Will They Succeed?

Information Systems Frontiers
Optimizing Computing Costs Using Divisible Load Analysis

IEEE Transactions on Parallel and Distributed Systems
Architecture Requirements for Commercializing Grid Resources

HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Foreword (Special Issue of Cluster Computing on Divisible Load Scheduling)

Cluster Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The monetary cost optimization of a computer utility load distribution problem is examined. The problem is to find the sequence in which to distribute divisible computing load from a root processor to its children processors which achieves the lowest monetary distribution cost. The convergence performance of a heuristic greedy algorithm is studied. This problem is directly relevant to computer utilities which offer computing and software hosting to organizations for a monetary charge.