Filters








5,204 Hits in 2.4 sec

Selection from heaps, row-sorted matrices and X+Y using soft heaps [article]

Haim Kaplan, László Kozma, Or Zamir, Uri Zwick
2018 arXiv   pre-print
We use soft heaps to obtain simpler optimal algorithms for selecting the $k$-th smallest item, and the set of~$k$ smallest items, from a heap-ordered tree, from a collection of sorted lists, and from $  ...  A simplified implementation of soft heaps is given in Kaplan et al. [22] .  ...  These assumptions simplify algorithms that use soft heaps, and further simplify their analysis. The changes needed in the implementation of soft heaps to meet these assumptions are minimal.  ... 
arXiv:1802.07041v1 fatcat:xgxxraibxbcklc7qysvkwchami

Optimally selecting the top k values from X+Y with layer-ordered heaps [article]

Oliver Serang
2020 arXiv   pre-print
The soft heap is initialized to contain tuple (X1 +Y1, 1, 1). Then, as tuple (v, i, j) is popped from soft heap, lower-quality tuples are inserted into the soft heap.  ...  Even though only the minimal k values are desired, "corruption" in the soft heap means that the soft heap will not always pop the minimal value; however, as a result, soft heaps can run faster than the  ... 
arXiv:2001.11607v2 fatcat:kcx7uudijzbszpji2r4f4bd5eu

Soft Sequence Heaps [article]

Gerth Stølting Brodal
2020 arXiv   pre-print
In this paper we explore the design space of soft heaps.  ...  The main contribution of this paper is an alternative soft heap implementation based on merging sorted sequences, with time bounds matching those of Chazelle's soft heaps.  ...  from the soft heap S.  ... 
arXiv:2008.05398v1 fatcat:4yw6tcdeibd5hbobcaeqclbgea

A simpler implementation and analysis of Chazelle's Soft Heaps [chapter]

Haim Kaplan, Uri Zwick
2009 Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms  
Chazelle's soft heaps are derived from the binomial heaps data structure in which each priority queue is composed of a collection of binomial trees.  ...  In exchange for allowing these corruptions, each soft heap operation is performed in O(log 1 ε ) amortized time.  ...  The changes in the implementations enable us to present a simplified and unified amortized analysis. Concluding remarks We presented a simpler implementation of Chazelle's soft heaps.  ... 
doi:10.1137/1.9781611973068.53 fatcat:d4vfuz3nmjhojpbrgnsbq4uz2u

Randomized minimum spanning tree algorithms using exponentially fewer random bits

Seth Pettie, Vijaya Ramachandran
2008 ACM Transactions on Algorithms  
In many ways it resembles more closely the deterministic minimum spanning tree algorithms based on Soft Heaps.  ...  Concepts from the Karger-Klein-Tarjan algorithm, such as F -lightness, MST verification, and sampled graphs, are related to the concepts of edge corruption, subgraph contractibility, and Soft Heaps, which  ...  We use the lower case soft heap to denote any implementation of an abstract soft heap.  ... 
doi:10.1145/1328911.1328916 fatcat:mytnhdzm7fc75huzde36ger27y

Classifying soft error vulnerabilities in extreme-Scale scientific applications using a binary instrumentation tool

Dong Li, Jeffrey S. Vetter, Weikuan Yu
2012 2012 International Conference for High Performance Computing, Networking, Storage and Analysis  
how soft errors impact applications.  ...  Extreme-scale scientific applications are at a significant risk of being hit by soft errors on supercomputers as the scale of these systems and the component density continues to increase.  ...  By placing those data objects into NVM, we may simplify those costly hardware checksum and ECC mechanisms to improve performance and save power.  ... 
doi:10.1109/sc.2012.29 dblp:conf/sc/LiVY12 fatcat:c6z3n655f5cbzddmfvi5f2fsly

Optimally selecting the top k values from X + Y with layer-ordered heaps

Oliver Serang
2021 PeerJ Computer Science  
The algorithm relies on layer-ordered heaps, partial orderings of exponentially sized layers. The algorithm relies only on median-of-medians and is simple to implement.  ...  the soft heap thus far.  ...  The soft heap is initialized to contain tuple (X 1 + Y 1 ,1,1). Then, as tuple (v,i,j) is popped from soft heap, lower-quality tuples are inserted into the soft heap.  ... 
doi:10.7717/peerj-cs.501 pmid:34013031 pmcid:PMC8114817 fatcat:cvdzpev24vdb5dhvqtknkihlqq

Computational materials science: Soft heaps and clumpy crystals

