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...

Full description

Bibliographic Details
Main Author: Karlsson, Johan
Format: Others
Language:English
Published: Luleå tekniska universitet, EISLAB 2001
Online Access:http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-17861
id ndltd-UPSALLA1-oai-DiVA.org-ltu-17861
record_format oai_dc
spelling ndltd-UPSALLA1-oai-DiVA.org-ltu-178612017-12-19T05:30:27ZGet your priorities straightengKarlsson, JohanLuleå tekniska universitet, EISLABLuleå2001This 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>Licentiate thesis, comprehensive summaryinfo:eu-repo/semantics/masterThesistexthttp://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-17861Local 58ef8f00-d246-11db-b6e3-000ea68e967bLicentiate thesis / Luleå University of Technology, 1402-1757 ; 2001:34application/pdfinfo:eu-repo/semantics/openAccess
collection NDLTD
language English
format Others
sources NDLTD
description 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>
author Karlsson, Johan
spellingShingle Karlsson, Johan
Get your priorities straight
author_facet Karlsson, Johan
author_sort Karlsson, Johan
title Get your priorities straight
title_short Get your priorities straight
title_full Get your priorities straight
title_fullStr Get your priorities straight
title_full_unstemmed Get your priorities straight
title_sort get your priorities straight
publisher Luleå tekniska universitet, EISLAB
publishDate 2001
url http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-17861
work_keys_str_mv AT karlssonjohan getyourprioritiesstraight
_version_ 1718564230421020672