Results 151 to 160 of about 635 (170)

Obstruction-free synchronization: double-ended queues as an example

23rd International Conference on Distributed Computing Systems, 2003. Proceedings., 2004
We introduce obstruction-freedom, a new nonblocking property for shared data structure implementations. This property is strong enough to avoid the problems associated with locks, but it is weaker than previous nonblocking properties-specifically lock-freedom and wait-freedom-allowing greater flexibility in the design of efficient implementations ...
Maurice Herlihy, Victor Luchangco, Mark Moir   +2 more
openaire   +1 more source

Real-time simulation of concatenable double-ended queues by double-ended queues (Preliminary Version)

Proceedings of the eleventh annual ACM symposium on Theory of computing - STOC '79, 1979
It is shown that concatenable double-ended queues can be simulated in real-time by double-ended queues without concatenation. Consequently, every multihead Turing machine with head-to-head jumps can be simulated in real-time by multitape Turing machines.
openaire   +1 more source

Catenable double-ended queues

ACM SIGPLAN Notices, 1997
Catenable double-ended queues are double-ended queues (deques) that support catenation (i.e., append) efficiently without sacrificing the efficiency of other operations. We present a purely functional implementation of catenable deques for which every operation, including catenation, takes O (1) amortized time ...
openaire   +1 more source

Computing permutations with double-ended queues, parallel stacks and parallel queues

Proceedings of the fifth annual ACM symposium on Theory of computing - STOC '73, 1973
A memory may be regarded as a computer with input, output and storage facilities, but with no explicit functional capability. The only possible outputs are permutations of a multiset of its inputs. Thus the natural question to ask of a class of memories is, what permutations can its members compute?
openaire   +1 more source

Linearizable Wait-Free Iteration Operations in Shared Double-Ended Queues

Parallel Processing Letters, 2017
Shared data object implementations that allow non-blocking concurrent operations are useful for in-memory data-processing, especially when they support consistent bulk operations like iterations. We propose an algorithmic implementation for concurrent iterators on shared double-ended queues (deques), building on and complementing a known lock-free ...
Panagiota Fatourou, Yiannis Nikolakopoulos, Marina Papatriantafilou   +2 more
openaire   +1 more source

Brief Announcement: Concurrent Double-Ended Priority Queues.

This work provides the first concurrent implementation of a double-ended priority queue (DEPQ). We describe a general way to add an ExtractMax operation to any concurrent priority queue that already supports Insert and ExtractMin.
Fatourou, Panagiota, Ruppert, Eric, Xiradakis, Ioannis   +2 more
openaire   +2 more sources

Optimal Control of a Time-Varying Double-Ended Production Queueing Model

Stochastic Systems, 2021
Chihoon Lee, Xin Liu, Yunan Liu
exaly  

Strategic customer behavior and optimal policies in a passenger–taxi double-ended queueing system with multiple access points and nonzero matching times

Queueing Systems, 2022
Hung Q Nguyen, Tuan Phung-Duc, Phung-Duc Tuan   +2 more
exaly  

Real-Time Double-Ended Queue.

Arch. Formal Proofs, 2022
Balázs Tóth, Tobias Nipkow
openaire   +1 more source

Double-Ended Priority Queues

2004
openaire   +2 more sources