{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T15:46:11Z","timestamp":1762875971130,"version":"3.41.0"},"reference-count":8,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2018,3,20]],"date-time":"2018-03-20T00:00:00Z","timestamp":1521504000000},"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":[[2018,3,20]]},"abstract":"<jats:p>Currently, real-time embedded systems evolve towards complex systems using new state of the art technologies such as multi-core processors and virtualization techniques. Both technologies require new real-time scheduling algorithms. For uniprocessor scheduling, utilization-based evaluation methodologies are well-established. For multi-core systems and virtualization, evaluating and comparing scheduling techniques using the tasks' parameters is more realistic. Evaluating such scheduling techniques requires relevant and standardised task sets. Scheduling algorithms can be evaluated at three levels: 1) using a mathematical model of the algorithm, 2) simulating the algorithm and 3) implementing the algorithm on the target platform. Generating task sets is straightforward in the case of the first two levels; only the parameters of the tasks are required. Evaluating and comparing scheduling algorithms on the target platform itself, however, requires executable tasks matching the predefined standardised task sets. Generating those executable tasks is not standardized yet.<\/jats:p>\n          <jats:p>Therefore, we developed a task-set generator that generates reproducible, standardised task sets that are suitable at all levels. Besides generating the tasks' parameters, it includes a method that generates executables by combining publicly available benchmarks with known execution times. This paper presents and evaluates this task-set generator.<\/jats:p>","DOI":"10.1145\/3199610.3199613","type":"journal-article","created":{"date-parts":[[2018,3,22]],"date-time":"2018-03-22T15:17:48Z","timestamp":1521731868000},"page":"22-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Task-set generator for schedulability analysis using the TACLebench benchmark suite"],"prefix":"10.1145","volume":"15","author":[{"given":"Yorick","family":"De Bock","sequence":"first","affiliation":[{"name":"University of Antwerp, Belgium"}]},{"given":"Sebastian","family":"Altmeyer","sequence":"additional","affiliation":[{"name":"University of Amsterdam, The Netherlands"}]},{"given":"Thomas","family":"Huybrechts","sequence":"additional","affiliation":[{"name":"University of Antwerp, Belgium"}]},{"given":"Jan","family":"Broeckhove","sequence":"additional","affiliation":[{"name":"University of Antwerp, Belgium"}]},{"given":"Peter","family":"Hellinckx","sequence":"additional","affiliation":[{"name":"University of Antwerp, Belgium"}]}],"member":"320","published-online":{"date-parts":[[2018,3,20]]},"reference":[{"volume-title":"Formal Modeling and Analysis of Timed Systems (FORMATS)","year":"2003","author":"Amnell T.","key":"e_1_2_1_1_1"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1978802.1978814"},{"volume-title":"the 1st International Workshop on Analysis Tools and Methodologies for Embedded and Real-time Systems (WATERS)","year":"2010","author":"Emberson P.","key":"e_1_2_1_3_1"},{"volume-title":"16th International Workshop on Worst-Case Execution Time Analysis (WCET 2016)","year":"2016","author":"Falk H.","key":"e_1_2_1_4_1"},{"volume-title":"Real World Automotive Benchmarks For Free. In the 6th International Workshop on Analysis Tools and Methodologies for Embedded and Real-time Systems (WATERS)","year":"2015","author":"Kramer S.","key":"e_1_2_1_5_1"},{"key":"e_1_2_1_6_1","unstructured":"A. Makhorin. GNU Linear Programming Kit (GLPK) 2012.  A. Makhorin. GNU Linear Programming Kit (GLPK) 2012."},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"J. P. Vielma. Mixed Integer Linear Programming Formulation Techniques. Society for Industrial and Applied Mathematics (SIAM) 57(1) 2015.  J. P. Vielma. Mixed Integer Linear Programming Formulation Techniques. Society for Industrial and Applied Mathematics (SIAM) 57(1) 2015.","DOI":"10.1137\/130915303"},{"key":"e_1_2_1_8_1","unstructured":"P. W\u00e4gemann T. Distler T. H\u00f6nig V. Sieh and W. Schr\u00f6der-preikschat. GenE : A benchmark generator for WCET analysis. Open Access Series in Informatics (OASIcs) 47 2015.  P. W\u00e4gemann T. Distler T. H\u00f6nig V. Sieh and W. Schr\u00f6der-preikschat. GenE : A benchmark generator for WCET analysis. Open Access Series in Informatics (OASIcs) 47 2015."}],"container-title":["ACM SIGBED Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3199610.3199613","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3199610.3199613","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:07:18Z","timestamp":1750273638000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3199610.3199613"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,20]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,3,20]]}},"alternative-id":["10.1145\/3199610.3199613"],"URL":"https:\/\/doi.org\/10.1145\/3199610.3199613","relation":{},"ISSN":["1551-3688"],"issn-type":[{"type":"electronic","value":"1551-3688"}],"subject":[],"published":{"date-parts":[[2018,3,20]]},"assertion":[{"value":"2018-03-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}