Dynamic Data Structure Switching

Posted by Scott_Ruecker on Sep 9, 2007 10:51 PM EDT
KernelTrap; By Jeremy Andrews
Mail this story
Print this story

Nick Piggin posted an efficient algorithm for converting a data structure, "this is my 'data structure switch' algorithm that can convert one data structure into another, with just a single unlikely branch in fastpaths and no locking or atomic operations (the branch is only triggered when the data structure is in the process of being converted). A pointer indirection is generally also needed when converting a global data structure."

Full Story

  Nav
» Read more about: Story Type: News Story; Groups: Kernel, Linux, PHP

« Return to the newswire homepage

This topic does not have any threads posted yet!

You cannot post until you login.