ELIMINATION OF TASK STARVATION IN CONFLICTLESS SCHEDULING CONCEPT

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.