A fault-intrusion-tolerant system and deadline-aware algorithm for scheduling scientific workflow in the cloud
Background: Recent technological developments have enabled the execution of more scientific solutions on cloud platforms. Cloud-based scientific workflows are subject to various risks, such as security breaches and unauthorized access to resources. By attacking side channels or virtual machines, att...
Saved in:
Main Authors: | , , , |
---|---|
Format: | Article |
Published: |
PeerJ
2021
|
Online Access: | http://psasir.upm.edu.my/id/eprint/95736/ https://peerj.com/articles/cs-747/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Universiti Putra Malaysia |
id |
my.upm.eprints.95736 |
---|---|
record_format |
eprints |
spelling |
my.upm.eprints.957362023-04-06T07:16:46Z http://psasir.upm.edu.my/id/eprint/95736/ A fault-intrusion-tolerant system and deadline-aware algorithm for scheduling scientific workflow in the cloud Farid, Mazen Latip, Rohaya Hussin, Masnida Abdul Hamid, Nor Asilah Wati Background: Recent technological developments have enabled the execution of more scientific solutions on cloud platforms. Cloud-based scientific workflows are subject to various risks, such as security breaches and unauthorized access to resources. By attacking side channels or virtual machines, attackers may destroy servers, causing interruption and delay or incorrect output. Although cloud-based scientific workflows are often used for vital computational-intensive tasks, their failure can come at a great cost. Methodology: To increase workflow reliability, we propose the Fault and Intrusion-tolerant Workflow Scheduling algorithm (FITSW). The proposed workflow system uses task executors consisting of many virtual machines to carry out workflow tasks. FITSW duplicates each sub-task three times, uses an intermediate data decision-making mechanism, and then employs a deadline partitioning method to determine sub-deadlines for each sub-task. This way, dynamism is achieved in task scheduling using the resource flow. The proposed technique generates or recycles task executors, keeps the workflow clean, and improves efficiency. Experiments were conducted on WorkflowSim to evaluate the effectiveness of FITSW using metrics such as task completion rate, success rate and completion time. Results: The results show that FITSW not only raises the success rate by about 12%, it also improves the task completion rate by 6.2% and minimizes the completion time by about 15.6% in comparison with intrusion tolerant scientific workflow ITSW system. PeerJ 2021 Article PeerReviewed Farid, Mazen and Latip, Rohaya and Hussin, Masnida and Abdul Hamid, Nor Asilah Wati (2021) A fault-intrusion-tolerant system and deadline-aware algorithm for scheduling scientific workflow in the cloud. PeerJ Computer Science, 7. art. no. 747. pp. 1-17. ISSN 2376-5992 https://peerj.com/articles/cs-747/ 10.7717/peerj-cs.747 |
institution |
Universiti Putra Malaysia |
building |
UPM Library |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
Universiti Putra Malaysia |
content_source |
UPM Institutional Repository |
url_provider |
http://psasir.upm.edu.my/ |
description |
Background: Recent technological developments have enabled the execution of more scientific solutions on cloud platforms. Cloud-based scientific workflows are subject to various risks, such as security breaches and unauthorized access to resources. By attacking side channels or virtual machines, attackers may destroy servers, causing interruption and delay or incorrect output. Although cloud-based scientific workflows are often used for vital computational-intensive tasks, their failure can come at a great cost.
Methodology: To increase workflow reliability, we propose the Fault and Intrusion-tolerant Workflow Scheduling algorithm (FITSW). The proposed workflow system uses task executors consisting of many virtual machines to carry out workflow tasks. FITSW duplicates each sub-task three times, uses an intermediate data decision-making mechanism, and then employs a deadline partitioning method to determine sub-deadlines for each sub-task. This way, dynamism is achieved in task scheduling using the resource flow. The proposed technique generates or recycles task executors, keeps the workflow clean, and improves efficiency. Experiments were conducted on WorkflowSim to evaluate the effectiveness of FITSW using metrics such as task completion rate, success rate and completion time.
Results: The results show that FITSW not only raises the success rate by about 12%, it also improves the task completion rate by 6.2% and minimizes the completion time by about 15.6% in comparison with intrusion tolerant scientific workflow ITSW system. |
format |
Article |
author |
Farid, Mazen Latip, Rohaya Hussin, Masnida Abdul Hamid, Nor Asilah Wati |
spellingShingle |
Farid, Mazen Latip, Rohaya Hussin, Masnida Abdul Hamid, Nor Asilah Wati A fault-intrusion-tolerant system and deadline-aware algorithm for scheduling scientific workflow in the cloud |
author_facet |
Farid, Mazen Latip, Rohaya Hussin, Masnida Abdul Hamid, Nor Asilah Wati |
author_sort |
Farid, Mazen |
title |
A fault-intrusion-tolerant system and deadline-aware algorithm for scheduling scientific workflow in the cloud |
title_short |
A fault-intrusion-tolerant system and deadline-aware algorithm for scheduling scientific workflow in the cloud |
title_full |
A fault-intrusion-tolerant system and deadline-aware algorithm for scheduling scientific workflow in the cloud |
title_fullStr |
A fault-intrusion-tolerant system and deadline-aware algorithm for scheduling scientific workflow in the cloud |
title_full_unstemmed |
A fault-intrusion-tolerant system and deadline-aware algorithm for scheduling scientific workflow in the cloud |
title_sort |
fault-intrusion-tolerant system and deadline-aware algorithm for scheduling scientific workflow in the cloud |
publisher |
PeerJ |
publishDate |
2021 |
url |
http://psasir.upm.edu.my/id/eprint/95736/ https://peerj.com/articles/cs-747/ |
_version_ |
1762839469538410496 |