Wydział Fizyki Technicznej, Informatyki i Matematyki Stosowanej / Faculty of Technical Physics, Information Technology and Applied Mathematics / W7

Stały URI zbioruhttp://hdl.handle.net/11652/7

Przeglądaj

Wyniki wyszukiwania

Teraz wyświetlane 1 - 2 z 2
  • Pozycja
    Resolving Classical Concurrency Problems Using Outlier Detection
    (Wydawnictwo Politechniki Łódzkiej, 2017) Smoliński, Mateusz
    In 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.
  • Pozycja
    Scheduling system for distributed transaction processing
    (Oficyna Wydawnicza Politechniki Wrocławskiej ; Wrocław, 2009) Smoliński, Mateusz; Kwapisz, Marcin; Lipowska-Nadolska, Ewa
    This chapter describes a method of integration of IT systems working with many shared database storage in distributed environment. Following sections describe new elements in distributed environment: agents, naming service and coordination service. Every IT system pass all transactions on individual agent, that suspend their execution. Agent register suspended transaction in naming service, obtaining binary representation of their resource data. Registered transaction is requested by agent in central coordination service. Detection of conflict between transactions is realized by coordinator service and assures data integrity by controlling the execution of requested transactions. This feature eliminates deadlock and possibility of transactions rollbacks due to data conflicts. Besides theoretical description authors introduce formula for transaction conflict detection. The algorithm of conflicts detection is designed to be executed on a special hardware accelerator based on a systolic array.