FAIR ASSIGNMENT OF PROCESSING RESOURCES TO QUEUED REQUESTS

FAIR ASSIGNMENT OF PROCESSING RESOURCES TO QUEUED REQUESTS

A request dispatching system is provided for dispatching requests to a system having a predetermined number of server instances. Each request has its priority. The request dispatching system uses one queue for each priority, and reserves for each queue a minimum number of potential server instances....

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: SEEDS, GLEN
Format: Patent
Sprache:eng ; fre
Schlagworte:
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A request dispatching system is provided for dispatching requests to a system having a predetermined number of server instances. Each request has its priority. The request dispatching system uses one queue for each priority, and reserves for each queue a minimum number of potential server instances. The minimum number is set to one or more. By reserving the minimum number of potential server instances for each queue, starvation of queue is avoided.