Dynamic queue prioritization by modifying priority value based on queue's level and serving less than a maximum number of requests per queue
作者： Richard Lewis Mattson , Jaishankar Moothedath Menon
DOI:
关键词:
摘要: In a data processing system having plurality of queues for prioritizing I/O requests to storage device, the priority servicing is dynamically adjustable as opposed each queue fixed priority. Dynamically adjusting allows with "stuck" be raised so can serviced very quickly.
lens.org 参考文章(8)
Wing N. Toy, Mikiel L. Larson, Traffic load control arrangement and method for a packet switching system ,(1984)
Michel M. Colmant, Robert W. Krug, Alexander A. Smith, Architecture for high performance management of multiple circular FIFO storage means ,(1995)
Leonidas Georgiadis, Christos N. Nikolaou, Donald F. Ferguson, Workload manager for achieving transaction class response time goals in a multiprocessing system ,(1992)
William T. Fuller, Processor controlled modifying of tabled input/output priority ,(1986)
Fujita Masao, TRANSACTION EXECUTION SCHEDULE SYSTEM ,(1988)
Hiroyuki Okura, Jiro Imamura, Norio Yamamoto, Masaya Watanabe, Storage control apparatus ,(1989)
Ota Hiroshi, Maya Yuzuru, Kawaguchi Susumu, DATA PROCESSING SYSTEM ,(1988)