Get your priorities straight
This thesis deals with three different aspects of queues and buffers. First, how a novel memory architecture can improve a solution to the problem of supporting a priority queue with priorities from a bounded universe. Second, how we can implement a time queue for two different processes which share...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Luleå tekniska universitet, EISLAB
2001
|
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-17861 |
| Summary: | This thesis deals with three different aspects of queues and buffers. First, how a novel memory architecture can improve a solution to the problem of supporting a priority queue with priorities from a bounded universe. Second, how we can implement a time queue for two different processes which share parts of the data structure under mutual exclusion. Finally, how careful buffer management can be used to support a new forwarding strategy in network routers. The new forwarding strategy aims at better supporting of prioritized data flows with variable bit-rate. === <p>Godkänd; 2001; 20070314 (ysko)</p> |
|---|