Radix Tree, IDR APIs and Their Test Suite
Linux radix tree is a mechanism by which a (pointer) value can be associated with a (long) integer key efficiently in terms of storage, and lookups. Additional features driven by kernel-specific needs …
| Talk Title | Radix Tree, IDR APIs and Their Test Suite |
| Speakers | Sandhya Bankar (Student, G.H.R.C.E Pune, Maharashtra, India), Rehas Sachdeva (Student, International Institute of Information Technology, Hyderabad) |
| Conference | Open Source Summit North America |
| Conf Tag | |
| Location | Los Angeles, CA, United States |
| Date | Sep 10-14, 2017 |
| URL | Talk Page |
| Slides | Talk Slides |
| Video | |
Linux radix tree is a mechanism by which a (pointer) value can be associated with a (long) integer key efficiently in terms of storage, and lookups. Additional features driven by kernel-specific needs include the ability to associate tags with specific entries. IDR API is very similar to radix tree and now recently re-implemented on top of radix tree core. IDR is integer ID management, charged with the allocation of integer ID numbers used with device names, POSIX timers, and more. Sandhya Bankar’s project deals with converting custom file descriptors allocation code to use the IDR resulting in memory saving for processes with relatively few open files and improving performance of workloads with very large number of open files. Rehas Sachdeva’s project deals with enhancing their test suite, adding functional tests and performance benchmarks, automating code coverage tools and more.
