Queue Design Research Articles

VLSI design and implementation of systolic tree queues

A number of innovative designs have been proposed for hardware implementation of data structures. However, these designs have only been presented at an abstract behavioural level. In this paper, we describe the VLSI design and implementation of a 15-node 8-bit queue based on a systolic tree architecture. A layout methodology and a VLSI CAD environment that facilitate fast and efficient layout of large binary trees are described. The objective of this paper is to illustrate the implementation of tree architectures in VLSI. We demonstrate this by implementing a systolic tree queue.

Performance analysis of clock-regulated queues with output multiplexing in three different 2 × 2 crossbar switch architectures

Switches in interconnection networks for highly parallel shared memory computer systems may be implemented with different internal buffer structures. For a 2 × 2 synchronous switch, previous studies have often assumed a switch composed of two queues, one at each output, each of which has unbounded size and may accept two inputs every clock cycle. Hardware implementations may actually use simpler queue designs and will have bounded size. Two additional models for a 2 × 2 switch using queues that may accept only one input at a time are analyzed. The first uses four queues, one for each input/output pair. The second uses two queues, one at each input. In each case, a multiplexer blocks one queue if two queues desire the same output, making these models more difficult to analyze than the previous model. Maximum bandwidth, expected queue length, expected waiting time, and queue length distribution are presented for both models, with unbounded queue size and with queue size equal to 1.

A combined‐methodologies approach to problem solving in management science courses

In this paper it is suggested that an effective way to teach the introductory management science/operations research course is to tie together techniques in solving some fairly complex, realistic problems. A multistage process of analysis called the combined‐methodologies approach (CMA) is proposed. A queueing design problem is given as an example. Its solution requires the use of simulation, regression analysis, and goal programming. The particular techniques applied under CMA are specific to the situation under study. The authors believe the approach will increase student interest and address some criticisms of MS/OR instruction in universities.

A better queue design

A better queue design

Design and analysis of simultaneous access priority queues

A simultaneous access priority queue design which handles p accesses every O(log p) time is presented. A processor is free to perform another task after issuing an insert, whereas it has to wait O(log p) time to receive the response of a delete-min. Compared with all sequential access designs which require O(p) time to process p accesses, our design achieves a significant performance improvement. For a fixed number of priorities, we propose a design which can pipeline accesses in constant time. For both designs, the strict highest-priority-out-first property is maintained.

Design and analysis of simultaneous access priority queues☆

A simultaneous access priority queue design which handles p accesses every O (log p ) time is presented. A processor is free to perform another task after issuing an insert , whereas it has to wait O (log p ) time to receive the response of a delete-min . Compared with all sequential access designs which require O(p) time to process p accesses, our design achieves a significant performance improvement. For a fixed number of priorities, we propose a design which can pipeline accesses in constant time. For both designs, the strict highest-priority-out-first property is maintained.

Rationing by Waiting and the Value of Time: Results from a Natural Experiment

The authors analyze data from a natural experiment with rationing by waiting. In the situation, motorists were confronted with a choice between waiting in line for low-priced gasoline or purchasing at a higher price without waiting. They view this as a revealed preference experiment and use their choices to estimate the value of time spent waiting as a function of individual characteristics. In most cases the estimates of the value of time are quite similar to individuals' after-tax wages. 13 references, 7 tables.

A Classified Bibliography of Research on Optimal Design and Control of Queues

This paper presents a classified bibliography organized into six sections—static design models, dynamic control models, models involving queue discipline control, miscellaneous models, tutorial and survey papers, and books that have specific portions devoted to design and control. Some of the above categories are further subdivided when appropriate, and explanations of the types of models in each category and subcategory precede the actual list of references. Papers that fall into more than one category are cross-referenced.