2015
DOI: 10.4018/978-1-4666-8676-2.ch011
|View full text |Cite
|
Sign up to set email alerts
|

Fairness-Aware Task Allocation for Heterogeneous Multi-Cloud Systems

Abstract: Cloud computing is rapidly growing for its on-demand services over the Internet. The customers can use these services by placing the requirements in the form of leases. In IaaS cloud, the customer submits the leases in one of the form, namely advance reservation (AR) and best effort (BE). The AR lease has higher priority over the BE lease. Hence, it can preempt the BE lease. It results in starvation among the BE leases and is unfair to the BE leases. In this chapter, the authors present fairness-aware task all… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
9
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 10 publications
(9 citation statements)
references
References 17 publications
0
9
0
Order By: Relevance
“…The objective of this problem is to achieve fairness among the leases by assigning the leases in the precise order. To the best of our knowledge, this problem is not well-covered in the recent literatures (Li et al, 2012;Panda, Pradhan, Neha, & Sathua, 2015).…”
Section: Preemptionmentioning
confidence: 97%
See 3 more Smart Citations
“…The objective of this problem is to achieve fairness among the leases by assigning the leases in the precise order. To the best of our knowledge, this problem is not well-covered in the recent literatures (Li et al, 2012;Panda, Pradhan, Neha, & Sathua, 2015).…”
Section: Preemptionmentioning
confidence: 97%
“…Note that the fairness time is the product of a threshold value (i.e., (0 ~ 1]) and the execution time of the executed AR lease. The algorithm focuses on the time duration of the leases rather than the number of leases to achieve fairness as used in (Panda, Pradhan, Neha, & Sathua, 2015). We conduct simulations on the proposed algorithm using synthetic datasets.…”
Section: Preemptionmentioning
confidence: 99%
See 2 more Smart Citations
“…These algorithms calculate the minimum completion time, which is the sum of execution time and ready time to balance the workloads. Panda, Neha and Sathua (2015) have considered the uncertainty nature of resources in cloud task scheduling and proposed an uncertainty-based task scheduling algorithm. They have shown the performance of the algorithm in terms of makespan, uncertainty, save makespan, delay makespan and average cloud utilization.…”
Section: Related Workmentioning
confidence: 99%