Performance Analysis of BSTs in System Software [Extended Abstract] Ben Pfaff Stanford University Department of Computer Science blp@cs.stanford.edu Categories and Subject Descriptors: E.1 [Data Structures]: trees; E.2 [Data Storage Representations]: linked representations; C.4 [Performance of Systems]: performance attributes General Terms: algorithms, performance Keywords: binary search tree, BST, threaded tree, AVL tree, red-black tree, splay tree 3. EXPERIMENTS We ran three experiments to test the 20 variations on binary search trees described in the previous section. 3.1 VMAs 1. INTRODUCTION OS kernels often use binary search tree (BST) based data structures. Choosing the right tree and node representation can signi cantly impact the performance of code that uses these data structures. Surprisingly, there has been little empirical study of the relationship between the algorithms used for managing BST-based data structures and performance characteristics in real systems [6, 2, 10]. This extended abstract outlines performance results for 20 total BST variants: four data structure variants each with ve di erent node representations. 2. DATA STRUCTURES In an ordinary BST, insertion of data items in a pathological order, such as sorted order, causes performance to drop from O(lg n) to O(n) per operation in a n-node tree [7]. One solution is
End of preview. The entire article is 2 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/performance-analysis-of-bsts-in-system-software-omH6O1zhT8
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Performance analysis of BSTs in system software
Pfaff, Ben
Follow ACM SIGMETRICS Performance Evaluation Review
, Volume 32 (1)
Association for Computing Machinery – Jun 1, 2004
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
