Conflictless task scheduling concept

Abstract

This paper presents new concept of task scheduling without resource conflicts. The proposed task scheduling bases on conflict array, which was created using two binary resource identifiers as representation of task. Those resource identifiers support fast conflict detection between tasks. Preparation of conflict array can be supported by modern GPU. Prepared schedule enable parallel tasks execution without resource conflicts. Elimination of resource conflicts provides deadlock free task processing. Proposed conflict free task scheduling can be used in local and distributed environments with high contention for limited resources. Therefore tasks can be executed without other synchronization mechanisms.