Filters








927 Hits in 4.5 sec

TRIO: Burst Buffer Based I/O Orchestration

Teng Wang, Sarp Oral, Michael Pritchard, Bin Wang, Weikuan Yu
2015 2015 IEEE International Conference on Cluster Computing  
In this paper, we propose a burst buffer based I/O orchestration framework, named TRIO, to intercept and reshape the bursty writes for better sequential write traffic to storage servers.  ...  Our experimental results demonstrated that TRIO could efficiently utilize storage bandwidth and reduce the average job I/O time by 37% on average for dataintensive applications in typical checkpointing  ...  First, existing framework uses one arbitrator for orchestration, which limits its scalability. So one focus is to distribute the responsibility of the arbitrator to a number of BBs.  ... 
doi:10.1109/cluster.2015.38 dblp:conf/cluster/WangOPWY15 fatcat:ordq4ic3rbdajbottv3yexkeke

AVL trees revisited: A case study in Spectrum [chapter]

R. Hettler, D. Nazareth, F. Regensburger, O. Slotosch
1995 Lecture Notes in Computer Science  
The concept of AVL trees serves as example for presenting this approach.  ...  The goal of this paper is to present a w ay o f d e v eloping software within the axiomatic speci cation language Spectrum.  ...  our algorithms for insert and delete do not have complexity O(log n), where n is the number of elements in the tree.  ... 
doi:10.1007/bfb0015459 fatcat:qpeezabe4bghlfoea2ftsmswye

Efficient applicative data types

Eugene W. Myers
1984 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '84  
Acknowledgements The author would like to thank Chris Fraser, Gary Levin, and David Hanson for their many helpful suggestions.  ...  This work presents O (IgN) time and space algorithms for the applicative manipulation of linear lists. A generalization of an AVL tree, called an AVL dag, is used.  ...  Versions can be deleted in O (1) time. performs updates in O(IgN) time and space and queries in O(IgN) time where N is the number of lines in the text file.  ... 
doi:10.1145/800017.800517 dblp:conf/popl/Myers84 fatcat:uku2t5b62zd4zjcwzw5l4vog6u

An improved scheme for set equality testing and updating

Tak Wah Lam, Ka Hing Lee
1998 Theoretical Computer Science  
Their solution can perform an equality testing in 0( 1) time, but it requires O(n) time for an insert or delete operation.  ...  With regard to the space complexity, these recent schemes [8, 5] both require O(m log m) space.  ...  Fig. 2 2 Fig. 2 trees, every update operation requires O(logn) time and set equality testing O(1) time. Space complexity: At any time t there are two partition trees TO and Tl kept in the memory.  ... 
doi:10.1016/s0304-3975(97)00024-8 fatcat:5hb44wmupbczniqnxmqzco3kly

Performance analysis of BSTs in system software

Ben Pfaff
2004 Performance Evaluation Review  
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels.  ...  for later random access, whereas splay trees perform best for later sequential or clustered access.  ...  The speed of parent pointer and thread representations reflects the ability to use t delete for O(1) deletion.  ... 
doi:10.1145/1012888.1005742 fatcat:rqvuqijbg5hf5h7cu3sjtw6nea

An $O(E\log E + I)$ Expected Time Algorithm for the Planar Segment Intersection Problem

Eugene W. Myers
1985 SIAM journal on computing (Print)  
Key words, concrete complexity, computational geometry, scan-line algorithm, work list bubble sort, distribution-based search 1. Introduction.  ...  Efficient algorithms for the intersection problem treated here provide the basis for faster hidden-line elimination in the "object-space" framework [8], [16], [19].  ...  Budd for their many helpful suggestions.  ... 
doi:10.1137/0214046 fatcat:6qimg7je3jcijcbxkdi6bll7xq

Ternary directed acyclic word graphs

Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara
2004 Theoretical Computer Science  
The idea of ternary trees is to 'implant' the process of binary search for transitions into the structure of the trees themselves.  ...  Furthermore, the scheme of AVL trees is applied to the TDAWGs, yielding a more time-efficient structure AVL TDAWGs.  ...  For any string w ∈ * , TDAWG(w) can be constructed on-line, in O(| |·|w|) time using O(|w|) space. Examples of a non-AVL tree on the left and an AVL tree on the right.  ... 
doi:10.1016/j.tcs.2004.07.008 fatcat:jsyudojjzvgylgd5xadf64p4pi

A Dynamic Data Structure to Efficiently Find the Points below a Line and Estimate Their Number

