Filters








7,593 Hits in 3.7 sec

Self-adjusting binary trees

Daniel Dominic Sleator, Robert Endre Tarjan
1983 Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83  
We use the idea of self-adjusting trees to create new, simple data structures for priority queues (which we call heaps) and search trees.  ...  It follows that a self-adjusting tree is (up to a constant factor) as fast as the optimal fixed tree for a particular probability distribution of search requests, even though the distribution is unknown  ...  We conjecture that under a suitable measure of complexity, self-adjusting trees perform within a constant factor of any binary search tree scheme, on any sequence of operations.  ... 
doi:10.1145/800061.808752 dblp:conf/stoc/SleatorT83 fatcat:7zbqzm3oubfazjvt462sjbtume

Self-Adjusting Heaps

Daniel Dominic Sleator, Robert Endre Tarjan
1986 SIAM journal on computing (Print)  
In this paper we develop the skew heap, a self-adjusting form of heap related to the leftist heaps of Crane and Knuth.  ...  Instead, during each access or update operation we adjust the data structure in a simple, uniform way. We call such a data structure self-adjusting.  ...  This leads to the open problem of devising a self-adjusting heap implementa-than x. SELF-ADJUSTING HEAPS 69 tion with the same amortized time bounds as Fibonacci heaps.  ... 
doi:10.1137/0215004 fatcat:knkabl62brcvjdsesgqiqhqwzu

Toward elastic memory management for cloud data analytics

Jingjing Wang, Magdalena Balazinska
2016 Proceedings of the 3rd ACM SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond - BeyondMR '16  
We present several key elements towards elastic memory management in modern big data systems.  ...  However, we may avoid failures and GC thrashing by dynamic adjusting the heap size limit.  ...  Enabling dynamic heap adjustments The first building block is the ability to change the memory size limits of data analytics applications.  ... 
doi:10.1145/2926534.2926541 dblp:conf/sigmod/WangB16 fatcat:ef6lzm5iffanxoqyu3q64icjsy

Towards Self-optimizing Protocol Stack for Autonomic Communication: Initial Experience [chapter]

Xiaoyuan Gu, Xiaoming Fu, Hannes Tschofenig, Lars Wolf
2006 Lecture Notes in Computer Science  
With inspirations from the natural ecosystem, we are working on the role-based Composable Functional System for self-optimization that features proactive monitoring and control.  ...  A novel cross-layer design approach that combines the advantages of layering and the benefits of holistic and systematic cross-layer optimization is at the core of this work.  ...  of a networked ecosystem towards optimal communication efficiency and evolvability.  ... 
doi:10.1007/11687818_15 fatcat:hwzs5nt5k5g25a46pilabcyn4q

Smooth heaps and a dual view of self-adjusting data structures [article]

László Kozma, Thatchaphol Saranurak
2018 arXiv   pre-print
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.  ...  Assuming the optimality of Greedy, the smooth heap is also optimal within our model of heap algorithms.  ...  Is there a fundamental, general correspondence between self-adjusting BST and self-adjusting heap data structures?  ... 
arXiv:1802.05471v2 fatcat:f7bwxo4pobeepcjrjydhdbjfau

Control theory for principled heap sizing

David R. White, Jeremy Singer, Jonathan M. Aitken, Richard E. Jones
2013 Proceedings of the 2013 international symposium on International symposium on memory management - ISMM '13  
Controltheoretic heap sizing is one such systematic approach.  ...  We propose a new, principled approach to adaptive heap sizing based on control theory. We review current state-of-the-art heap sizing mechanisms, as deployed in Jikes RVM and HotSpot.  ...  Acknowledgments We are grateful to Tony Printezis and Mario Wolczko for confirming our understanding of the HotSpot heap resizing mechanism.  ... 
doi:10.1145/2491894.2466481 dblp:conf/iwmm/WhiteSAJ13 fatcat:nfjomdytkfg33gl4qwegsemqcu

Control theory for principled heap sizing

David R. White, Jeremy Singer, Jonathan M. Aitken, Richard E. Jones
2013 SIGPLAN notices  
Controltheoretic heap sizing is one such systematic approach.  ...  We propose a new, principled approach to adaptive heap sizing based on control theory. We review current state-of-the-art heap sizing mechanisms, as deployed in Jikes RVM and HotSpot.  ...  Acknowledgments We are grateful to Tony Printezis and Mario Wolczko for confirming our understanding of the HotSpot heap resizing mechanism.  ... 
doi:10.1145/2555670.2466481 fatcat:psasthpdzragdildb7wcnofige

ATLAS: Automated Amortised Complexity Analysis of Self-adjusting Data Structures [chapter]

Lorenz Leutgeb, Georg Moser, Florian Zuleger
2021 Lecture Notes in Computer Science  
In this paper, we report on the first fully-automated amortised complexity analysis of self-adjusting data structures.  ...  AbstractBeing able to argue about the performance of self-adjusting data structures such as splay trees has been a main objective, when Sleator and Tarjan introduced the notion of amortised complexity.Analysing  ...  Further, our analysis handles similar self-adjusting data structures like pairing heaps and splay heaps (see Sect. 6.1).  ... 
doi:10.1007/978-3-030-81688-9_5 fatcat:edp7b45jyvaxve5kmaz3lci2h4

