2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid 2009
DOI: 10.1109/ccgrid.2009.23
|View full text |Cite
|
Sign up to set email alerts
|

Resource Allocation Using Virtual Clusters

Abstract: Abstract-We propose a novel approach for sharing cluster resources among competing jobs. The key advantage of our approach over current solutions is that it increases cluster utilization while optimizing a user-centric metric that captures both notions of performance and fairness. We motivate and formalize the corresponding resource allocation problem, determine its complexity, and propose several algorithms to solve it in the case of a static workload that consists of sequential jobs. Via extensive simulation… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
38
0

Year Published

2010
2010
2021
2021

Publication Types

Select...
3
3
2

Relationship

1
7

Authors

Journals

citations
Cited by 52 publications
(38 citation statements)
references
References 33 publications
0
38
0
Order By: Relevance
“…For the better solution of coordinate the resource using between the multiple users which has their own virtual machine independently, this paper presents a novel resource allocation strategy in which the slowdown degree [14] of user's job is regard as a new metric of QoS and plays the key role in the whole process of resources allocation. This new strategy allows the system to dynamically adjust the amount of resource belonging to the specific user.…”
Section: Introductionmentioning
confidence: 99%
“…For the better solution of coordinate the resource using between the multiple users which has their own virtual machine independently, this paper presents a novel resource allocation strategy in which the slowdown degree [14] of user's job is regard as a new metric of QoS and plays the key role in the whole process of resources allocation. This new strategy allows the system to dynamically adjust the amount of resource belonging to the specific user.…”
Section: Introductionmentioning
confidence: 99%
“…In previous work we proposed an efficient algorithm for off-line minimum yield maximization [32]. Although interesting from a theoretical point of view, this off-line algorithm cannot be applied in practice to our on-line problem: job requests arrive non-deterministically and a resource allocation decision must be made upon the arrival of each request.…”
Section: A System Overview and Use Of Vm Technologymentioning
confidence: 99%
“…We also consider algorithms that try to optimize the resource allocation globally. To this end, we build on the MCB8 algorithm [32], which is itself based on an algorithm proposed by Leinberger et. al.…”
Section: B Non-greedy Algorithmsmentioning
confidence: 99%
“…One of the earliest researches used scheduling algorithm, where the first come first serve [8] method is applied, by determining the smallest number of servers required to meet the SLAs for shared allocation and dedicated allocation resources. Consequently, many of the researches embark on scheduling algorithm such as in [24] proposed an energyconscious scheduling algorithm, while in paper [20], [25], [26] use gang scheduling resource allocation, In paper [25] implemented multi-tiered resource scheduling allocation scheme using virtual clusters to develop a more efficient algorithm. In addition, it is also to determine the preferred allocation strategy of resources.…”
Section: A Resource Allocationmentioning
confidence: 99%
“…However, the works only run in one scenario and not for different scenarios with variety of workload especially for High Performance Application (HPC). M. Stillwell et al [25] conducted a study on resource allocation using virtual clusters which run multiple competing tasks. They have established optimal algorithms which compute allocations of task for different number of nodes.…”
Section: A Resource Allocationmentioning
confidence: 99%