{"alternative_title":["LNCS"],"quality_controlled":"1","title":"Schedule-carrying code","status":"public","publisher":"ACM","scopus_import":"1","oa_version":"None","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_created":"2018-12-11T12:08:59Z","abstract":[{"lang":"eng","text":"We introduce the paradigm of schedule-carrying code (SCC). A hard real-time program can be executed on a given platform only if there exists a feasible schedule for the real-time tasks of the program. Traditionally, a scheduler determines the existence of a feasible schedule according to some scheduling strategy. With SCC, a compiler proves the existence of a feasible schedule by generating executable code that is attached to the program and represents its schedule. An SCC executable is a real-time program that carries its schedule as code, which is produced once and can be revalidated and executed with each use. We evaluate SCC both in theory and practice. In theory, we give two scenarios, of nonpreemptive and distributed scheduling for Giotto programs, where the generation of a feasible schedule is hard, while the validation of scheduling instructions that are attached to the programs is easy. In practice, we implement SCC and show that explicit scheduling instructions can reduce the scheduling overhead up to 35% and can provide an efficient, flexible, and verifiable means for compiling Giotto programs on complex architectures, such as the TTA."}],"publication_status":"published","extern":"1","date_published":"2003-09-29T00:00:00Z","article_processing_charge":"No","month":"09","date_updated":"2024-01-10T11:33:57Z","type":"conference","day":"29","acknowledgement":"This work was supported by the AFOSR MURI grant F49620-00-1-0327, the California MICRO grant 01-037, the DARPA grant F33615-C-98-3614, the MARCO grant 98-DT-660, and the NSF grants CCR-0208875, CCR-0085949, and CCR-0225610.","year":"2003","intvolume":" 2855","publist_id":"267","volume":2855,"_id":"4464","language":[{"iso":"eng"}],"conference":{"location":"Philadelphia, PA, USA","end_date":"2003-10-15","name":"EMSOFT: Embedded Software ","start_date":"2003-10-13"},"citation":{"mla":"Henzinger, Thomas A., et al. “Schedule-Carrying Code.” Proceedings of the 3rd International Conference on Embedded Software, vol. 2855, ACM, 2003, pp. 241–56, doi:10.1007/978-3-540-45212-6_16.","ieee":"T. A. Henzinger, C. Kirsch, and S. Matic, “Schedule-carrying code,” in Proceedings of the 3rd International Conference on Embedded Software, Philadelphia, PA, USA, 2003, vol. 2855, pp. 241–256.","apa":"Henzinger, T. A., Kirsch, C., & Matic, S. (2003). Schedule-carrying code. In Proceedings of the 3rd International Conference on Embedded Software (Vol. 2855, pp. 241–256). Philadelphia, PA, USA: ACM. https://doi.org/10.1007/978-3-540-45212-6_16","chicago":"Henzinger, Thomas A, Christoph Kirsch, and Slobodan Matic. “Schedule-Carrying Code.” In Proceedings of the 3rd International Conference on Embedded Software, 2855:241–56. ACM, 2003. https://doi.org/10.1007/978-3-540-45212-6_16.","ista":"Henzinger TA, Kirsch C, Matic S. 2003. Schedule-carrying code. Proceedings of the 3rd International Conference on Embedded Software. EMSOFT: Embedded Software , LNCS, vol. 2855, 241–256.","ama":"Henzinger TA, Kirsch C, Matic S. Schedule-carrying code. In: Proceedings of the 3rd International Conference on Embedded Software. Vol 2855. ACM; 2003:241-256. doi:10.1007/978-3-540-45212-6_16","short":"T.A. Henzinger, C. Kirsch, S. Matic, in:, Proceedings of the 3rd International Conference on Embedded Software, ACM, 2003, pp. 241–256."},"publication_identifier":{"isbn":["9783540202233"]},"publication":"Proceedings of the 3rd International Conference on Embedded Software","author":[{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A"},{"first_name":"Christoph","last_name":"Kirsch","full_name":"Kirsch, Christoph"},{"full_name":"Matic, Slobodan","first_name":"Slobodan","last_name":"Matic"}],"page":"241 - 256","doi":"10.1007/978-3-540-45212-6_16"}