2015
DOI: 10.1007/s00500-015-1662-0
|View full text |Cite
|
Sign up to set email alerts
|

Efficient application scheduling in mobile cloud computing based on MAX–MIN ant system

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 16 publications
(2 citation statements)
references
References 27 publications
0
2
0
Order By: Relevance
“…In Ref. [20], ant colony algorithm is proposed to achieve load balancing and profit in cloud task scheduling. Aziza.…”
Section: Related Workmentioning
confidence: 99%
“…In Ref. [20], ant colony algorithm is proposed to achieve load balancing and profit in cloud task scheduling. Aziza.…”
Section: Related Workmentioning
confidence: 99%
“…In this section, we study the comparative performance of our proposed QCASH (with static SI) and QCASH (with dynamic SI) with some of the existing schedulers in the literature. Like in , the benchmark algorithm adopted for this comparison is the FCFS algorithm. Furthermore, we compare the performances of QCASH (with static and dynamic SIs) with those of PTMM , PAS , and CAAJS algorithms.…”
Section: Performance Evaluationmentioning
confidence: 99%