{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T11:58:47Z","timestamp":1721995127875},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,10,1]],"date-time":"1993-10-01T00:00:00Z","timestamp":749433600000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1993,10]]},"DOI":"10.1016\/0020-0190(93)90266-c","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:30Z","timestamp":1027640250000},"page":"39-45","source":"Crossref","is-referenced-by-count":15,"title":["Rate monotonic scheduling in hard real-time systems"],"prefix":"10.1016","volume":"48","author":[{"given":"J.","family":"Santos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Orozco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0020-0190(93)90266-C_BIB1","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1049\/sej.1991.0015","article-title":"Scheduling hard real-time systems: A review","volume":"6","author":"Burns","year":"1990","journal-title":"Software Engineering J."},{"key":"10.1016\/0020-0190(93)90266-C_BIB2","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1987","journal-title":"Science"},{"key":"10.1016\/0020-0190(93)90266-C_BIB3","series-title":"Real Time Systems Design and Analysis","author":"Laplante","year":"1992"},{"issue":"1","key":"10.1016\/0020-0190(93)90266-C_BIB4","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/317531.317538","article-title":"Performance of real time bus scheduling algorithms","volume":"14","author":"Lehoczky","year":"1986","journal-title":"ACM Performance Evaluation Rev."},{"key":"10.1016\/0020-0190(93)90266-C_BIB5","series-title":"Proc. Real-Time Systems Symp.","article-title":"The rate monotonic scheduling algorithm: Exact characterization and average case behavior","author":"Lehoczky","year":"1989"},{"issue":"4","key":"10.1016\/0020-0190(93)90266-C_BIB6","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0166-5316(82)90024-4","article-title":"On the complexity of fixed-priority scheduling of periodic real-time tasks","volume":"2","author":"Leung","year":"1982","journal-title":"Performance Evaluation"},{"issue":"1","key":"10.1016\/0020-0190(93)90266-C_BIB7","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/321738.321743","article-title":"Scheduling algorithms for multiprogramming in hard real time environment","volume":"20","author":"Liu","year":"1973","journal-title":"J. ACM"},{"issue":"9","key":"10.1016\/0020-0190(93)90266-C_BIB8","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/0140-3664(91)90108-D","article-title":"Priorities and protocols in hard real-time LANs","volume":"14","author":"Santos","year":"1991","journal-title":"Comput. Comm."},{"issue":"3","key":"10.1016\/0020-0190(93)90266-C_BIB9_1","first-page":"30","article-title":"Real-time computing with IEEE future bus+","volume":"11","author":"Sha","year":"1991","journal-title":"IEEE Micro"},{"issue":"3","key":"10.1016\/0020-0190(93)90266-C_BIB9_2","first-page":"95","article-title":"Real-time computing with IEEE future bus+","volume":"11","author":"Sha","year":"1991","journal-title":"IEEE Micro"},{"issue":"1","key":"10.1016\/0020-0190(93)90266-C_BIB10","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF02341920","article-title":"Aperiodic hard scheduling for hard real-time systems","volume":"1","author":"Sprunt","year":"1989","journal-title":"Real-Time Systems"},{"issue":"10","key":"10.1016\/0020-0190(93)90266-C_BIB11","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/2.7053","article-title":"A serious problem for next generation systems","volume":"21","author":"Stankovic","year":"1988","journal-title":"IEEE Comput."},{"issue":"2","key":"10.1016\/0020-0190(93)90266-C_BIB12","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF00365407","article-title":"Allocating hard real-time tasks: An NP-hard problem made easy","volume":"4","author":"Tindell","year":"1992","journal-title":"Real Time Systems"},{"issue":"3","key":"10.1016\/0020-0190(93)90266-C_BIB13_1","first-page":"34","article-title":"Rate monotonic scheduling","volume":"11","author":"Warren","year":"1991","journal-title":"IEEE Micro"},{"issue":"3","key":"10.1016\/0020-0190(93)90266-C_BIB13_2","first-page":"102","article-title":"Rate monotonic scheduling","volume":"11","author":"Warren","year":"1991","journal-title":"IEEE Micro"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390266C?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390266C?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:28:24Z","timestamp":1555129704000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390266C"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,10]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,10]]}},"alternative-id":["002001909390266C"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90266-c","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,10]]}}}