Ching-Chih Han, Hung-Ying Tyan. A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithm. In Proceedings of the 18th IEEE Real-Time Systems Symposium (RTSS 97), December 3-5, 1997, San Francisco, CA, USA. pages 36-45, IEEE Computer Society, 1997. [doi]
@inproceedings{HanT97,
title = {A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithm},
author = {Ching-Chih Han and Hung-Ying Tyan},
year = {1997},
url = {http://computer.org/proceedings/rtss/8268/82680036abs.htm},
tags = {testing},
researchr = {https://researchr.org/publication/HanT97},
cites = {0},
citedby = {0},
pages = {36-45},
booktitle = {Proceedings of the 18th IEEE Real-Time Systems Symposium (RTSS 97), December 3-5, 1997, San Francisco, CA, USA},
publisher = {IEEE Computer Society},
}