{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:32:53Z","timestamp":1725478373383},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540363217"},{"type":"electronic","value":"9783540363224"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11795490_23","type":"book-chapter","created":{"date-parts":[[2007,1,23]],"date-time":"2007-01-23T12:25:18Z","timestamp":1169555118000},"page":"291-305","source":"Crossref","is-referenced-by-count":1,"title":["The Partitioned, Static-Priority Scheduling of Sporadic Real-Time Tasks with Constrained Deadlines on Multiprocessor Platforms"],"prefix":"10.1007","author":[{"given":"Nathan","family":"Fisher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjoy","family":"Baruah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"23_CR1","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1049\/sej.1993.0034","volume":"8","author":"N. Audsley","year":"1993","unstructured":"Audsley, N., Burns, A., Richardson, M., Tindell, K., Wellings, A.: Applying new scheduling theory to static priority preemptive scheduling. Software Engineering Journal\u00a08(5), 285\u2013292 (1993)","journal-title":"Software Engineering Journal"},{"issue":"1","key":"23_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0967-0661(93)92105-D","volume":"1","author":"N. Audsley","year":"1993","unstructured":"Audsley, N., Burns, A., Wellings, A.: Deadline monotonic scheduling theory and application. Control Engineering Practice\u00a01(1), 71\u201378 (1993)","journal-title":"Control Engineering Practice"},{"doi-asserted-by":"crossref","unstructured":"Audsley, N.C., Burns, A., Richardson, M.F., Wellings, A.J.: Hard Real-Time Scheduling: The Deadline Monotonic Approach. In: Proceedings 8th IEEE Workshop on Real-Time Operating Systems and Software, Atlanta, pp. 127\u2013132 (May 1991)","key":"23_CR3","DOI":"10.1016\/S1474-6670(17)51283-5"},{"key":"23_CR4","first-page":"120","volume-title":"Proceedings of the IEEE Real-Time Systems Symposium","author":"T. Baker","year":"2003","unstructured":"Baker, T.: Multiprocessor EDF and deadline monotonic schedulability analysis. In: Proceedings of the IEEE Real-Time Systems Symposium, pp. 120\u2013129. IEEE Computer Society Press, Los Alamitos (2003)"},{"unstructured":"Baker, T.P.: An analysis of deadline-monotonic schedulability on a multiprocessor. Tech. Rep. TR-030201, Department of Computer Science, Florida State University (2003)","key":"23_CR5"},{"unstructured":"Baker, T.P.: An analysis of EDF schedulability on a multiprocessor. Tech. Rep. TR-030202, Department of Computer Science, Florida State University (2003)","key":"23_CR6"},{"unstructured":"Baker, T.P.: Comparison of empirical success rates of global vs. partitioned fixed-priority and EDF scheduling for hard real time. Tech. Rep. TR-050601, Department of Computer Science, Florida State University (2005)","key":"23_CR7"},{"key":"23_CR8","volume-title":"Proceedings of the 26th Real-Time Systems Symposium","author":"S. Baruah","year":"2005","unstructured":"Baruah, S., Fisher, N.: The partitioned multiprocessor scheduling of sporadic task systems. In: Proceedings of the 26th Real-Time Systems Symposium, Miami, Florida. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"23_CR9","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/REAL.1990.128746","volume-title":"Proceedings of the 11th Real-Time Systems Symposium","author":"S. Baruah","year":"1990","unstructured":"Baruah, S., Mok, A., Rosier, L.: Preemptively scheduling hard-real-time sporadic tasks on one processor. In: Proceedings of the 11th Real-Time Systems Symposium, Orlando, Florida, pp. 182\u2013190. IEEE Computer Society Press, Los Alamitos (1990)"},{"key":"23_CR10","first-page":"209","volume-title":"Proceedings of the Euro Micro Conference on Real-Time Systems","author":"M. Bertogna","year":"2005","unstructured":"Bertogna, M., Cirinei, M., Lipari, G.: Improved schedulability analysis of EDF on multiprocessor platforms. In: Proceedings of the Euro Micro Conference on Real-Time Systems, Palma de Mallorca, Balearic Islands, Spain, July 2005, pp. 209\u2013218. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"23_CR11","first-page":"169","volume-title":"Proceedings of the 23rd IEEE Real-Time Systems Symposium","author":"E. Bini","year":"2002","unstructured":"Bini, E., Buttazzo, G.: The space of rate monotonic schedulability. In: Proceedings of the 23rd IEEE Real-Time Systems Symposium, Austin, Texas, December 2002, pp. 169\u2013178. IEEE Computer Society Press, Los Alamitos (2002)"},{"issue":"12","key":"23_CR12","doi-asserted-by":"publisher","first-page":"1429","DOI":"10.1109\/12.477248","volume":"44","author":"A. Burchard","year":"1995","unstructured":"Burchard, A., Liebeherr, J., Oh, Y., Son, S.H.: Assigning real-time tasks to homogeneous multiprocessor systems. IEEE Transactions on Computers\u00a044(12), 1429\u20131442 (1995)","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"23_CR13","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/S0022-0000(74)80026-7","volume":"8","author":"D. Johnson","year":"1974","unstructured":"Johnson, D.: Fast algorithms for bin packing. Journal of Computer and Systems Science\u00a08(3), 272\u2013314 (1974)","journal-title":"Journal of Computer and Systems Science"},{"unstructured":"Johnson, D.S.: Near-optimal Bin Packing Algorithms. PhD thesis, Department of Mathematics, Massachusetts Institute of Technology (1973)","key":"23_CR14"},{"key":"23_CR15","first-page":"214","volume-title":"36th Annual Symposium on Foundations of Computer Science (FOCS 1995)","author":"B. Kalyanasundaram","year":"1995","unstructured":"Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. In: 36th Annual Symposium on Foundations of Computer Science (FOCS 1995), October 1995, pp. 214\u2013223. IEEE Computer Society Press, Los Alamitos (1995)"},{"key":"23_CR16","first-page":"166","volume-title":"Proceedings of the Real-Time Systems Symposium - 1989","author":"J. Lehoczky","year":"1989","unstructured":"Lehoczky, J., Sha, L., Ding, Y.: The rate monotonic scheduling algorithm: Exact characterization and average case behavior. In: Proceedings of the Real-Time Systems Symposium - 1989, Santa Monica, California, USA, December 1989, pp. 166\u2013171. IEEE Computer Society Press, Los Alamitos (1989)"},{"doi-asserted-by":"crossref","unstructured":"Lehoczky, J.P.: Fixed priority scheduling of periodic tasks with arbitrary deadlines. In: IEEE Real-Time Systems Symposium, pp. 201\u2013209 (December 1990)","key":"23_CR17","DOI":"10.1109\/REAL.1990.128748"},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0020-0190(80)90123-4","volume":"11","author":"J. Leung","year":"1980","unstructured":"Leung, J., Merrill, M.: A note on the preemptive scheduling of periodic, real-time tasks. Information Processing Letters\u00a011, 115\u2013118 (1980)","journal-title":"Information Processing Letters"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0166-5316(82)90024-4","volume":"2","author":"J. Leung","year":"1982","unstructured":"Leung, J., Whitehead, J.: On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation\u00a02, 237\u2013250 (1982)","journal-title":"Performance Evaluation"},{"issue":"1","key":"23_CR20","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/321738.321743","volume":"20","author":"C. Liu","year":"1973","unstructured":"Liu, C., Layland, J.: Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM\u00a020(1), 46\u201361 (1973)","journal-title":"Journal of the ACM"},{"issue":"1","key":"23_CR21","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1023\/B:TIME.0000033378.56741.14","volume":"28","author":"J.M. Lopez","year":"2004","unstructured":"Lopez, J.M., Diaz, J.L., Garcia, D.F.: Utilization bounds for EDF scheduling on real-time multiprocessor systems. Real-Time Systems: The International Journal of Time-Critical Computing\u00a028(1), 39\u201368 (2004)","journal-title":"Real-Time Systems: The International Journal of Time-Critical Computing"},{"key":"23_CR22","first-page":"25","volume-title":"Proceedings of the EuroMicro Conference on Real-Time Systems","author":"J.M. Lopez","year":"2000","unstructured":"Lopez, J.M., Garcia, M., Diaz, J.L., Garcia, D.F.: Worst-case utilization bound for EDF scheduling in real-time multiprocessor systems. In: Proceedings of the EuroMicro Conference on Real-Time Systems, Stockholm, Sweden, June 2000, pp. 25\u201334. IEEE Computer Society Press, Los Alamitos (2000)"},{"unstructured":"Mok, A.K.: Fundamental Design Problems of Distributed Systems for The Hard-Real-Time Environment. PhD thesis, Laboratory for Computer Science, Massachusetts Institute of Technology, Available as Technical Report No.\u00a0MIT\/LCS\/TR-297 (1983)","key":"23_CR23"},{"key":"23_CR24","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1023\/A:1008098013753","volume":"15","author":"D.-I. Oh","year":"1998","unstructured":"Oh, D.-I., Baker, T.P.: Utilization bounds for N-processor rate monotone scheduling with static processor assignment. Real-Time Systems: The International Journal of Time-Critical Computing\u00a015, 183\u2013192 (1998)","journal-title":"Real-Time Systems: The International Journal of Time-Critical Computing"},{"unstructured":"Oh, Y.: The Design and Analysis of Scheduling Algorithms for Real-Time and Fault-Tolerant Computer Systems. PhD thesis, Department of Computer Science, The University of Virginia (1994)","key":"23_CR25"},{"unstructured":"Phillips, C.A., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, El Paso, Texas, May 4-6, 1997, pp. 140\u2013149 (1997)","key":"23_CR26"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11795490_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T02:49:56Z","timestamp":1552358996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11795490_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540363217","9783540363224"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11795490_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}