Cost and fault-tolerant aware resource management for scientific workflows using hybrid instances on clouds

Vinay, Keshavamurthy; Kumar, Sunil; Raghavendra, Srinivas; Venugopal, K R

doi:10.1007/s11042-017-5304-7

Cited by 12 publications

(2 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Peng et al [13] proposed a WOA algorithm based on a multi-objective model without a fault-tolerance mechanism for optimal task allocation via maximized system performance and efficiency. The authors in [14] proposed a scheduling algorithm that is efficient, low-cost, and FT to minimize the uncertainty and cost of these resources. They used spot and block-spot instances as hybrid instances to reduce the execution costs.…”

Section: Fault Tolerance and Node Discoverymentioning

confidence: 99%

Minimum-Cost-Based Neighbour Node Discovery Scheme for Fault Tolerance under IoT-Fog Networks

Baskar,

Periasamy

2024

Future Internet

View full text Add to dashboard Cite

The exponential growth in data traffic in the real world has drawn attention to the emerging computing technique called Fog Computing (FC) for offloading tasks in fault-free environments. This is a promising computing standard that offers higher computing benefits with a reduced cost, higher flexibility, and increased availability. With the increased number of tasks, the occurrence of faults increases and affects the offloading of tasks. A suitable mechanism is essential to rectify the faults that occur in the Fog network. In this research, the fault-tolerance (FT) mechanism is proposed based on cost optimization and fault minimization. Initially, the faulty nodes are identified based on the remaining residual energy with the proposed Priority Task-based Fault-Tolerance (PTFT) mechanism. The Minimum-Cost Neighbour Candidate Node Discovery (MCNCND) algorithm is proposed to discover the neighbouring candidate Fog access node that can replace the faulty Fog node. The Replication and Pre-emptive Forwarding (RPF) algorithm is proposed to forward the task information to the new candidate Fog access node for reliable transmission. These proposed mechanisms are simulated, analysed, and compared with existing FT methods. It is observed that the proposed FT mechanism improves the utilization of an active number of Fog access nodes. It also saved a residual energy of 1.55 J without replicas, compared to the 0.85 J of energy that is used without the FT method.

show abstract

Section: Fault Tolerance and Node Discoverymentioning

confidence: 99%

Minimum-Cost-Based Neighbour Node Discovery Scheme for Fault Tolerance under IoT-Fog Networks

Baskar,

Periasamy

2024

Future Internet

View full text Add to dashboard Cite

show abstract

“…Vinay et al [ 37 ] have proposed a fault-tolerant scheduling algorithm with a bidding strategy for scientific workflows. This work focused on minimizing the volatility and cost of resource provisioning for scientific workflows.…”

Section: Recent Related Workmentioning

confidence: 99%

OFP-TM: an online VM failure prediction and tolerance model towards high availability of cloud computing environments

Saxena

Singh

2022

J Supercomput

View full text Add to dashboard Cite

The indispensable collaboration of cloud computing in every digital service has raised its resource usage exponentially. The ever-growing demand of cloud resources evades service availability leading to critical challenges such as cloud outages, SLA violation, and excessive power consumption. Previous approaches have addressed this problem by utilizing multiple cloud platforms or running multiple replicas of a Virtual Machine (VM) resulting into high operational cost. This paper has addressed this alarming problem from a different perspective by proposing a novel nline virtual machine ailure rediction and olerance odel (OFP-TM) with high availability awareness embedded in physical machines as well as virtual machines. The failure-prone VMs are estimated in real-time based on their future resource usage by developing an ensemble approach-based resource predictor. These VMs are assigned to a failure tolerance unit comprising of a resource provision matrix and Selection Box (S-Box) mechanism which triggers the migration of failure-prone VMs and handle any outage beforehand while maintaining the desired level of availability for cloud users. The proposed model is evaluated and compared against existing related approaches by simulating cloud environment and executing several experiments using a real-world workload Google Cluster dataset. Consequently, it has been concluded that OFP-TM improves availability and scales down the number of live VM migrations up to 33.5% and 83.3%, respectively, over without OFP-TM.

show abstract

A Cost-Efficient Workflow as a Service Broker Using On-demand and Spot Instances

2023

View full text Add to dashboard Cite

Cost and fault-tolerant aware resource management for scientific workflows using hybrid instances on clouds

Cited by 12 publications

References 24 publications

Minimum-Cost-Based Neighbour Node Discovery Scheme for Fault Tolerance under IoT-Fog Networks

Minimum-Cost-Based Neighbour Node Discovery Scheme for Fault Tolerance under IoT-Fog Networks

OFP-TM: an online VM failure prediction and tolerance model towards high availability of cloud computing environments

A Cost-Efficient Workflow as a Service Broker Using On-demand and Spot Instances

Contact Info

Product

Resources

About