Advanced algorithm for scheduling TM transactions with conflict avoidance

In this paper we developed the AAC algorithm, which surpasses the limitations of the previouslu developed AC algorithm, and which always finds the transaction schedule without conflicts and with minimal span. Additionally, new AAC algorithm was validated, and its performance was compared with the performance of RR, ETLB, and AC algorithms on a processor with four cores, and on the test loads of various levels of concurrency.