Red Black Trees and It's Application |
Author(s): |
| Damini Jaiswal , RV college of engineering ; Bhavana R, RV college of engineering ; Sushma T N, RV college of engineering ; Kavitha K S, RV college of engineering |
Keywords: |
| Red-Black Tree |
Abstract |
|
Red black tree data structure is a binary search tree which is self-balancing and is used by CFS to sort runnable tasks. The main advantage of Red-Black trees is that in both insertions and deletions a single top-down pass may be used. Red–black trees offer worst-case guarantees for all insertion time, deletion time, and search time. CPU and Memory are the two main hardware resources through which virtualization can be successfully reached. CPU utilization can be maximized along with the distribution of resources between the tasks. Completely Fair Scheduler (CFS) of Linux is the default scheduler of Linux and it makes sure that equal opportunity is distributed between tasks. Based on minimal virtual time CFS selects it’s next process and to perform this efficiently it uses red black trees (RB tree). |
Other Details |
|
Paper ID: IJSRDV6I90249 Published in: Volume : 6, Issue : 9 Publication Date: 01/12/2018 Page(s): 263-264 |
Article Preview |
|
|
|
|
