We present a new algorithm for concurrent access to array-based priority queue heaps. Deletions proceed top-down as they do in a previous algorithm due to Rao and Kumar 6], but insertions proceed bottom-up, and consecutive insertions use a bit-reversal technique to scatter accesses across the fringe of the tree, to reduce contention. Because insertions do not have to traverse the entire height ...

A bit heap is a data structure that holds the unevaluated sum of an arbitrary number of bits, each weighted by some power of two. Any multivariate polynomial of binary inputs can be expressed as a bit heap whose bits are simple boolean functions of the input bits. For many large arithmetic designs, viewing them as bit heaps is more relevant than viewing them as a composition of adders and multi...

The priority queue is a very important and widely used data structure in computer science, with a variety of applications including Dijkstra’s Single Source Shortest Path algorithm on sparse graph types. This study presents the experimental results of a variety of priority queues. The focus of the experiments is to measure the speed and performance of highly specialized priority queues in out-o...

In this paper we demonstrate a novel intra-procedural technique for detecting heap dependences in sequential programs that use recursive data structures. The novelty of our technique lies in the way we compute, for each statement, abstract heap access paths that approximate the locations accessed by the statement, and the way we convert these paths into equations that can be solved using tradit...

— The need for better quality of service is growing as new quality sensitive services are becoming more and more important in data networks. The key element in providing quality-of-service or gradeof-service in packet networks is deciding when or in what order the incoming packets should depart the system. In other words the departing packets have to be somehow scheduled. Implementing this sche...

We present a new connection between self-adjusting binary search trees (BSTs) and heaps, two fundamental, extensively studied, and practically relevant families of data structures (Allen, Munro, 1978; Sleator, Tarjan, 1983; Fredman, Sedgewick, Sleator, Tarjan, 1986; Wilber, 1989; Fredman, 1999; Iacono, Özkan, 2014). Roughly speaking, we map an arbitrary heap algorithm within a broad and natural...

In this paper, we propose a new fault-tolerant model for replication in distributed-file systems. We combine the advantages of the modular redundancy, primary-stand-by, and weighted priority schemes to address the fault-tolerant model. To fulfill the fault-tolerant requirements, we use the ideas of directoryoriented replication and the extended prefix table while incorporating a two-level heap ...

In this paper, we present a fast and scalable pipelined priority queue architecture for use in high-performance switches with support for fine-grained quality of service (QoS) guarantees. Priority queues are used to implement highest-priority-first scheduling policies. Our hardware architecture is based on a new data structure called a Pipelined heap, or P-heap for short. This data structure en...

Iron is the major impurity in pregnant leaching solutions (PLS) derived from heap and atmospheric acid of low-grade laterite ores. The PLS can be considered as a secondary resource for synthesis high added-value iron nanomaterials, provided that selectively separated polymetallic solution. In this study, feasibility selective separation was investigated by applying solvent extraction technique ...

In this paper, the composite additive of CaF2/CaO was used to extract vanadium from stone coal, and the effect of roasting and leaching kinetics were studied. The purpose of this manuscript is to realize and improve the vanadium recovery from stone coal using the composite additive. The experimental results indicated that the roasted clinker can be obtained under the conditions of CaF2/CaO at a...