Abstract
The cost of using a computational resource is measured from startup to shutdown, including the cost of time slots between tasks. Concurrent scheduling of multiple scientific workflows on heterogeneous resources can improve resources utilization and reduce the cost. To make full use of waste time slots between the tasks and improve the completion rate of workflows, Expansion Slot Backfill (ESB) algorithm is proposed in this paper for scheduling multiple deadline-constrained workflows on a fixed set of resources. All workflows are mapped to the resources with one by one strategy. Each new task tries to backfill the earliest time slot in turn. When the time slot is not enough to backfill, it can be expanded elastically by the slide of the earlier tasks. If these tasks slide cause some workflow to exceed the deadline constraint, such workflow with fewer time slots is discarded and the slide is withdrawn. Experiments with multiple parameter variations show that the algorithm get better performance in resource utilization, workflows throughput and time complexity.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
