„concurrent data structure“

Suchergebnisse

115 Treffer

• Order out of Chaos: Proving Linearizability Using Local Views
  Feldman, Yotam M. Y. ; Enea, Constantin ; Morrison, Adam ; Rinetzky, Noam ; Shoham, Sharon 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• NUMASK: High Performance Scalable Skip List for NUMA
  Daly, Henry ; Hassan, Ahmed ; Spear, Michael F. ; Palmieri, Roberto 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An Improved Bound for Random Binary Search Trees with Concurrent Insertions
  Giakkoupis, George ; Woelfel, Philipp 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Lock Oscillation: Boosting the Performance of Concurrent Data Structures
  Fatourou, Panagiota ; Kallimanis, Nikolaos D. 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Brief Announcement: A Persistent Lock-Free Queue for Non-Volatile Memory
  Friedman, Michal ; Herlihy, Maurice ; Marathe, Virendra ; Petrank, Erez 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Brief Announcement: Black-Box Concurrent Data Structures for NUMA Architectures
  Calciu, Irina ; Sen, Siddhartha ; Balakrishnan, Mahesh ; Aguilera, Marcos K. 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Concurrent Data Structures Linked in Time
  Delbianco, Germán Andrés ; Sergey, Ilya ; Nanevski, Aleksandar ; Banerjee, Anindya 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Deletion without Rebalancing in Non-Blocking Binary Search Trees
  He, Meng ; Li, Mengdu 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Local Linearizability for Concurrent Container-Type Data Structures
  Haas, Andreas ; Henzinger, Thomas A. ; Holzer, Andreas ; Kirsch, Christoph M. ; Lippautz, Michael ; Payer, Hannes ; Sezgin, Ali ; Sokolova, Ana ; Veith, Helmut 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Wait-Free Concurrent Graph Objects with Dynamic Traversals
  Kallimanis, Nikolaos D. ; Kanellou, Eleni 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Heap-Based Concurrent Priority Queue with Mutable Priorities for Faster Parallel Algorithms
  Tamir, Orr ; Morrison, Adam ; Rinetzky, Noam 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Faster Concurrent Range Queries with Contention Adapting Search Trees Using Immutable Data
  Winblad, Kjell 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Systems Programming in Unix/Linux
  Wang, K.C. 2018 Springer International Publishing
• Some comments on “concurrent readers and writers”
  Conradi, Reidar
• Refinement of actions for real-time concurrent systems with causal ambiguity
  Majster-Cederbaum, Mila ; Wu, Jinzhao ; Yue, Houguang
• Thermodynamically consistent concurrent material and structure optimization of elastoplastic multiphase hierarchical systems
  Gangwar, Tarun ; Schillinger, Dominik
• B2-Tree: Page-Based String Indexing in Concurrent Environments
  Schmeißer, Josef ; Schüle, Maximilian E. ; Leis, Viktor ; Neumann, Thomas ; Kemper, Alfons
• Concurrent bisimulations in Petri nets
  Best, Eike ; Devillers, Raymond ; Kiehn, Astrid ; Pomello, Lucia
• A concurrent optimization method of compliant structures embedded with movable piezoelectric actuators considering fundamental frequency constraints
  Wang, Mingze ; Hu, Jingyu ; Luo, Yunfeng ; Liu, Shutian
• Concurrent level set topology and fiber orientation optimization of fiber-reinforced composite structures
  Mokhtarzadeh, M. ; López Jiménez, F. ; Maute, Kurt