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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
