Abstract
Many embedded systems have hard resource constraints that make schedules found by list scheduling heuristics infeasible. One of the main challenges yielded by memory constraints and the high degree of parallelism is deadlock. In this paper, our primary goal is to find a feasible solution given the memory constraints. We propose a reservation-based solution, an extension for list scheduling algorithms, that can be integrated into those algorithms and make them aware of memory constraints. We show our technique prevents deadlock and significantly reduces the required memory size. The experimental results on randomly generated graphs and real world applications show that our proposed solution can obtain relatively high-quality solutions with up to 10% makespan improvement and 30% memory reduction on average.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Arras, P.-A., Fuin, D., Jeannot, E., Stoutchinin, A., Thibault, S.: List scheduling in embedded systems under memory constraints. Int. J. Parallel Prog. 43(6), 1103–1128 (2015)
Bathie, G., Marchal, L., Robert, Y., Thibault, S.: Revisiting dynamic DAG scheduling under memory constraints for shared-memory platforms. In: IEEE IPDPS, pp. 597–606 (2020)
Bathie, G., Marchal, L., Robert, Y., Thibault, S.: Dynamic DAG scheduling under memory constraints for shared-memory platforms. Int. J. Netw. Comput. 11(1), 27–49 (2021)
Deelman, E., et al.: The evolution of the Pegasus workflow management software. Comput. Sci. Eng. 21(4), 22–36 (2019)
Fu, H., Yu, C., Sun, J., Wang, M., Du, J.: A list scheduling algorithm for DAG-based parallel computing models. In: Wang, G., Zomaya, A., Perez, G.M., Li, K. (eds.) ICA3PP 2015. LNCS, vol. 9529, pp. 406–419. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-27122-4_28
Lin, W.-F., et al.: ONNC: a compilation framework connecting ONNX to proprietary deep learning accelerators. In: IEEE AICAS, pp. 214–218 (2019)
Livioni. Dag_generator (2022). https://github.com/Livioni/DAG_Generator.git
Luo, J., Zhou, Y., Li, X., Yuan, M., Yao, J., Zeng, J.: Learning to optimize DAG scheduling in heterogeneous environment (2021)
Marchal, L., Nagy, H., Simon, B., Vivien, F.: Parallel scheduling of DAGs under memory constraints. In: IEEE IPDPS, pp. 204–213 (2018)
Miniskar, N.R., Pasupuleti, S.K., Rajagopal, V., Vishnoi, A., Ramasamy, C.K., Gadde, R.N.: Optimal SDRAM buffer allocator for efficient reuse of layer IO in CNNs inference framework. In: IEEE ISCAS, pp. 1–5 (2018)
Topcuoglu, H., Hariri, S., Wu, M.-Y.: Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE TPDS 13(3), 260–274 (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Wang, KS., Chou, J. (2023). A Reservation-Based List Scheduling for Embedded Systems with Memory Constraints. In: Takizawa, H., Shen, H., Hanawa, T., Hyuk Park, J., Tian, H., Egawa, R. (eds) Parallel and Distributed Computing, Applications and Technologies. PDCAT 2022. Lecture Notes in Computer Science, vol 13798. Springer, Cham. https://doi.org/10.1007/978-3-031-29927-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-031-29927-8_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-29926-1
Online ISBN: 978-3-031-29927-8
eBook Packages: Computer ScienceComputer Science (R0)