Bart Kuijpers, Peter Revesz
2017 ISPRS International Journal of Geo-Information  
Whereas many node insertion and deletion methods may result in unbalanced binary search trees (with a search complexity that may become O(m), rather than O(log m)), the AVL tree method dynamically rebalances  ...  Whereas many node insertion and deletion methods may result in unbalanced binary search trees (with a search complexity that may become O(m), rather than O(log m)), the AVL tree method dynamically rebalances  ... 
doi:10.3390/ijgi6030082 fatcat:mwozgjtfandznki5iuc4pb4z3q

Energy-Efficient Algorithms

Erik D. Demaine, Jayson Lynch, Geronimo J. Mirano, Nirvan Tyagi
2016 Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science - ITCS '16  
We explore the time/space/energy trade-off and develop several general techniques for analyzing algorithms and reducing their energy complexity.  ...  trees, binary heaps, and dynamic arrays.  ...  Messick and Licheng Rao for useful discussion and help clarifying our pseudocode and model.  ... 
doi:10.1145/2840728.2840756 dblp:conf/innovations/DemaineLMT16 fatcat:i6r45uh5cfflje2d7hye2f7ic4

The Hidden Binary Search Tree:A Balanced Rotation-Free Search Tree in the AVL RAM Model [article]

Saulo Queiroz
2018 arXiv   pre-print
This means the size of each key in bits is fixed to B=c_2 n (c≥1) once n is determined, otherwise the O(1)-time comparison assumption does not hold.  ...  We show elementary functions to maintain the HSBT height O(B)=O(_2n). This result requires no special order on the input -- as does BST -- nor self-balancing procedures, as do AVL and Red-Black.  ...  AVL [1] , "Red-Black" [4] . Those tasks increase programming complexity in comparison to BSTs.  ... 
arXiv:1711.07746v3 fatcat:hy5yeenpdndflh53edgm2z3ur4

Energy-Efficient Algorithms [article]

Erik D. Demaine, Jayson Lynch, Geronimo J. Mirano, Nirvan Tyagi
2016 arXiv   pre-print
We explore the time/space/energy trade-off and develop several general techniques for analyzing algorithms and reducing their energy complexity.  ...  trees, binary heaps, and dynamic arrays.  ...  Messick and Licheng Rao for useful discussion and help clarifying our pseudocode and model.  ... 
arXiv:1605.08448v1 fatcat:or7pwl5hlvac7cgwl3uq4faltu

An editor for revision control

Christipher W. Fraser, Eugene W. Myers
1987 ACM Transactions on Programming Languages and Systems  
ACKNOWLEDGMENTS The authors thank Dave Hanson and the referees for numerous suggestions that improved both EH and this presentation.  ...  Nonetheless, for every AVL algorithm, A is O(lg N) because each takes O(lg N) time and A* is also O(lg N) because each algorithm modifies a tree along at most two distinct paths.  ...  At the center of AVL tree algorithms for concatenation and sublist selection is a primitive, JOIN(1, X, r).  ... 
doi:10.1145/22719.22948 fatcat:xqxvped6gjcntexdjzsodcoiui

Page 7265 of Mathematical Reviews Vol. , Issue 2004i [page]

2004 Mathematical Reviews  
The space requirement for a tree with n nodes is less than 2.57 + (h — 1)(2+log,((n —1)/(A —1))) bits. The access time per node is in O(1).  ...  Searching for an m-long substring requires O(m-+/) time, where / is the length of the search path. In the suffix AVL-tree this is O(m+logn) in the worst case.  ... 

Some Results for Elementary Operations [chapter]

Athanasios K. Tsakalidis
2009 Lecture Notes in Computer Science  
We present a number of results for elementary operations concerning the areas of data structures, computational geometry, graph algorithms and string algorithms.  ...  I was honored to live in his scientific neighborhood for 13 years as undergraduate student, as graduate student and as collaborator.  ...  I am grateful for everything that he taught me. I would like to say in public "Kurt, ich danke Dir, dass ich Dich in meinem Leben getroffen habe" (Kurt, I thank You that I have met You in my life).  ... 
doi:10.1007/978-3-642-03456-5_8 fatcat:dtpunwag2rdzzmbsryzuzflibq

Deletion Without Rebalancing in Binary Search Trees

Siddhartha Sen, Robert E. Tarjan, David Hong Kyun Kim
2016 ACM Transactions on Algorithms  
An insertion takes up to two rotations and O(1) amortized time, the same as in standard AVL trees.  ...  For many applications of balanced trees, our structure offers performance competitive with that of classical balanced trees.  ...  The time for a deletion is O(h + 1).  ... 
doi:10.1145/2903142 fatcat:ogskwc3idvdbviun63t62i5kdm
« Previous Showing results 1 — 15 out of 927 results