Meetings and Events [RSS]
Lookup Data Structures in the FreeBSD Kernel will be a tour of Red/Black Trees and Radix trees as they appear in the source code. An overview of what problem the structure solves as well as an in depth look at the call strucuture of each will be covered. The structures will also be compared to assess their strengths/weaknesses for example red black trees are organized to rebalence on write and be stateless on read, whereas radix trees have a more predicable insertion method.
Firecrow has been a self taught software engineer since 2008, in 2010 he contributed to a patch for the NetBSD alc driver and in 2016 was a contributor to a patent for interactive video, awarded to the mobile advertising company Yieldmo, his familiarity with data structures comes from his recent development of a standalone red black tree implementation and a version control system based on simple file data storage. He is currently working for Haven Life as a full stack engineer.