„queue“

Suchergebnisse

2.955 Treffer

• Lower Bounds on the Amortized Time Complexity of Shared Objects
  Attiya, Hagit ; Fouren, Arie 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
• Dynamic Analysis of the Arrow Distributed Directory Protocol in General Networks
  Ghodselahi, Abdolhamid ; Kuhn, Fabian 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Checking Linearizability of Concurrent Priority Queues
  Bouajjani, Ahmed ; Enea, Constantin ; Wang, Chao 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Comments on: recent developments in the queueing problem
  Lorenzo, Leticia
• Recent developments in the queueing problem
  Chun, Youngsub ; Mitra, Manipushpak ; Mutuswami, Suresh
• Rejoinder on: recent developments in the queueing problem
  Chun, Youngsub ; Mitra, Manipushpak ; Mutuswami, Suresh
• Comments on: recent developments in the queueing problem
  Brink, René ˜van denœ
• Comments on: recent developments in the queueing problem
  Yengin, Duygu
• Finding an optimal core on a tree network with M/G/c/c state-dependent queues
  Moshtagh, Mehrdad ; Fathali, Jafar ; Smith, James MacGregor ; Mahdavi-Amiri, Nezam
• Competitive Analysis of Constrained Queueing Systems
  Im, Sungjin ; Kulkarni, Janardhan ; Munagala, Kamesh 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Nontrivial and Universal Helping for Wait-Free Queues and Stacks
  Attiya, Hagit ; Castaneda, Armando ; Hendler, Danny 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
• Latency Aware and Resource-Efficient Bin Pack Autoscaling for Distributed Event Queues: Parameters Impact and Setting
  Ezzeddine, Mazen ; Baude, Françoise ; Huet, Fabrice ; Laaziz, Fatima
• Streaming Complexity of Checking Priority Queues
  Francois, Nathanael ; Magniez, Frédéric 2013 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Stabilization of Branching Queueing Networks
  Brázdil, Tomáš ; Kiefer, Stefan 2012 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Single Source Shortest Paths for All Flows with Integer Costs
  Takaoka, Tadao 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Network Calculus (Dagstuhl Seminar 15112)
  Ciucu, Florin ; Fidler, Markus ; Liebeherr, Jörg ; Schmitt, Jens
• A weightiest Scheduling Based on Queue Length and Queue Delay Restriction for Asynchronous Optical Packet Switch
  Liu,, Huanlin ; Chen,, Yong ; Shi,, Yonghe
• Performance of the Asynchronous Optical Packet Switch Scheduling with Hybrid Queue Buffering
  Liu,, Huanlin ; Zhang,, Zhizhong ; Pan,, Yingjun