Complexity of scheduling parallel task systems
SIAM Journal on Discrete Mathematics
Queueing networks with blocking
Queueing networks with blocking
End-to-end Internet packet dynamics
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Algorithm 368: Numerical inversion of Laplace transforms [D5]
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Local versus Global Schedulers with Processor Co-allocation in Multicluster Systems
JSSPP '02 Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Design and Evaluation of a Resource Selection Framework for Grid Applications
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Dynamic core provisioning for quantitative differentiated services
IEEE/ACM Transactions on Networking (TON)
Applied Laplace- And Z-transforms
Applied Laplace- And Z-transforms
A Framework for Resource Allocation in Grid Computing
MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Energy conservation in heterogeneous server clusters
Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming
Improving parallel job scheduling performance in multi-clusters through selective job coallocation
Improving parallel job scheduling performance in multi-clusters through selective job coallocation
Online resource matching for heterogeneous grid environments
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2 - Volume 02
Scalable content-aware request distribution in cluster-based networks servers
ATEC '00 Proceedings of the annual conference on USENIX Annual Technical Conference
Group-wise performance evaluation of processor co-allocation in multi-cluster systems
JSSPP'07 Proceedings of the 13th international conference on Job scheduling strategies for parallel processing
A self-optimized job scheduler for heterogeneous server clusters
JSSPP'07 Proceedings of the 13th international conference on Job scheduling strategies for parallel processing
Parallel job scheduling — a status report
JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing
The structure and management of service level agreements in networks
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
Cluster computing is excellent for parallel computation. It has become increasingly popular. In cluster computing, a service level agreement (SLA) is a set of quality of services (QoS) and a fee agreed between a customer and an application service provider. It plays an important role in an e-business application. An application service provider uses a set of cluster computing resources to support e-business applications subject to an SLA. In this paper, the QoS includes percentile response time and cluster utilization. We present an approach for resource provisioning in such an environment that minimizes the total cost of cluster computing resources used by an application service provider for an e-business application that often requires parallel computation for high service performance, availability, and reliability while satisfying a QoS and a fee negotiated between a customer and the application service provider. Simulation experiments demonstrate the applicability of the approach.