@article{oai:shobi-u.repo.nii.ac.jp:00000620,
 author = {四方, 義昭 and SHIKATA, Yoshiaki and 華山, 宣胤 and HANAYAMA, Nobutane},
 journal = {尚美学園大学芸術情報研究, Journal of Informatics for Arts, Shobi University},
 month = {Oct},
 note = {論文, Article, In a prioritized, limited Round-Robin (RR) system where N priority classes are allowed in a single-server system, a higher-priority request is allocated a larger number of quanta compared to a lower-priority request. The sum of the number of quanta included in each RR cycle is restricted to a fixed value. An arriving request that cannot be allocated quanta because of this restriction is either entered in the service waiting queue (the waiting system) or rejected (the loss system). Practical performance measures such as the relationship between the mean sojourn time, mean queue waiting time, loss probability, and quantum size in the case that a portion of quanta must be subtracted from the remaining sojourn time are evaluated via simulation. In the evaluation, the sojourn time of an arriving request is evaluated using the requested service time, number of quanta included in each RR cycle, and quantum size. Then, the change in the number of quanta needed before service is complete is reevaluated at the arrival and departure of other requests. Tracking these events and calculations enables us to analyze the performance of the prioritized, limited RR rule.},
 pages = {77--85},
 title = {Performance Analysis of a Prioritized, Limited Round-Robin System : Influence that a portion of quanta may have on the performance},
 volume = {27},
 year = {2017},
 yomi = {シカタ, ヨシアキ and ハナヤマ, ノブタネ}
}