Get your priorities straight
Johan Karlsson · 2001
Abstract This thesis deals with three different aspects of queues and buffers. First, how anovel memory architecture can improve a solution to the problem of supporting a priority queue with priorities from a bounded universe. Second, how we canimplement a time queue for two different processes which share parts of the data structure under mutual exclusion. Finally, how careful buffer managementcan be used to support a new forwarding strategy in network routers. The new forwarding strategy aims at better supporting of prioritized data flows withvariable bit-rate. iii iv Abstract Acknowledgment First I would like to thank my supervisor Dr. Andrej Brodnik for all his en-couragement, guidence, and friendship and for the many discussions over the last years. I would also like to thank Prof. Svante Carlsson and Dr. JingsenChen who first introduced the field of theoretical computer science to me and accepted me as a Ph.D. student.Jesper, thank you for always being there when I need you. My family has always encouraged me to study, thanks. Finally, I would like to thank my fianceeChristina for all her love, support, and patience. v