Move-to-rear list scheduling
US5999963A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Nov 7, 1997 |
| Grant date | Dec 7, 1999 |
| Priority date | — |
| Expiry date | Nov 7, 2017 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F9/4881
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A new scheduling method and policy for shared (server) resources, such as the CPU or disk memory of a multiprogrammed data processor. The scheduling is referred to as Move-To-Rear List Scheduling and it provides a cumulative service guarantee and well as more traditional guarantees such as fairness (proportional sharing) and bounded delay. In typical operation, a list is maintained for a server of processes seeking service from the server. Processes are admitted to the list only when maximum capacity constraints are not violated, and once on the list, are served in a front-to-back order. After receiving service, or upon the occurrence of other events, the position of the process on the list may be changed.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.