{"title":"Advanced algorithm for scheduling TM transactions with conflict avoidance","authors":"M. Popovic, B. Kordic, M. Popovic, I. Basicevic","doi":"10.1109/TELFOR.2017.8249478","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":422501,"journal":{"name":"2017 25th Telecommunication Forum (TELFOR)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 25th Telecommunication Forum (TELFOR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TELFOR.2017.8249478","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
