2011
DOI: 10.14569/ijacsa.2011.021013
|View full text |Cite
|
Sign up to set email alerts
|

Comparison of Workflow Scheduling Algorithms in Cloud Computing

Abstract: Abstract-

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
18
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 22 publications
(20 citation statements)
references
References 18 publications
0
18
0
Order By: Relevance
“…The character "i" would be the original plaintext. The cipher text can be transformed back to the original plaintext by using a decryption algorithm with the same key that was used in encryption [7,11,12,15,16]. In Figure 4 represents the simplified model for back to the original plaintext decryption technique.…”
Section: Working Example Of Decryptionmentioning
confidence: 99%
“…The character "i" would be the original plaintext. The cipher text can be transformed back to the original plaintext by using a decryption algorithm with the same key that was used in encryption [7,11,12,15,16]. In Figure 4 represents the simplified model for back to the original plaintext decryption technique.…”
Section: Working Example Of Decryptionmentioning
confidence: 99%
“…SaaS model service delivery, clients procures cloud-based applications from service providers. A SaaS provider cannot store the unencrypted client data [13]. Network-based access and management of commercially offered software that are handled from centralized locations and enabling clients to access these applications which is remotely over the Internet.…”
Section: Software As a Servicementioning
confidence: 99%
“…According to paper [14], there are many issues in mobile cloud computing due to limitations of mobile devices. Security is the main concern in mobile cloud computing.…”
Section: Previous Workmentioning
confidence: 99%
“…In the above figure , makespan time i.e. the total length of the schedule is displayed for the Hyper-Heuristic Scheduling Algorithm and Improved Hyper-Heuristic Scheduling Algorithm for the dataset taken [7,4,6,9] here 7 are the datacenters, 4 are brokers ,6 are virtual machines and 9 are cloudlets. In the above figure, comparison bar chart of makesapn time is displayed for HHSA and Improved HHSA for all the three datasets i.e.…”
Section: Problem Formulationmentioning
confidence: 99%
“…In the above figure, comparison bar chart of makesapn time is displayed for HHSA and Improved HHSA for all the three datasets i.e. [5,3,4,6] ; [6,4,7,10] and [7,4,6,9]. Table 1 shows the comparison of Improved Hyper-Heuristic Scheduling Algorithm with the Hyper-Heuristic Scheduling Algorithm in terms of least optimized makespan time , by taking dataset [5,6,7] of data centers, dataset [3,4,4] of brokers , dataset [4,7,6] of virtual machines and dataset [6,10,9] of jobs as inputs to virtual environment for solving job scheduling problem (JSP).…”
Section: Problem Formulationmentioning
confidence: 99%