Abstract

ABSTRACTCloud computing is a multifarious computing paradigm incorporating the benefits of service-oriented architecture and utility computing through virtualization. Hybrid cloud, an amalgamation of two or more public and/or private clouds, is gaining high popularity between users due to various reasons involving improved performance, flexible business operations, capacity expansion, optimized costs, and enhanced security. The efficient execution of fine-grained parallel applications onto hybrid cloud system becomes limited due to a number of factors. From the application point of view, it ranges from the dynamicity of the applications to their precedence and communication constraints while for the computational resources, it includes heterogeneity of processors and participating clouds with their interconnection topology. This work proposes a compile time hybrid cloud-based task duplication strategy to execute the fine-grained applications represented as directed acyclic graph (DAG) onto the hybrid cloud environment. The proposed strategy schedules the tasks based on a degree relative to the critical path in the DAG and tries to achieve lower bound of the DAG. Furthermore, it makes an effort to avoid redundant duplication by duplicating only the required parent tasks considering the available idle slots to minimize the execution time of the application. The experimental study reveals that the proposed strategy performs better than its peers in terms of achieving the lower bound more efficiently with lesser degree of duplication for fine-grained jobs. The strategy is highly useful for cloud environment as it results in lower cost of usage of resources with enhanced system utilization.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call