Voici les éléments 1 - 5 sur 5
- PublicationMétadonnées seulementDeadline-Aware Scheduling for Software Transactional Memory(: IEEE, 2011-1-13)
; ; ; ;Lawall, Julia ;Muller, GillesSoftware Transactional Memory (STM) is an optimistic concurrency control mechanism that simplifies the development of parallel programs. Still, the interest of STM has not yet been demonstrated for reactive applications that require bounded response time for some of their operations. We propose to support such applications by allowing the developer to annotate some transaction blocks with deadlines. Based on previous execution statistics, we adjust the transaction execution strategy by decreasing the level of optimism as the deadlines near through two modes of conservative execution, without overly limiting the progress of concurrent transactions. Our implementation comprises a STM extension for gathering statistics and implementing the execution mode strategies. We have also extended the Linux scheduler to disable preemption or migration of threads that are executing transactions with deadlines. Our experimental evaluation shows that our approach significantly improves the chance of a transaction meeting its deadline when its progress is hampered by conflicts.
- PublicationMétadonnées seulementSupporting time-based QoS requirements in software transactional memory(2015-7-1)
; ; ; ;Lawall, Julia ;Muller, GillesSoftware Transactional Memory (STM) is an optimistic concurrency control mechanism that simplifies parallel programming. Still, there has been little interest in its applicability for reactive applications in which there is a required response time for certain operations. We propose supporting such applications by allowing programmers to associate time with atomic blocks in the forms of deadlines and QoS requirements. Based on statistics of past executions, we adjust the execution mode of transactions by decreasing the level of optimism as the deadline approaches. In the presence of concurrent deadlines, we propose different conflict resolution policies. Execution mode switching mechanisms allow meeting multiple deadlines in a consistent manner, with potential QoS degradations being split fairly among several threads as contention increases, and avoiding starvation. Our implementation consists of extensions to a STM runtime that allow gathering statistics and switching execution modes. We also propose novel contention managers adapted to transactional workloads subject to deadlines. The experimental evaluation shows that our approaches significantly improve the likelihood of a transaction meeting its deadline and QoS requirement, even in cases where progress is hampered by conflicts and other concurrent transactions with deadlines.
- PublicationMétadonnées seulementThe Velox Transactional Memory Stack(2010-1-13)
;Afek, Yehuda ;Drepper, Ulrich ; ;Fetzer, Christof ;Gramoli, Vincent ;Hohmuth, Michael ; ;Stenström, Per ;Unsal, Osman ; ;Harmanci, Mehmet Derin ; ;Diestelhorst, Stephan ;Pohlack, Martin ;Cristal, Adrian ;Hur, Ibrahim ;Dragojevic, Aleksandar ;Guerraoui, Rachid ;Kapalka, Michal ;Tomic, Sasa ;Korland, Guy ;Shavit, Nir ;Nowack, MartinRiegel, Torvald
- PublicationMétadonnées seulementKernel-Assisted Scheduling and Deadline Support for Software Transactional Memory(2011-5-17)
; ; ; ;Lawall, Julia ;Muller, Gilles
- PublicationMétadonnées seulementScheduling Support for Transactional Memory Contention Management(2010)
; ; ; ;Suissa, Adi ;Hendler, Danny ;Fedorova, Alexandra ;Lawall, JuliaMuller, Gilles