Hello!
My name is Jordan and I'm a Computer Scientist, Programmer and GNU/Linux enthusiast.
I was previously a M.Sc. Student at the University of Toronto where I was supervised by Faith Ellen. For my master's project, I implemented Jeremy Ko's lock-free binary trie algorithm in C++ and performed experiments to compare it against other lock-free data structures that support the same operations as the trie. My master's report examines this implementation in detail and discusses the results of my experiments. One component of the implementation is a variant of Fomitchev and Ruppert's lock-free linked list that allows multiple processes (threads) to insert the same node into the list while prohibiting the reinsertion of nodes. The implementation reclaims memory using a variant of DEBRA and in the report it is proved that the implementation does not access reclaimed memory.
Before this I did my B.Sc at York University, where I gained a deep interest in the theory of computer science from Eric Ruppert and George Tourlakis.