Fast access priority queue for managing multiple messages at a c

Details Fast access priority queue for managing multiple messages at a c Fast access priority queue for managing multiple messages at a c

1988-03-11

1990-10-23

Eng, David

Boots, shoes, and leggings

3642426, 364244, 3642443, 3642428, 364242, G06F 706, G06F 704

Patent

active

049657160

ABSTRACT:
In processing a priority queue, the elements are kept in an unsorted stack and are searched for the next highest priority element only after the highest priority element has been read from the holding register. Each time a new element is written into the queue, a comparison is made of the priority of the new element with the priority of the existing element in the holding register. If the new element has a higher priority, then the existing element in the holding register is written onto the top of the stack. Alternately, if the element in the holding register has the higher priority, then the new element is written onto the top of the stack. This assures that the holding register always contains the element having the highest priority. Therefore, a read of the priority queue by reading the contents of the holding register guarantees that the highest priority element is there and it can be accessed immediately without further searching the queue.

REFERENCES:
patent: 3647348 (1972-03-01), Smith
patent: 3676860 (1972-07-01), Collier
patent: 4054945 (1977-10-01), Ichiko et al.
patent: 4232294 (1980-11-01), Burke
patent: 4271468 (1981-06-01), Christensen
patent: 4352157 (1982-09-01), Namimoto et al.
patent: 4358829 (1982-11-01), Branigin et al.
patent: 4482956 (1984-11-01), Tallman
patent: 4488218 (1984-12-01), Grimes
patent: 4488227 (1984-12-01), Miu et al.
patent: 4530054 (1985-07-01), Hamstra
patent: 4530055 (1985-07-01), Hamstra
patent: 4642758 (1987-02-01), Teng
patent: 4680757 (1987-07-01), Murakami
patent: 4713758 (1987-12-01), Dekelaita et al.
patent: 4733367 (1988-03-01), Taniguchi
patent: 4757440 (1988-07-01), Scheuneman
patent: 4773041 (1988-09-01), Hassler
patent: 4794526 (1988-12-01), May
patent: 4843541 (1989-06-01), Bean
H. A. Carlson et al., "Dynamic Priority Method for Buffer Stack," IBM TDB, Apr. 1966, pp. 826-828.
M. J. Alleger et al., "Dynamic Bubbling Task Dispatching Algorithm," IBM TDB, Jun. 1970, pp. 196-197.
J. G. Earle, "Dynamic Memory for Program Staging," IBM TDB, Apr. 1971, pp. 3435-3437.
G. M. Abshire, "Dynamic Quickcell," IBM TDB, Jul. 1974, pp. 361-364.
H. J. Melville, "Dynamic Prioritization of Queued Interrupts," IBM TDB, Apr. 1986, pp. 4873-4875.

Affiliated with

Also associated with

Rating

Fast access priority queue for managing multiple messages at a c does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Fast access priority queue for managing multiple messages at a c, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast access priority queue for managing multiple messages at a c will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-771243