Results 231 to 240 of about 2,636,548 (285)
, 1993 Some of the next articles are maybe not open access.
Related searches:
Related searches:
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming, 2012
The linked-list data structure is fundamental and ubiquitous. Lock-free versions of the linked-list are well known. However, the existence of a practical wait-free linked-list has been open. In this work we designed such a linked-list. To achieve better performance, we have also extended this design using the fast-path-slow-path methodology.
Shahar Timnat +3 more
openaire +1 more source
The linked-list data structure is fundamental and ubiquitous. Lock-free versions of the linked-list are well known. However, the existence of a practical wait-free linked-list has been open. In this work we designed such a linked-list. To achieve better performance, we have also extended this design using the fast-path-slow-path methodology.
Shahar Timnat +3 more
openaire +1 more source
Self-Organizing Doubly-Linked Lists
Journal of Algorithms, 1993Summary: We study the problem of maintaining a doubly-linked list (DLL) in approximately optimal order, with respect to the mean search time. We study two types of DLL reorganization strategies. Move-to-end (MTE) [\textit{D. Matthews}, \textit{D. Rotem}, and \textit{E. Bretholz}, Self-organizing doubly-linked lists, J. Comput. Math. Sect.
Valiveti, R. S., Oommen, B. J.
openaire +1 more source
Lock-free linked lists and skip lists
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, 2004Lock-free shared data structures implement distributed objects without the use of mutual exclusion, thus providing robustness and reliability. We present a new lock-free implementation of singly-linked lists. We prove that the worst-case amortized cost of the operations on our linked lists is linear in the length of the list plus the contention, which ...
Mikhail Fomitchev, Eric Ruppert
openaire +1 more source
2017
Ordered linked lists are discussed in this chapter. The insert method is created by carefully looking at inserting in the middle, end, and beginning of a linked list, as well as in an empty list. The delete method is examined and is left as an exercise.
James T. Streib, Takako Soma
openaire +1 more source
Ordered linked lists are discussed in this chapter. The insert method is created by carefully looking at inserting in the middle, end, and beginning of a linked list, as well as in an empty list. The delete method is examined and is left as an exercise.
James T. Streib, Takako Soma
openaire +1 more source
Generalizing singly-linked list reorganizing heuristics for doubly-linked lists
1989The class of memoryless heuristics for maintaining a doubly-linked list in an approximately optimal order is studied. Initially the problem, its representation and the constraints on doubly linked lists are defined. Various mappings and theorems that relate singly-linked list and doubly linked list heuristics are presented, and a new heuristic referred
D. T. H. Ng, B. J. Oommen
openaire +1 more source