Dynamic rank ordered scheduling mechanism

Details Dynamic rank ordered scheduling mechanism Dynamic rank ordered scheduling mechanism

1980-04-14

1982-11-09

Atkinson, Charles E.

Boots, shoes, and leggings

G06F 700

Patent

active

043588298

ABSTRACT:
A mechanism is provided which permits the insertion of elements into a list of positions determined by the rank of the elements and allows deletion of elements only from the top of the list. The arrangement provides dynamic aging of the priorities of the elements entered into the list.

REFERENCES:
patent: 3599162 (1971-08-01), Byrns et al.
patent: 3601809 (1971-08-01), Gray et al.
patent: 3638198 (1972-01-01), Balough, Jr.
patent: 3774163 (1973-11-01), Recoque
patent: 3786432 (1974-01-01), Woods
patent: 3789365 (1974-01-01), Jen et al.
patent: 3916385 (1975-10-01), Parmer et al.
patent: 4054945 (1977-10-01), Ichiko et al.
patent: 4060849 (1977-11-01), Bienvenu et al.
patent: 4177513 (1979-12-01), Hoffman et al.
Gilbert, D. C. et al., "Priority Control Method for a Resource Partitioning System", IBM Tech. Disc. Bull., vol. 18, No. 6, Nov. 1975, pp. 1942-1947.
Boggs, J. K. et al., "Double-Indexed Priority Queue", IBM Tech. Disc. Bull., vol. 18, No. 2, Jul. 1975, pp. 378-379.
Myers, L. M., "Fast Access Priority Queuing Technique", IBM Tech. Discl. Bull., vol. 16, No. 8, Jan. 1974, pp. 2479-2482.

Affiliated with

Also associated with

Rating

Dynamic rank ordered scheduling mechanism does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dynamic rank ordered scheduling mechanism, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic rank ordered scheduling mechanism will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-748796