| 摘要 |
Convoys resulting from competing requests for popular service are detected and dispersed by scheduling procedure. When a request first enters the procedure, a determination is made as to whether the procedure is currently in the convoy disperse (32) mode. If not, availability of the service is checked (RX31), and if it is available, the request is serviced. If the service in not available, a delay is instituted, and availability of the service is checked again (RX31). If it is still not available, a wait-for-service count is checked to determine if it exceeds a predetermined value. If not, the present request is sent to a queued wait. If so, the convoy disperse (32) flag was already true when the request was received into the procedure, a different path is taken in which a loop is entered which involves temporarily relinquishing the processor. This loop can be passed through a predetermined number of times with the service availability checked each pass. If the service becomes available, the convoy disperse flag (RX31) is set false, and the request is serviced. If the service does not become available after the predetermined number of passes through the loop, the request is sent to the queued wait.
|
