Pre-Grant Publication Number: 20080098395
Please help the USPTO examine the application by evaluating the relevance of the publicly submitted prior art to the patent application.
Peer-to-Patent forwards the Top 10 most relevant prior art submissions and their annotations to the United States Patent and Trademark Office.
Review this prior art and click on the thumbs up (or down) to indicate whether this submission should be forwarded to the USPTO.
If you login then you can add an annotation by typing in the box at the bottom of the screen to comment on the relevance of the prior art to the claims of the patent application.
Review this prior art and click on the thumbs up (or down) to indicate whether this submission should be forwarded to the USPTO.
If you login then you can add an annotation by typing in the box at the bottom of the screen to comment on the relevance of the prior art to the claims of the patent application.
Prior Art Detail
Summary / Description
| Summary / Description | An operating system method of round robin scheduling involving a quantum of time and sequentially processing tasks. |
Basic Information
| Type of Prior Art | Issued Patents - US |
| Country | United States of America |
| Patent/Application # | 6021425 |
| Kind Code | United States (US) - United STATES Patent - A |
| Patentee Name | International Business Machines Corporation |
| Relevant Pages, Columns, or Lines | column 5, row 9-12; column 5, |
| URL | |
| Filing Date | April 3, 1992 |
| Additional Information | |
Notes / To Do
| Notes | |
Excerpt
Excerpt Round-robin scheduling is specifically designed for time sharing systems. Processor time and other resource allocations are sequentially dedicated to each task admitted to a ready to run queue. Each task at a given priority level initially has equal claim to processor time.
If a plurality of threads, each thread at one priority level, receives a quanta of time and if processing is not completed within that set period the thread is removed from the central processing unit and returned to the bottom of the ready to run queue for that priority level. |
Relevance
Claims
1
The method of expediting jobs in a computer processing system, said method comprising:
processing each incoming job in sequence of arrival until said job is completed; and
allowing each subsequent incoming job to be processed, ahead in terms of associated resources of the continued processing of any job not processed to completion within a time period N.
Relevance
This claim seems a restating of the round robin scheduling explained in the excerpt from 6021425 patent.
This claim seems a restating of the round robin scheduling explained in the excerpt from 6021425 patent.
Claim Chart
All
0 days left
