ReducedCBT and SuperCBT: two new and improved complete binary tree structures

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Turkish Journal of Electrical Engineering and Computer Science
Volume:24 Issue:4
ReducedCBT and SuperCBT: two new and improved complete binary tree structures

ReducedCBT and SuperCBT: two new and improved complete binary tree structures

Authors : Mevlüt BULUT

Pages : 2150-2162

View : 13 | Download : 9

Publication Date : 0000-00-00

Article Type : Research Paper

Abstract :tree, a separate parent-child-sister hierarchy is employed independent of the parent-child-sister hierarchy used for the rest of the tree. Two different versions of such a local hierarchy are introduced. The result of the first proposed hierarchy is a faster and smaller footprint, while the second one provides size variation functionality without a significant computational overhead. Complexity comparison between the algorithms based on the introduced local hierarchies and ones based on previous complete binary tree structures reveals that the novel approach brings considerable memory gains and performance boosts to the complete binary tree based algorithms.
Keywords : Complete binary tree, CBT, ReducedCBT, SuperCBT, priority queue, pending event set, data structure, event driven simulation

ORIGINAL ARTICLE URL

VIEW PAPER (PDF)

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.