On Developing Framework for Schedulable Priority-Driven Systems: A Futuristic Review

Abstract

Over time, systems’ real-time data access requirements evolved, e.g., Real-Time Systems and Real-Time Database Systems and their variants. Assigning priorities to tasks/transactions in such a system has always been a critical decision as it forms a basis for allocating the limited number of shared resources optimally. This survey article studies the resource scheduling mechanisms of such systems. For resource scheduling, a priority is assigned to the smallest execution unit of the application, depending on the underlying scenario. The already existing resource scheduling algorithms are compared to make future recommendations – further exploration of all such unresolved open priority assignment policy-related problems is critical. Finally, we identify some new target technologies where one could foresee the future possibility of integrating custom-designed priority assignment policies. © 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.