This paper addresses the problem of designing scalable concurrent priority queues for large scale multiprocessors – machines with up to several hundred processors. Priority queues are fundamental in the design of modern multiprocessor algorithms, with many classical applications ranging from numerical algorithms through discrete event simulation and expert systems. While highly scalable approac...

The identification, isolation, and correction of program defects require the understanding of both the algorithmic structure of the code as well as the data structures that are being manipulated. While modern development environments provide substantial support for examining the program source code (the algorithmic aspect of the program), they provide relatively weak support for examining heap-...

The heap is an important data structure used as a priority queue in a wide variety of parallel algorithms (e.g., multiprocessor scheduling, branch-and-bound). In these algorithms, contention for the shared heap limits the obtainable speedup. This paper presents an approach to allow concurrent insertions and deletions on the heap in a shared-memory multiprocessor. The scheme also retains the str...

An array A[1], . . . , A[n] is a (min) heap if A[⌊i/2⌋] ≤ A[i], for i = 2, . . . , n. The heap is a much used and much studied data structure (for example, see Knuth [K]). Williams’ method for constructing a heap involves repeatedly inserting a key at the bottom of the heap and ’bubbling’ it up. This method requires Θ(n logn) time in the worst case. Let Wn denote the number of ’swaps’ (or ’prom...

An efficient metal recovery in heap leach operations relies on uniform distribution of leaching reagent solution over the pad surface. However, current practices for (HLP) surface moisture monitoring often rely manual inspection, which is labor-intensive, time-consuming, discontinuous, and intermittent. In order to complement process reduce frequency exposing technical manpower hazardous (e.g.,...

A new realization of a space-efficient deque is presented. The data structure is constructed from three singly resizable arrays, each of which is a blockwiseallocated pile (a heap without the order property). The data structure is easily explainable provided that one knows the classical heap concept. All core deque operations are performed in O(1) time in the worst case. Also, general modifying...

Separation logic is an extension of Hoare logic which permits reasoning about low-level imperative programs that use shared mutable heap structure. In this work, we create an extension of separation logic that permits effective, modular reasoning about typed, higher-order functional programs that use aliased mutable heap data, including pointers to code.

With the proliferation of online source code repositories such as GitHub and BitBucket, programmers have instant access to countless code examples. With the availability of these resources the focus in software development shifts away from writing code towards understanding source code. Many common algorithms, that see a lot of reuse across different problem domains, involve complex manipulatio...

This paper describes a new and purely functional implementation technique of binary heaps. A binary heap is a tree-based data structure that implements priority queue operations (insert, remove, minimum/maximum) and guarantees at worst logarithmic running time for them. Approaches and ideas described in this paper present a simple and asymptotically optimal implementation of immutable binary heap.