Author:
Ma’ady Mochamad Nizar Palefi,Syahda Tabina Shafa Nabila
Publisher
Atlantis Press International BV
Reference20 articles.
1. C. L. Monma, “Two-Machine Maximum Flow Time Problem With Series-Parallel Precedence Constraints: an Algorithm and Extensions.,” Oper. Res., vol. 27, no. 4, pp. 792–798, 1979.
2. E. Barbierato, M. Gribaudo, and M. Iacono, “Map-reduce process algebra: a formalism to describe directed acyclic graph task-based jobs in parallel environments,” in International Conference on Analytical and Stochastic Modeling Techniques and Applications, 2019, pp. 85–99.
3. Q. Shang, “A dynamic resource allocation algorithm in cloud computing based on workflow and resource clustering,” J. Internet Technol., vol. 22, no. 2, pp. 403–411, 2021.
4. R. Rajak, S. Kumar, S. Prakash, N. Rajak, and P. Dixit, “A novel technique to optimize quality of service for directed acyclic graph (DAG) scheduling in cloud computing environment using heuristic approach,” J. Supercomput., pp. 1–24, 2022.
5. J. Chen, Y. Yang, C. Wang, H. Zhang, C. Qiu, and X. Wang, “Multitask Offloading Strategy Optimization Based on Directed Acyclic Graphs for Edge Computing,” IEEE Internet Things J., vol. 9, no. 12, pp. 9367–9378, 2022.