This project is inspired by the paper published by Edward Talmage and Dr. Jennifer Welch in 2014.
The idea of this project is to find a way to linearize run times in message passing systems by utilizing relaxed data structures. Previous work has been done to show the usefulness of relaxed queues by presenting pseudo code and analyzing run times. However, this work has not be completed, as some run time bounds could be tighter and some queue implementations still don't have pseudo code. The goal of this project is to work to tighten the run time bounds and create pseudo code to model all kinds of relaxed queues. If this can be done, the more ambitious step will be to look at other relaxed data structures.
The idea of this project is to find a way to linearize run times in message passing systems by utilizing relaxed data structures. Previous work has been done to show the usefulness of relaxed queues by presenting pseudo code and analyzing run times. However, this work has not be completed, as some run time bounds could be tighter and some queue implementations still don't have pseudo code. The goal of this project is to work to tighten the run time bounds and create pseudo code to model all kinds of relaxed queues. If this can be done, the more ambitious step will be to look at other relaxed data structures.