{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:30:28Z","timestamp":1743067828773,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030758356"},{"type":"electronic","value":"9783030758363"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-75836-3_19","type":"book-chapter","created":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:05:55Z","timestamp":1620126355000},"page":"275-289","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Idle Time Administration on FreeRTOS Using Slack Stealing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1472-9746","authenticated-orcid":false,"given":"Francisco E.","family":"P\u00e1ez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6215-3158","authenticated-orcid":false,"given":"Jos\u00e9 M.","family":"Urriza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9560-0735","authenticated-orcid":false,"given":"Javier D.","family":"Orozco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,5]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","unstructured":"Burns, A., Davis, R.I.: A survey of research into mixed criticality systems. ACM Comput. Surv. 50(6), 82:1\u201382:37 (2017). https:\/\/doi.org\/10.1145\/3131347","DOI":"10.1145\/3131347"},{"key":"19_CR2","doi-asserted-by":"publisher","unstructured":"Buttazzo, G.C.: Research trends in real-time computing for embedded systems. SIGBED Rev. 3(3), 1\u201310 (2006). https:\/\/doi.org\/10.1145\/1164050.1164052","DOI":"10.1145\/1164050.1164052"},{"key":"19_CR3","unstructured":"Davis, R.I.: Approximate slack stealing algorithms for fixed priority preemptive systems. University of York, Department of Computer Science (1993)"},{"key":"19_CR4","doi-asserted-by":"publisher","unstructured":"Davis, R.I., Tindell, K., Burns, A.: Scheduling slack time in fixed priority preemptive systems. In: Proceedings of the Real-Time Systems Symposium, Raleigh-Durham, NC, December 1993, pp. 222\u2013231 (1993). https:\/\/doi.org\/10.1109\/REAL.1993.393496","DOI":"10.1109\/REAL.1993.393496"},{"key":"19_CR5","doi-asserted-by":"publisher","unstructured":"Davis, R.I., Wellings, A.J.: Dual priority scheduling. In: Proceedings of the 16th IEEE Real-Time Systems Symposium, Palazzo dei Congressi, Via Matteotti, 1, Pisa, Italy, 4\u20137 December 1995, pp. 100\u2013109. IEEE Computer Society (1995). https:\/\/doi.org\/10.1109\/REAL.1995.495200","DOI":"10.1109\/REAL.1995.495200"},{"key":"19_CR6","unstructured":"D\u00edaz, L.A., P\u00e1ez, Jos\u00e9, F.E., Urriza, J.M., Orozco, J.D., Cayssials, R.: Implementaci\u00f3n de un M\u00e9todo de Slack Stealing en el Kernel de MaRTE OS. In: Proceeding XLIII Jornadas Argentinas de Inform\u00e1tica e Investigaci\u00f3n Operativa (43 JAIIO) - III Argentine Symposium on Industrial Informatics (SII), pp. 13\u201324 (2014)"},{"key":"19_CR7","doi-asserted-by":"publisher","unstructured":"Lehoczky, J.P., Ramos-Thuel, S.: An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systems. In: Proceedings of the Real-Time Systems Symposium - 1992, Phoenix, Arizona, USA, December 1992, pp. 110\u2013123. IEEE Computer Society (1992). https:\/\/doi.org\/10.1109\/REAL.1992.242671","DOI":"10.1109\/REAL.1992.242671"},{"key":"19_CR8","doi-asserted-by":"publisher","unstructured":"Leung, J.Y.-T., Whitehead, J.: On the complexity of fixed-priority scheduling of periodic, real-time tasks. Perform. Eval. 2(4), 237\u2013250 (1982). https:\/\/doi.org\/10.1016\/0166-5316(82)90024-4","DOI":"10.1016\/0166-5316(82)90024-4"},{"key":"19_CR9","doi-asserted-by":"publisher","unstructured":"Lin, C., Brandt, S.A.: Improving soft real-time performance through better slack reclaiming. In: Proceedings of the 26th IEEE Real-Time Systems Symposium, RTSS 2005, Miami, FL, USA, 6\u20138 December 2005, pp. 410\u2013421. IEEE Computer Society (2005). https:\/\/doi.org\/10.1109\/RTSS.2005.26","DOI":"10.1109\/RTSS.2005.26"},{"key":"19_CR10","doi-asserted-by":"publisher","unstructured":"Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20(1), 46\u201361 (1973). https:\/\/doi.org\/10.1145\/321738.321743","DOI":"10.1145\/321738.321743"},{"key":"19_CR11","doi-asserted-by":"publisher","unstructured":"Masson, D., Midonnet, S.: Slack time evaluation with RTSJ. In: Wainwright, R.L., Haddad, H. (eds.) Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), Fortaleza, Ceara, Brazil, 16\u201320 March 2008, pp. 322\u2013323. ACM (2008). https:\/\/doi.org\/10.1145\/1363686.1363769","DOI":"10.1145\/1363686.1363769"},{"key":"19_CR12","unstructured":"Masson, D., Midonnet, S.: Userland approximate slack stealer with low time complexity. In: RTNS 2008, pp. 29\u201338, Rennes, France, October 2008. https:\/\/hal-upec-upem.archives-ouvertes.fr\/hal-00620349"},{"key":"19_CR13","doi-asserted-by":"publisher","unstructured":"Masson, D., Midonnet, S.: Handling non-periodic events in real-time Java systems. In: Higuera-Toledano, M., Wellings, A. (eds.) Distributed, Embedded and Real-time Java Systems, pp. 45\u201377. Springer, Boston (2012). https:\/\/doi.org\/10.1007\/978-1-4419-8158-5_3","DOI":"10.1007\/978-1-4419-8158-5_3"},{"key":"19_CR14","doi-asserted-by":"publisher","unstructured":"Midonnet, S., Masson, D., Lassalle, R.: Slack-time computation for temporal robustness in embedded systems. Embed. Syst. Lett. 2(4), 119\u2013122 (2010). https:\/\/doi.org\/10.1109\/LES.2010.2074184","DOI":"10.1109\/LES.2010.2074184"},{"key":"19_CR15","unstructured":"Minguet, A.R.E.: Extensiones al Lenguaje Ada y a los Servicios POSIX para Planificaci\u00f3n en Sistemas de Tiempo Real Estricto. Ph.D. thesis, Universidad Polit\u00e9cnica de Valencia (2003)"},{"key":"19_CR16","unstructured":"Orozco, J., Santos, R., Santos, J., Cayssials, R.: Taking advantage of priority inversions generated to improve the processing of non-hard real-time tasks in mixed systems. In: The 21st IEEE Real-Time Systems Symposium WIP, pp. 13\u201316 (2000)"},{"key":"19_CR17","unstructured":"P\u00e1ez, F.E., Urriza, J.M., Orozco, J.D.: Administraci\u00f3n del Tiempo Ocioso Mediante Slack Stealing en FreeRTOS. In: XXVI Congreso Argentino de Ciencias de la Computaci\u00f3n - CACIC 2020. Libro de actas, pp. 629\u2013638 (2020)"},{"key":"19_CR18","doi-asserted-by":"publisher","unstructured":"Ramos-Thuel, S., Lehoczky, J.P.: Online scheduling of hard deadline aperiodic tasks in fixed-priority systems. In: Proceedings of the Real-Time Systems Symposium, Raleigh-Durham, NC, December 1993, pp. 160\u2013171 (1993). https:\/\/doi.org\/10.1109\/REAL.1993.393504","DOI":"10.1109\/REAL.1993.393504"},{"key":"19_CR19","doi-asserted-by":"publisher","unstructured":"Sprunt, B., Lehoczky, J.P., Sha, L.: Exploiting unused periodic time for aperiodic service using the extended priority exchange algorithm. In: Proceedings of the 9th IEEE Real-Time Systems Symposium, RTSS 1988, Huntsville, Alabama, USA, 6\u20138 December 1988, pp. 251\u2013258. IEEE Computer Society (1988). https:\/\/doi.org\/10.1109\/REAL.1988.51120","DOI":"10.1109\/REAL.1988.51120"},{"key":"19_CR20","doi-asserted-by":"publisher","unstructured":"Sprunt, B., Sha, L., Lehoczky, J.: Aperiodic task scheduling for hard-real-time systems. Real-Time Syst. 1(1), 27\u201360 (1989). https:\/\/doi.org\/10.1007\/BF02341920","DOI":"10.1007\/BF02341920"},{"key":"19_CR21","doi-asserted-by":"publisher","unstructured":"Spuri, M., Buttazzo, G.C.: Scheduling aperiodic tasks in dynamic priority systems. Real-Time Syst. 10(2), 179\u2013210 (1996). https:\/\/doi.org\/10.1007\/BF00360340","DOI":"10.1007\/BF00360340"},{"key":"19_CR22","doi-asserted-by":"publisher","unstructured":"Stankovic, J.A.: Misconceptions about real-time computing: a serious problem for next-generation systems. Computer 21(10), 10\u201319 (1988). https:\/\/doi.org\/10.1109\/2.7053","DOI":"10.1109\/2.7053"},{"key":"19_CR23","doi-asserted-by":"publisher","unstructured":"Strosnider, J., Lehoczky, J., Sha, L.: The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environments. IEEE Trans. Comput. 44(1), 73\u201391 (1995). https:\/\/doi.org\/10.1109\/12.368008","DOI":"10.1109\/12.368008"},{"key":"19_CR24","doi-asserted-by":"publisher","unstructured":"Tia, T.-S., Liu, J.W.-S., Shankar, M.: Algorithms and optimality of scheduling soft aperiodic requests in fixed-priority preemptive systems. Real-Time Syst. 10(1), 23\u201343 (1996). https:\/\/doi.org\/10.1007\/BF00357882","DOI":"10.1007\/BF00357882"},{"key":"19_CR25","doi-asserted-by":"publisher","unstructured":"Urriza, J.M., P\u00e1ez, F.E., Ferrari, M., Cayssials, R., Orozco, J.D.: A new RM\/DM low cost schedulability test. In: 2017 Eight Argentine Symposium and Conference on Embedded Systems (CASE), pp. 1\u20136 (2017). https:\/\/doi.org\/10.23919\/SASE-CASE.2017.8115368","DOI":"10.23919\/SASE-CASE.2017.8115368"},{"issue":"6","key":"19_CR26","first-page":"660","volume":"5","author":"JM Urriza","year":"2010","unstructured":"Urriza, J.M., Paez, F.E., Cayssials, R., Orozco, J.D., Schorb, L.S.: Low cost slack stealing method for RM\/DM. Int. Rev. Comput. Softw. 5(6), 660\u2013667 (2010)","journal-title":"Int. Rev. Comput. Softw."},{"key":"19_CR27","doi-asserted-by":"publisher","unstructured":"Wilhelm, R., et al.: The worst-case execution-time problem - overview of methods and survey of tools. ACM Trans. Embed. Comput. Syst. 7(3), 36:1\u201336:53 (2008). https:\/\/doi.org\/10.1145\/1347375.1347389","DOI":"10.1145\/1347375.1347389"}],"container-title":["Communications in Computer and Information Science","Computer Science \u2013 CACIC 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75836-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:35:24Z","timestamp":1620128124000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75836-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030758356","9783030758363"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75836-3_19","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"5 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CACIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentine Congress of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"San Justo, Buenos Aires","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cacic2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cacic2020.unlam.edu.ar\/en-us\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"RedUNCI","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"118","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the COVID-19 pandemic the conference was held in a virtual mode.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}