{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:11:02Z","timestamp":1750306262326,"version":"3.41.0"},"reference-count":13,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2016,11,3]],"date-time":"2016-11-03T00:00:00Z","timestamp":1478131200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGBED Rev."],"published-print":{"date-parts":[[2016,11,3]]},"abstract":"<jats:p>Time-triggered networks are widely used for safety-critical applications. Being offline scheduled, flexibility and adaptivity typically come at the price of very low resource utilization, if possible at all. In this paper, we present the Stacked Scheduling Approach (SSA) for time-triggered networks to enable mode changes and implicit adaptation in such networks by enabling reuse of network bandwidth reservations. We describe SSA in detail and conduct a case study to show that SSA can be implemented in COTS time-triggered network hardware and validate the approach by implementing an example in a COTS TTEthernet network.<\/jats:p>","DOI":"10.1145\/3015037.3015046","type":"journal-article","created":{"date-parts":[[2016,11,4]],"date-time":"2016-11-04T12:49:04Z","timestamp":1478263744000},"page":"55-60","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Mode-changes in COTS time-triggered network hardware without online reconfiguration"],"prefix":"10.1145","volume":"13","author":[{"given":"Florian","family":"Heilmann","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t Kaiserslautern, Germany"}]},{"given":"Ali","family":"Syed","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Kaiserslautern, Germany"}]},{"given":"Gerhard","family":"Fohler","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Kaiserslautern, Germany"}]}],"member":"320","published-online":{"date-parts":[[2016,11,3]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2692385.2692397"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2659787.2659812"},{"volume-title":"Protocol Specification","year":"2010","author":"FlexRay Consortium","key":"e_1_2_1_3_1"},{"key":"e_1_2_1_4_1","unstructured":"G. Fohler. Flexibility in Statically Scheduled Real-Time Systems. PhD thesis TNF Wien \u00d6sterreich April 1994.  G. Fohler. Flexibility in Statically Scheduled Real-Time Systems . PhD thesis TNF Wien \u00d6sterreich April 1994."},{"volume-title":"7th international CAN Conference","year":"2000","author":"Fuehrer T.","key":"e_1_2_1_5_1"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SIES.2010.5551384"},{"volume-title":"Automation & Test in Europe","year":"2011","author":"Klobedanz K.","key":"e_1_2_1_7_1"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISORCW.2011.38"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.248873"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0967-0661(97)10054-5"},{"volume-title":"Artificial Intelligence","year":"1985","author":"Korf R. E.","key":"e_1_2_1_11_1"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-007-9040-3"},{"key":"e_1_2_1_13_1","unstructured":"A. Syed and G. Fohler. Search-tree exploration for scheduling using pida*. Technical report August 2014.  A. Syed and G. Fohler. Search-tree exploration for scheduling using pida*. Technical report August 2014."}],"container-title":["ACM SIGBED Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3015037.3015046","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3015037.3015046","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:18Z","timestamp":1750220658000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3015037.3015046"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,3]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,11,3]]}},"alternative-id":["10.1145\/3015037.3015046"],"URL":"https:\/\/doi.org\/10.1145\/3015037.3015046","relation":{},"ISSN":["1551-3688"],"issn-type":[{"type":"electronic","value":"1551-3688"}],"subject":[],"published":{"date-parts":[[2016,11,3]]},"assertion":[{"value":"2016-11-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}