{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:30:36Z","timestamp":1725489036910},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735465"},{"type":"electronic","value":"9783540735472"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73547-2_54","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T10:54:52Z","timestamp":1186829692000},"page":"529-538","source":"Crossref","is-referenced-by-count":3,"title":["Schedulability Analysis of the Fault-Tolerant Hard Real-Time Tasks with Limited Priority Levels"],"prefix":"10.1007","author":[{"given":"Jun","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fumin","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"Tu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wanhua","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yansheng","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"54_CR1","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/317531.317538","volume":"14","author":"J. Lehoczky","year":"1986","unstructured":"Lehoczky, J., Sha, L.: Performance of real-time bus scheduling algorithms. ACM Performance Evaluation Review\u00a014(1), 44\u201353 (1986)","journal-title":"ACM Performance Evaluation Review"},{"key":"54_CR2","doi-asserted-by":"crossref","unstructured":"Lehoczky, J., Sha, L., Ding, Y.: The rate monotonic scheduling algorithm: Exact characterization and average case behavior. In: Proceeding of the IEEE Real-Time Systems Symposium, pp. 166\u2013171 (1989)","DOI":"10.1109\/REAL.1989.63567"},{"issue":"9","key":"54_CR3","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1109\/12.464392","volume":"44","author":"D. Katcher","year":"1995","unstructured":"Katcher, D., Sathaye, S., Strosnider, J.: Fixed priority scheduling with limited priority levels. IEEE Transaction on Computers\u00a044(9), 1140\u20131144 (1995)","journal-title":"IEEE Transaction on Computers"},{"key":"54_CR4","unstructured":"Orozco, J., Cayssials, R., Santos, J., Santos, R.: On the minimum number of priority levels required for the rate monotonic scheduling of real-time systems. In: Proceeding of the 10th EUROMICRO Workshop on Real Time Systems, Berlin, Germany (1998)"},{"key":"54_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/978-3-540-39425-9_25","volume-title":"Advanced Parallel Processing Technologies","author":"X.L. Bin","year":"2003","unstructured":"Bin, X.L., Yang, Y.H., Jin, S.Y.: Optimal fixed priority assignment with limited priority levels. In: Zhou, X., Xu, M., J\u00e4hnichen, S., Cao, J. (eds.) APPT 2003. LNCS, vol.\u00a02834, pp. 194\u2013203. Springer, Heidelberg (2003)"},{"issue":"6","key":"54_CR6","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.1360\/crad20060618","volume":"43","author":"B.J. Wang","year":"2006","unstructured":"Wang, B.J., Li, M.S.: A priority mapping algorithm without affecting the schedulability of tasks set. Journal of Computer Research and Development\u00a043(6), 1083\u20131089 (2006)","journal-title":"Journal of Computer Research and Development"},{"issue":"3","key":"54_CR7","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1360\/jos170602","volume":"17","author":"B.J. Wang","year":"2006","unstructured":"Wang, B.J., Li, M.S., Wang, Z.G.: Uniprocessor static priority scheduling with limited priority levels. Journal of Software\u00a017(3), 602\u2013610 (2006)","journal-title":"Journal of Software"},{"key":"54_CR8","unstructured":"Audsley, N.C.: Deadline monotonic scheduling, Ph.D. dissertation, Dept. Computer Science, University of York (1990)"}],"container-title":["Lecture Notes in Computer Science","Autonomic and Trusted Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73547-2_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:16:07Z","timestamp":1605744967000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73547-2_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735465","9783540735472"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73547-2_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}