{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T04:57:27Z","timestamp":1649134647361},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,9,1]],"date-time":"2004-09-01T00:00:00Z","timestamp":1093996800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Systems and Software"],"published-print":{"date-parts":[[2004,9]]},"DOI":"10.1016\/s0164-1212(03)00236-x","type":"journal-article","created":{"date-parts":[[2003,12,9]],"date-time":"2003-12-09T11:55:53Z","timestamp":1070970953000},"page":"89-100","source":"Crossref","is-referenced-by-count":1,"title":["Feasibility analysis of hard real-time periodic tasks"],"prefix":"10.1016","volume":"73","author":[{"given":"Moonju","family":"Park","sequence":"first","affiliation":[]},{"given":"Yookun","family":"Cho","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0164-1212(03)00236-X_BIB1","doi-asserted-by":"crossref","unstructured":"Audsley, N.C., Burns, A., Richardson, M., Wellings, A., 1991. Hard real-time scheduling: the deadline monotonic approach. In: Proceedings of IEEE Workshop on Real-Time Operating Systems and Software, pp. 133\u2013137","DOI":"10.1016\/S1474-6670(17)51283-5"},{"issue":"5","key":"10.1016\/S0164-1212(03)00236-X_BIB2","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1049\/sej.1993.0034","article-title":"Applying new scheduling theory to static priority pre-emptive scheduling","volume":"8","author":"Audsley","year":"1993","journal-title":"Software Engineering Journal"},{"issue":"4","key":"10.1016\/S0164-1212(03)00236-X_BIB3","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01995675","article-title":"Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor","volume":"2","author":"Baruah","year":"1990","journal-title":"Real-Time Systems"},{"key":"10.1016\/S0164-1212(03)00236-X_BIB4","doi-asserted-by":"crossref","unstructured":"Baruah, S., Mok, A., Roiser, L., 1990b. Preemptively scheduling hard-real-time sporadic tasks on one processor. In: Proceedings of IEEE Real-Time Systems Symposium, pp. 182\u2013190","DOI":"10.1109\/REAL.1990.128746"},{"issue":"10","key":"10.1016\/S0164-1212(03)00236-X_BIB5","doi-asserted-by":"crossref","first-page":"1261","DOI":"10.1109\/TSE.1989.559777","article-title":"Some results of the earliest deadline scheduling algorithm","volume":"15","author":"Chetto","year":"1989","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/S0164-1212(03)00236-X_BIB6","unstructured":"Dertouzos, M.L., 1974. Control robotics: the procedural control of physical processes. In: Proceedings of IFIP Congress 74, 807\u2013813"},{"issue":"7","key":"10.1016\/S0164-1212(03)00236-X_BIB7","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1109\/12.508320","article-title":"Distance-constrained scheduling and its applications to real-time systems","volume":"45","author":"Han","year":"1996","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0164-1212(03)00236-X_BIB8","doi-asserted-by":"crossref","unstructured":"Lehoczky, J.P., Sha, L., Ding, Y., 1989. The rate monotonic scheduling algorithm: exact characterization and average case behaviour. In: Proceedings of IEEE Real-Time Systems Symposium, pp. 166\u2013171","DOI":"10.1109\/REAL.1989.63567"},{"key":"10.1016\/S0164-1212(03)00236-X_BIB9","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0020-0190(80)90123-4","article-title":"A note on the preemptive scheduling of periodic, real-time tasks","volume":"11","author":"Leung","year":"1980","journal-title":"Information Processing Letters"},{"issue":"1","key":"10.1016\/S0164-1212(03)00236-X_BIB10","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/321738.321743","article-title":"Scheduling algorithms for multiprogramming in a hard real-time environment","volume":"20","author":"Liu","year":"1973","journal-title":"Journal of ACM"},{"key":"10.1016\/S0164-1212(03)00236-X_BIB11","doi-asserted-by":"crossref","unstructured":"Mauthe, A., Coulson, G., 1996. Scheduling and admission testing for jitter constrained periodic threads: discussion and proof. Technical Report, Computing Department, Lancaster University","DOI":"10.1007\/s005300050065"},{"key":"10.1016\/S0164-1212(03)00236-X_BIB12","unstructured":"Park, M., Cho, Y., 2000a. An on- line optimal algorithm for scheduling soft a periodic tasks in hard real-time systems. In: Proceedings of 2000 International Conference on Parallel and Distributed Processing Techniques and Applications, June 2000, pp. 1493\u20131499"},{"key":"10.1016\/S0164-1212(03)00236-X_BIB13","doi-asserted-by":"crossref","unstructured":"Park, M., Cho, Y., 2000b. An efficient feasibility test method for hard real-time periodic tasks. In: Proceedings of IEEE Real-Time Systems Symposium, November 2000, pp. 89\u201396","DOI":"10.1109\/REAL.2000.895999"},{"issue":"1","key":"10.1016\/S0164-1212(03)00236-X_BIB14","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF00365519","article-title":"Improvement in feasibility testing for real-time tasks","volume":"11","author":"Ripoll","year":"1996","journal-title":"Real-Time Systems"},{"key":"10.1016\/S0164-1212(03)00236-X_BIB15","doi-asserted-by":"crossref","unstructured":"Sj\u00f6din, M., Hansson, H., 1998. Improved response-time analysis calculations. In: Proceedings of IEEE Real-Time Systems Symposium, pp. 399\u2013408","DOI":"10.1109\/REAL.1998.739773"},{"key":"10.1016\/S0164-1212(03)00236-X_BIB16","unstructured":"Spuri, M., 1996. Analysis of deadline scheduled real-time systems. Technical Report, INRIA"},{"key":"10.1016\/S0164-1212(03)00236-X_BIB17","series-title":"Deadline Scheduling for Real-time Systems: EDF and Related Algorithms","author":"Stankovic","year":"1998"},{"issue":"2","key":"10.1016\/S0164-1212(03)00236-X_BIB18","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01088593","article-title":"An extendible approach for analyzing fixed priority hard real-time tasks","volume":"6","author":"Tindell","year":"1994","journal-title":"Real-Time Systems"},{"key":"10.1016\/S0164-1212(03)00236-X_BIB19","doi-asserted-by":"crossref","first-page":"1096","DOI":"10.1109\/TCOMM.1994.580218","article-title":"On the ability of establishing real-time channels in point-to-point packet-switched networks","volume":"42","author":"Zheng","year":"1994","journal-title":"IEEE Transactions on Communications"}],"container-title":["Journal of Systems and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016412120300236X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016412120300236X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,27]],"date-time":"2020-03-27T21:56:03Z","timestamp":1585346163000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016412120300236X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,9]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,9]]}},"alternative-id":["S016412120300236X"],"URL":"https:\/\/doi.org\/10.1016\/s0164-1212(03)00236-x","relation":{},"ISSN":["0164-1212"],"issn-type":[{"value":"0164-1212","type":"print"}],"subject":[],"published":{"date-parts":[[2004,9]]}}}