The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
속도 단조 트래픽 스케줄링 알고리즘은 최적의 정적 우선순위 할당 방식인 것으로 나타났습니다. 연구된 시스템 모델은 (현실적이지는 않지만) 주기적으로 패킷을 생성하는 일정한 비트 전송률 연결을 허용하는 선점형 멀티플렉서로 간주될 수 있습니다. 멀티플렉서는 우선순위가 낮은 패킷이 어떤 단계에서든 손실 없이 우선순위가 높은 패킷에 의해 선점될 수 있도록 하는 서비스 원칙을 채택합니다. 제약 조건은 모든 패킷이 동일한 연결에 의해 생성된 후속 패킷이 도착하기 전에 서비스를 완료해야 한다는 것입니다. 본 논문에서는 ATM 네트워크와 같은 고정 길이 패킷 교환 네트워크에 대한 속도 단조 스케줄러의 스케줄 가능성 문제를 연구합니다. 집합의 필요충분조건 m 단조로운 속도로 스케줄링할 수 있는 일정한 비트 속도 연결이 먼저 파생된 다음 빠른 허용 제어 알고리즘을 설계하는 데 활용됩니다. 우리 알고리즘 중 하나는 기존 연결 집합을 고려하여 허용할 수 있는 연결의 최소 기간을 미리 계산합니다.
실시간 애플리케이션, 지연 지터, 일정, 입학 통제
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Tsern-Huei LEE, An-Bang CHANG, "Fast Admission Control for Rate Monotonic Schedulers" in IEICE TRANSACTIONS on Communications,
vol. E82-B, no. 1, pp. 39-47, January 1999, doi: .
Abstract: Rate monotonic traffic scheduling algorithm had been shown to be the optimal static priority assignment scheme. The system model studied in can be considered (although not realistic) as a preemptive multiplexer which accepts constant bit rate connections that generate packets periodically. The multiplexer adopts a service discipline such that a lower priority packet can be preempted at any stage by a higher priority one without any loss. The constraint is that every packet has to complete its service before the arrival of its succeeding packet generated by the same connection. In this paper, we study the schedulability problem of rate monotonic schedulers for a fixed-length packet switched network such as the ATM network. A necessary and sufficient condition for a set of m constant bit rate connections to be rate monotonic schedulable is first derived and then utilized to design fast admission control algorithms. One of our algorithms computes in advance the minimum period of a connection which can be accepted given a set of existing connections.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e82-b_1_39/_p
부
@ARTICLE{e82-b_1_39,
author={Tsern-Huei LEE, An-Bang CHANG, },
journal={IEICE TRANSACTIONS on Communications},
title={Fast Admission Control for Rate Monotonic Schedulers},
year={1999},
volume={E82-B},
number={1},
pages={39-47},
abstract={Rate monotonic traffic scheduling algorithm had been shown to be the optimal static priority assignment scheme. The system model studied in can be considered (although not realistic) as a preemptive multiplexer which accepts constant bit rate connections that generate packets periodically. The multiplexer adopts a service discipline such that a lower priority packet can be preempted at any stage by a higher priority one without any loss. The constraint is that every packet has to complete its service before the arrival of its succeeding packet generated by the same connection. In this paper, we study the schedulability problem of rate monotonic schedulers for a fixed-length packet switched network such as the ATM network. A necessary and sufficient condition for a set of m constant bit rate connections to be rate monotonic schedulable is first derived and then utilized to design fast admission control algorithms. One of our algorithms computes in advance the minimum period of a connection which can be accepted given a set of existing connections.},
keywords={},
doi={},
ISSN={},
month={January},}
부
TY - JOUR
TI - Fast Admission Control for Rate Monotonic Schedulers
T2 - IEICE TRANSACTIONS on Communications
SP - 39
EP - 47
AU - Tsern-Huei LEE
AU - An-Bang CHANG
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E82-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 1999
AB - Rate monotonic traffic scheduling algorithm had been shown to be the optimal static priority assignment scheme. The system model studied in can be considered (although not realistic) as a preemptive multiplexer which accepts constant bit rate connections that generate packets periodically. The multiplexer adopts a service discipline such that a lower priority packet can be preempted at any stage by a higher priority one without any loss. The constraint is that every packet has to complete its service before the arrival of its succeeding packet generated by the same connection. In this paper, we study the schedulability problem of rate monotonic schedulers for a fixed-length packet switched network such as the ATM network. A necessary and sufficient condition for a set of m constant bit rate connections to be rate monotonic schedulable is first derived and then utilized to design fast admission control algorithms. One of our algorithms computes in advance the minimum period of a connection which can be accepted given a set of existing connections.
ER -