Výsledky vyhledávání

Autor: Alex Kogan, Dave Dice

Publikováno v: SPAA

We present Hemlock, a novel mutual exclusion locking algorithm that is extremely compact, requiring just one word per thread plus one word per lock, but which still provides local spinning in most circumstances, high throughput under contention, and

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a078a44b876156f408d1a4fd527e1f76
https://doi.org/10.1145/3409964.3461805

Zobrazit plný text záznamu

Improving Parallelism in Hardware Transactional Memory

Autor: Dave Dice, Maurice Herlihy, Alex Kogan

Publikováno v: ACM Transactions on Architecture and Code Optimization. 15:1-24

Today’s hardware transactional memory (HTM) systems rely on existing coherence protocols, which implement a requester-wins strategy. This, in turn, leads to poor performance when transactions frequently conflict, causing them to resort to a non-spe

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::4d82286a61123bd8c170288c03971762
https://doi.org/10.1145/3177962

Zobrazit plný text záznamu

Scalable Range Locks for Scalable Address Spaces and Beyond

Autor: Dave Dice, Alex Kogan, Shady Issa

Publikováno v: EuroSys

Range locks are a synchronization construct designed to provide concurrent access to multiple threads (or processes) to disjoint parts of a shared resource. Originally conceived in the file system context, range locks are gaining increasing interest

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1d70865f648f01682284133d5748c1e7

Zobrazit plný text záznamu

Avoiding Scalability Collapse by Restricting Concurrency

Autor: Alex Kogan, Dave Dice

Publikováno v: Lecture Notes in Computer Science ISBN: 9783030293994
Euro-Par

Saturated locks often degrade the performance of a multithreaded application, leading to a so-called scalability collapse problem. This problem arises when a growing number of threads circulating through a saturated lock causes the overall applicatio

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::032cd13725e079fa0694ca2d16e9a0fd
https://doi.org/10.1007/978-3-030-29400-7_26

Zobrazit plný text záznamu

TWA – Ticket Locks Augmented with a Waiting Array

Autor: Dave Dice, Alex Kogan

Publikováno v: Lecture Notes in Computer Science ISBN: 9783030293994
Euro-Par

The classic ticket lock is simple and compact, consisting of ticket and grant fields. Arriving threads atomically fetch-and-increment ticket to obtain an assigned ticket value, and then wait for grant to become equal to that value, at which point the

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::caca4b847199011562e82f2de3abbe70
https://doi.org/10.1007/978-3-030-29400-7_24

Zobrazit plný text záznamu

Compact NUMA-Aware Locks

Autor: Alex Kogan, Dave Dice

Publikováno v: EuroSys

Modern multi-socket architectures exhibit non-uniform memory access (NUMA) behavior, where access by a core to data cached locally on a socket is much faster than access to data cached on a remote socket. Prior work offers several efficient NUMA-awar

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6a1f1f7f8e741c46f0d92ee571947b1

Zobrazit plný text záznamu

Towards an efficient pauseless Java GC with selective HTM-based access barriers

Autor: Christof Fetzer, Gaël Thomas, Yaroslav Hayduk, Maria Carpen-Amarie, Pascal Felber, Dave Dice

Publikováno v: Proceedings MANLANG 2017 : 14th international conference on Managed Languages and Runtimes
MANLANG 2017 : 14th international conference on Managed Languages and Runtimes
MANLANG 2017 : 14th international conference on Managed Languages and Runtimes, Sep 2017, Prague, Czech Republic. pp.85-91, ⟨10.1145/3132190.3132208⟩
ManLang

International audience; The garbage collector (GC) is a critical component of any managed runtime environment (MRE), such as the Java virtual machine. While the main goal of the GC is to simplify and automate memory management, it may have a negative

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a2c7c0bfee8841e638a5ad29ecc93deb
https://hal.archives-ouvertes.fr/hal-01698357

Zobrazit plný text záznamu

Software-based contention management for efficient compare-and-swap operations

Autor: Danny Hendler, Dave Dice, Ilya Mirsky

Publikováno v: Concurrency and Computation: Practice and Experience. 26:2386-2404

Many concurrent data-structure implementations - both blocking and non-blocking - use the well-known compare-and-swap CAS operation, supported in hardware by most modern multiprocessor architectures, for inter-thread synchronization. A key weakness o

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::bc198522684506be31c3ff0dff50fa44
https://doi.org/10.1002/cpe.3304

Zobrazit plný text záznamu

NUMA-aware reader-writer locks

Autor: Dave Dice, Irina Calciu, Victor Luchangco, Nir Shavit, Yossi Lev, Virendra J. Marathe

Publikováno v: PPOPP

Non-Uniform Memory Access (NUMA) architectures are gaining importance in mainstream computing systems due to the rapid growth of multi-core multi-chip machines. Extracting the best possible performance from these new machines will require us to revis

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::13dbdf0c261fe0469dcd0065279a343e
https://doi.org/10.1145/2517327.2442532

Zobrazit plný text záznamu

Fast non-intrusive memory reclamation for highly-concurrent data structures

Autor: Maurice Herlihy, Dave Dice, Alex Kogan

Publikováno v: ISMM

Current memory reclamation mechanisms for highly-concurrent data structures present an awkward trade-off. Techniques such as epoch-based reclamation perform well when all threads are running on dedicated processors, but the delay or failure of a sing

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::1ddfa216201999763f9829251f7e62c4
https://doi.org/10.1145/2926697.2926699

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání