A benchmark approach and its toolkit for online scheduling of multiple deadline-constrained workflows in big-data processing systems
- Publication Type:
- Journal Article
- Citation:
- Future Generation Computer Systems, 2018, 85 pp. 222 - 234
- Issue Date:
- 2018-08-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| 1-s2.0-S0167739X17323531-main.pdf | Published Version | 1.98 MB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
© 2018 Elsevier B.V. As distributed systems such as clouds get increasingly popular in the use for big-data processing, there is a need of shifting research attention from minimizing the workflow completion time to satisfying the deadline constraints specified by the users and boosting the benefit of the resource providers. This paper focuses on the online deadline-constrained workflow scheduling problem of how to schedule a set of sequentially submitted workflows with deadline constraints to maximize the resource utilization as well as the success rate of meeting the deadlines. A discrete-event based simulator with a novel benchmark approach is proposed to ease the analysis of the problem. Extensive evaluation has been done to exhibit the effectiveness and significance of the proposed benchmark approach and the developed simulator.
Please use this identifier to cite or link to this item: