Results 241 to 250 of about 619,805 (296)
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Linked-list visualization for debugging
IEEE Software, 1991Recent extensions to the VIPS debugger are described. In the original version of VIPS, visualization of linked structures was limited to very small lists or to selected portions of larger structures. The newer version of VIPS extends the original work by adding multiple levels of browsers, letting users interactively identify sublists of interest ...
Takao Shimomura, Sadahiro Isoda
exaly +2 more sources
Searching in a Sorted Linked List [PDF]
2018 International Conference on Information Technology (ICIT), 2018 Let A be the array of n integers in {0, 1, …, n-1}. A tree is constructed in O(nloglogm/p+loglogm) time with p processors based on the trie with all the given integers. Additional nodes (O(nloglogm) of them) are added to the tree. After the tree is construct we can, for any given integer, find the predecessor and successor of this integer, insert or ...
Hemasree Koganti, Yijie Han
openaire +3 more sources
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
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