ELIMINATION OF TASK STARVATION IN CONFLICTLESS SCHEDULING CONCEPT
Languages of publication
New concept of conflictless task scheduling is an alternative approach to existing solutions in concurrency. Conflictless task scheduling includes data structures and algorithm that prevents occurrence of resource conflict between tasks executed in parallel. The range of applications the conflictless task scheduling includes different environments like transactions processing in database management systems, scheduling of processes or threads in operating systems or business processes management. Task scheduling without any resource conflicts is dedicated to high contention of limited resources environments and its algorithm can be implemented in modern GPU. This paper presents concept of local task scheduling without resources conflicts occurrence, discusses features of new approach and focuses on problem of task starvation. Elimination of task starvation is included in conflictless task scheduling concept, detailed explanation are contained in this paper.
- Du, P., Weber, R., Luszczek, P., Tomov, S., Peterson, G., & Dongarra, J. (2012) From CUDA to OpenCL: Towards a performance-portable solution for multi-platform GPU programming. Parallel Computing, 38 (8), 391-407.
- Flynn M.J., Rudd R. W. (1996) Parallel architectures, ACM Computing Surveys, Volume 28, Issue 1, 67–70.
- Silberschatz A., Galvin P.B., Gagne G. (2012) Operating system concepts, Wiley John Sons, 9th edition.
- Smoliński M. (2010) Rigorous history of distributed transaction execution with systolic array support, XXXI ISAT conference, Information Systems Architecture and Technology New Developments in Web-Age Information Systems, Oficyna Wydawcznicza PW, 235-254.
- Tanenbaum, A., Bos H. (2014) Modern operating systems. Prentice Hall, 4th edition.
Publication order reference