A Study on Efficient Online Scheduling Algorithms
碩士 === 國立臺北大學 === 資訊工程學系 === 103 === We study the bounded-delay model for Qualify-of-Service buffer management. Time is discrete. There is a buffer. Unit-length jobs (also called packets) arrive at the buffer over time. Each packet has an integer release time, an integer deadline, and a positive real v...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2015
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/36744735116164154974 |