The Rust language offers a promising approach to safe systems programming based on the principle of aliasing XOR mutability : value may be either aliased or mutable, but not both at same time. However, implement pointer-based data structures with internal sharing, such as graphs doubly-linked lists, we need able mutate state. To support structures, provides number APIs that offer so-called inte...

We extend state-of-the-art lock-free linked lists by building linked lists with special care for locality of traversals. These linked lists are built of sequences of entries that reside on consecutive chunks of memory. When traversing such lists, subsequent entries typically reside on the same chunk and are thus close to each other, e.g., in same cache line or on the same virtual memory page. S...

We consider a pedagogy for introducing linked lists in the context of a non-programming, breadth-first introductory course. In short, linked lists are presented based upon their direct embedding in an underlying memory configuration. Though this approach to teaching linked lists is not original, it is surprisingly rare in a breadth-first context. Yet it affords a rich exploration of many key as...

We present a practical lock-free shared data structure that efficiently implements the operations of a concurrent deque as well as a general doubly linked list. The implementation supports parallelism for disjoint accesses and uses atomic primitives which are available in modern computer systems. Previously known lock-free algorithms of doubly linked lists are either based on non-available atom...

An algorithm for solving linear programming problems whose matrix of coefficients contains a large number of "zero" entries is studied. This algorithm is more useful when it is generated as a sub-program in a real-time program. The singly linked lists for storing only the non-zero entries of the coefficients matrix is used. The modified Revised Simplex Method is also used for solving such probl...

Abstract Data Types (ADTs) are a set of highly generic and rigorously modeled data structures in type theory. Lists as a finite sequence of elements are one of the most fundamental and widely used ADTs in system modeling, which provide a standard encapsulation and access interface for manipulating large-volume information and persistent data. This paper develops a comprehensive design pattern o...