Browse Prior Art Database

Bit Mask Queue

IP.com Disclosure Number: IPCOM000083693D
Original Publication Date: 1975-Jul-01
Included in the Prior Art Database: 2005-Mar-01
Document File: 2 page(s) / 29K

Publishing Venue

IBM

Related People

Boggs, JK: AUTHOR [+3]

Abstract

The illustrated storage queueing and dequeueing scheme provides fast yet orderly access to information in asynchronous data handling operations. The associated processor controls utilize simple but effective OR and exclusive OR instructions to enqueue and dequeue information.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 55% of the total text.

Page 1 of 2

Bit Mask Queue

The illustrated storage queueing and dequeueing scheme provides fast yet orderly access to information in asynchronous data handling operations. The associated processor controls utilize simple but effective OR and exclusive OR instructions to enqueue and dequeue information.

A queue header storage space defines the states (enqueued/dequeued) of n queue element storage spaces and contains information for locating them. The header includes an ordered n-bit "to process'' mask and an "index set" address. The index set address locates the origin address of a set of n queue index entries. These are arranged sequentially in an order corresponding to the order of bits in the "to process" mask. The index entries are used to locate respective queue element storage spaces.

Each queue element storage space is arranged for storage of: a) address information representing the location of the header common to the n element storage spaces; b) an ordered n-bit connection mask consisting of all "0's" and one "1" bit, the latter located in a bit position ordered to correspond to the position in the index set of the index entry for locating the respective element space (i.e., ordered to correspond to a respective "to process" mask bit); and c) enqueued intelligence (or the location thereof elsewhere).

To restore (enqueue) an idle (dequeued) one of the n foregoing queue element spaces the data processing controls are programmed to execute an OR instruction (or microins...