An Improvised Partition-Based Workflow Scheduling Algorithm

##plugins.themes.academic_pro.article.main##

Arun Gopinath

Abstract

Distributed computing is an advancing innovation. Presently a days we see the vast majority of the cloud administrations to finish an entire assignment in a work process. Where we can execute different sub-undertakings in a specific way. Work process Scheduling assumes an imperative part in the distributed computing, since it chooses cost, execution time and different exhibitions in light of various traits. By picking the correct planning strategy can bring about most extreme parcel transmission, can control bundle misfortune and can expand CPU use. In this way we have many segment calculations that can be utilized to plan the work processes. In this paper we have an ad libbed parcel based work process planning calculation in which we attempted to ad lib the segment work process calculation which can plan the undertakings of comparable sort of segments of same asset set. Through this we can serve comparative sort of solicitations by doling out them to a similar asset.

##plugins.themes.academic_pro.article.details##

How to Cite
Arun Gopinath. (2022). An Improvised Partition-Based Workflow Scheduling Algorithm. IIRJET, 2(4). https://doi.org/10.32595/iirjet.org/v2i4.2017.43