A Survey on Priority Queues [chapter]

Gerth Stølting Brodal
2013 Lecture Notes in Computer Science  
Back in 1964 Williams introduced the binary heap as a basic priority queue data structure supporting the operations Insert and Ex-tractMin in logarithmic time.  ...  Self-adjusting priority queues Crane [34] introduced the leftist heaps.  ...  Pairing heaps [76] were introduced as a self-adjusting version of Fibonacci heaps, but the exact asymptotic amortized complexity of pairing heaps remains unsettled.  ... 
doi:10.1007/978-3-642-40273-9_11 fatcat:zocxhiyfmvdgzn2yoob25h3wr4

Type-directed automatic incrementalization

Yan Chen, Jana Dunfield, Umut A. Acar
2012 Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation - PLDI '12  
Based on recent advances in self-adjusting computation, including a theoretical proposal for translating purely functional programs to self-adjusting programs, we develop techniques for translating conventional  ...  In this paper, we describe a significant step towards solving the problem of automatic incrementalization: a programming language and a compiler that can, given a few type annotations describing what can  ...  Final Stage The translated, optimized SXML code has explicit self-adjusting computation primitives, suitable for use with a self-adjusting runtime library implementing these primitives.  ... 
doi:10.1145/2254064.2254100 dblp:conf/pldi/ChenDA12 fatcat:e7yw3prks5ffxfyojxjlb6ymwy

Waste not, want not

Matthew Hertz, Stephen Kane, Elizabeth Keudel, Tongxin Bai, Chen Ding, Xiaoming Gu, Jonathan E. Bard
2011 SIGPLAN notices  
To achieve optimal performance, garbage-collected applications must balance the sizes of their heaps dynamically.  ...  As a result, each virtual machine (VM) must adjust its memory demands to reflect not only the behavior of the application it is running, but also the behavior of the peer applications running on the system  ...  If it is not notified that it must collect its heap, we perform the self-monitoring process from Figure 1.  ... 
doi:10.1145/2076022.1993487 fatcat:zozdr6riyjg2dftr6lkt6wnoaq

Waste not, want not

Matthew Hertz, Stephen Kane, Elizabeth Keudel, Tongxin Bai, Chen Ding, Xiaoming Gu, Jonathan E. Bard
2011 Proceedings of the international symposium on Memory management - ISMM '11  
To achieve optimal performance, garbage-collected applications must balance the sizes of their heaps dynamically.  ...  As a result, each virtual machine (VM) must adjust its memory demands to reflect not only the behavior of the application it is running, but also the behavior of the peer applications running on the system  ...  If it is not notified that it must collect its heap, we perform the self-monitoring process from Figure 1.  ... 
doi:10.1145/1993478.1993487 dblp:conf/iwmm/HertzKKBDGB11 fatcat:mdg7af3oxzckherg6odgmsjux4

Binomial, Fibonacci, and Pairing Heaps [chapter]

Michael Fredman
2004 Handbook of Data Structures and Applications  
Pairing Heaps The pairing heap was designed to be a self-adjusting analogue of the Fibonacci heap, in much the same way that the skew heap is a self-adjusting analogue of the leftist heap The only structure  ...  The pairing heap thus self-organizes the sorted list arrangement to approximate an optimal merge pattern.  ...  Binomial Heap-Specific Algorithms Fibonacci Heap-Specific Algorithms  ... 
doi:10.1201/9781420035179.ch7 fatcat:jvwwedw67rfanpipdy426655li

Optimization of Loader Arm of Wheel Loading Shovel

Miss. Sheetal S. Kolte, Mr. P. A. Makasare
2015 International Journal of Engineering Research and  
Rams of loader arm with existing / standard bucket and To check the stability of machine for the optimized design.  ...  The objective is to test the structure (Dump Height, Digging Depth, Loaction and Interference of joints) in optimize design of loader arm with various iteration / Cycles, Pressure mapping of Cylinder and  ...  I admire his thoughtfulness towards his students and extremely thankful for the same.  ... 
doi:10.17577/ijertv4is041280 fatcat:bqqvvmxjj5cylnistztwa73zyq

Optimal performance trade-offs in MAC for wireless sensor networks powered by heterogeneous ambient energy harvesting

Yunye Jin, Hwee-Pink Tan
2014 2014 IFIP Networking Conference  
In this paper, we first derive the necessary conditions under which channel utilization and fairness are optimal in a WSN-HEAP, respectively.  ...  Simulation results verify the performance tradeoff predicted by our analysis for the proposed HEAP-EDF protocol.  ...  Despite the self-sustainability and cost-effectiveness, the energy harvesting nature of WSNs-HEAP introduces new challenges.  ... 
doi:10.1109/ifipnetworking.2014.6857125 dblp:conf/networking/JinT14 fatcat:vbvekihph5hi7cyn4kcxdfy6vm
« Previous Showing results 1 — 15 out of 7,593 results