Smoliński, Mateusz2021-07-152021-07-152017Smoliński, M. (2017). Resolving Classical Concurrency Problems Using Outlier Detection. Journal of Applied Computer Science, 25(2), 69-88. https://doi.org/10.34658/jacs.2017.2.69-881507-0360http://hdl.handle.net/11652/3880https://doi.org/10.34658/jacs.2017.2.69-88In this paper outlier detection is used to determine anomaly between tasks to prevent occurrence of resource conflicts in prepared schedule. Determined conflictless schedule bases on controlling access of tasks to groups of shared resources. Proposed approach allows to prepare conflictless schedule of efficient parallel task processing without resource conflicts and is dedicated to environments of task processing with high contention of shared resources. In this paper the outlier detection is used to resolve two classical concurrency problems: readers and writers and dining philosophers. In opposition to other known solutions of concurrency problems, proposed approach can be applied to solve different problems and do not require to use additional mechanisms of task synchronization. The universality of proposed approach allows to prepare conflictless schedule even in environments, where classical concurrency problems will be significantly expanded and complicated.enFair use conditionDla wszystkich w zakresie dozwolonego użytkuresource conflict as outliermutual exclusiondeadlock avoidancecooperative concurrency controladaptive conflictless schedulingkonflikt zasobów jako wartości odstającewzajemne wykluczenieunikanie impasukooperacyjna kontrola współbieżnościadaptacyjne bezkonfliktowe planowanieArtykułLUT LicenseLicencja PŁhttps://doi.org/10.34658/jacs.2017.2.69-8810.34658/jacs.2017.2.69-88