Francesco Sciortino, Emanuela Zaccarelli
2013 Nature  
The second is to use the tools of statistical mechanics to develop a simplified (coarse-grained) model of a soft particle and its interactions with other particles.  ...  Theoretical investigations using coarsegrained models suggest that, in the dense fluid state 2 , soft particles prefer to sit on top of each other, forming heaps or clumps.  ... 
doi:10.1038/493030a pmid:23282357 fatcat:fortjylqo5fuhkc6q3db55owp4

Selection on X_1+X_2+⋯ + X_m with layer-ordered heaps [article]

Patrick Kreitzberg, Kyle Lucke, Oliver Serang
2020 arXiv   pre-print
heaps (2003).  ...  We introduce the "layer-ordered heap," a simple special class of heap with which we produce a new, fast selection algorithm on the Cartesian product.  ...  This is accomplished as a simplified form of the algorithm from theorem 2.  ... 
arXiv:1910.11993v2 fatcat:ia4z7om74fhqhivj6keqcybkce

How Much Can We Simplify a System of Grains? [chapter]

Matthias Müller, Hans J. Herrmann
2001 Lecture Notes in Physics  
In order to simulate larger systems, many proposals have been made to treat collisions in a simplified form.  ...  The algorithm can be generalized to soft sphere potentials. It is also possible to introduce the rotational degrees of freedom [15] .  ...  Examples for Simplified Models Lattice Gas Automata A Lattice Gas Automaton (LGA) proceeds in discrete time steps. The time can therefore be labeled with integers t = 0, 1, 2, ....  ... 
doi:10.1007/3-540-44506-4_24 fatcat:vpwdtqodbjdk5mclgkuy4qosiy

Garbage-first garbage collection

David Detlefs, Christine Flood, Steve Heller, Tony Printezis
2004 Proceedings of the 4th international symposium on Memory management - ISMM '04  
Whole-heap operations, such as global marking, are performed concurrently with mutation, to prevent interruptions proportional to heap or live-data size.  ...  Garbage-First is a server-style garbage collector, targeted for multi-processors with large memories, that meets a soft real-time goal with high probability, while achieving high throughput.  ...  We test five soft real-time goals, for each of three heap sizes, for each benchmark.  ... 
doi:10.1145/1029873.1029879 dblp:conf/iwmm/DetlefsFHP04 fatcat:hgrjgdmpxrgvhpad4pyjkwpofe

Page 36 of The Geographical Journal Vol. 74, Issue 1 [page]

1929 The Geographical Journal  
The trees were mainly soft and cut easily; the most common sort had red sap, like blood.  ...  Our porters, who spread over the hilltop with instructions to look for heaps of stones, were delighted to find five heaps, one at each point of the compass and one in the middle.  ... 

LLBMC: Bounded Model Checking of C and C++ Programs Using a Compiler IR [chapter]

Florian Merz, Stephan Falke, Carsten Sinz
2012 Lecture Notes in Computer Science  
The resulting code is then converted into a logical representation and simplified using rewrite rules. The simplified formula is finally passed to an SMT solver.  ...  The following discussion only considers the heap. Memory blocks on the heap are allocated using malloc and de-allocated using free.  ...  The resulting code is then converted into a logical representation and simplified using rewrite rules. The simplified formula is finally passed to an SMT solver.  ... 
doi:10.1007/978-3-642-27705-4_12 fatcat:bsf4admwzvblziefh6mn4ha2xa

Application-Specific Instruction Set Processor Implementation of List Sphere Detector

Juho Antikainen, Perttu Salmela, Olli Silvén, Markku Juntti, Jarmo Takala, Markus Myllylä
2007 EURASIP Journal on Embedded Systems  
The implementation is based on using memory and heap data structure for symbol vector sorting.  ...  In this way, also the discarded paths can contribute to the soft-value generation. The soft-output MKSE achieves 106.6 Mbps decoding throughput with approximately 97 000 gates.  ...  The review is not limited to breadth-first or soft-output architectures only.  ... 
doi:10.1186/1687-3963-2007-054173 fatcat:3cukjo22mvg67ex2wwqgpy6imm

Prioritized garbage collection: explicit GC support for software caches

Diogenes Nunez, Samuel Z. Guyer, Emery D. Berger
2016 SIGPLAN notices  
Prioritized GC provides an interface similar to soft references, called priority references, which identify objects that the collector can reclaim eagerly if necessary.  ...  The effect is more pronounced in smaller heaps because the soft reference policy is more aggressive.  ...  Most fatally, it doesn't know what to do when given the choice between clearing a soft reference and growing the heap.  ... 
doi:10.1145/3022671.2984028 fatcat:wcwqunluk5dijgo44otdull2ui
« Previous Showing results 1 — 15 out of 5,204 results