Browse Prior Art Database

Priority Queue Controller Using Linked List Techniques

IP.com Disclosure Number: IPCOM000057949D
Original Publication Date: 1988-Aug-01
Included in the Prior Art Database: 2005-Feb-15

Publishing Venue

IBM

Related People

Authors:
Lenyo, JE Rudolph, SF [+details]

Abstract

A hardware priority scheme is shown which minimizes memory requirements, simplifies control logic and increases the speed of a priority queue. (Image Omitted) Queues are used throughout data processing architecture to prioritize incoming work for the resources available. Typically, queues are implemented in software, are relatively slow and consume a large amount of memory space. When queues are implemented in hardware, first- in, first-out (FIFO) queues are typically used because priority queues require too much hardware and memory space. A queueing system is disclosed with 64 priorities and 512 queue elements. The forward-linked structure uses FIFO lists for each priority to organize elements in a queue.