{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:52:16Z","timestamp":1750308736321,"version":"3.41.0"},"reference-count":15,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2013,10,1]],"date-time":"2013-10-01T00:00:00Z","timestamp":1380585600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["247846, 249776"],"award-info":[{"award-number":["247846, 249776"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGBED Rev."],"published-print":{"date-parts":[[2013,10]]},"abstract":"<jats:p>\n            Composability and compositionality are well recognised as key enablers in rigorous design and analysis of complex systems. We argue that existing work on these enablers, specific to real-time systems, has exclusively focussed on design and analysis of\n            <jats:italic>structural<\/jats:italic>\n            composition, by which we refer to composition of either separate software tasks or compositions thereof on a shared platform such as a processor. Though structural composition is common and likely the most useful such composition, we make the case of an altogether different kind of composition which we refer to as\n            <jats:italic>behavioural<\/jats:italic>\n            composition. As a specific example of behavioural composition, we discuss how to constructively build complex server algorithms, called Demand Bound Servers (DBS), by composing constituent simpler server algorithms, even hierarchically. As a result of such composition, we can build server algorithms to more tightly match the requirements of tasks they need to serve, which indeed is not possible with the simpler components themselves. This is an example of how new behaviour is emergent out of the composition. We remain curious if there are other such examples of behavioural composition of interest to real-time systems.\n          <\/jats:p>","DOI":"10.1145\/2544350.2544355","type":"journal-article","created":{"date-parts":[[2013,11,26]],"date-time":"2013-11-26T13:23:15Z","timestamp":1385472195000},"page":"43-48","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Behavioural composition constructively built server algorithms"],"prefix":"10.1145","volume":"10","author":[{"given":"Pratyush","family":"Kumar","sequence":"first","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lothar","family":"Thiele","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,10]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_2_1_1_1","DOI":"10.1109\/JPROC.2002.805821"},{"doi-asserted-by":"publisher","key":"e_1_2_1_2_1","DOI":"10.1145\/1455229.1455231"},{"volume-title":"IEEE Computer Society","year":"1994","author":"Spuri M.","key":"e_1_2_1_3_1"},{"doi-asserted-by":"crossref","unstructured":"R. Rajkumar K. Juvva A. Molano and S. Oikawa \"Resource kernels: A resource-centric approach to real-time and multimedia systems \" in In Proceedings of the SPIE\/ACM Conference on Multimedia Computing and Networking 1998.  R. Rajkumar K. Juvva A. Molano and S. Oikawa \"Resource kernels: A resource-centric approach to real-time and multimedia systems \" in In Proceedings of the SPIE\/ACM Conference on Multimedia Computing and Networking 1998.","key":"e_1_2_1_4_1","DOI":"10.1117\/12.298417"},{"unstructured":"G. Lipari and S. K. Baruah \"Efficient scheduling of real-time multi-task applications in dynamic systems \" in IEEE Real Time Technology and Applications Symposium 2000.   G. Lipari and S. K. Baruah \"Efficient scheduling of real-time multi-task applications in dynamic systems \" in IEEE Real Time Technology and Applications Symposium 2000.","key":"e_1_2_1_5_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_6_1","DOI":"10.1016\/0304-3975(94)90010-8"},{"volume-title":"IEEE Computer Society","year":"2003","author":"Shin I.","key":"e_1_2_1_7_1"},{"key":"e_1_2_1_8_1","first-page":"101","article-title":"Real-time calculus for scheduling hard real-time systems","volume":"4","author":"Thiele L.","year":"2000","journal-title":"IEEE International Symposium on Circuits and Systems"},{"doi-asserted-by":"publisher","key":"e_1_2_1_9_1","DOI":"10.1109\/REAL.2004.17"},{"doi-asserted-by":"publisher","key":"e_1_2_1_10_1","DOI":"10.1145\/2038642.2038679"},{"unstructured":"L. Abeni and G. C. Buttazzo \"Integrating Multimedia Applications in Hard Real-Time Systems \" in IEEE Real-Time Systems Symposium 1998.   L. Abeni and G. C. Buttazzo \"Integrating Multimedia Applications in Hard Real-Time Systems \" in IEEE Real-Time Systems Symposium 1998.","key":"e_1_2_1_11_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_12_1","DOI":"10.1007\/BF01094172"},{"doi-asserted-by":"crossref","unstructured":"S. K. Baruah A. K. Mok and L. E. Rosier \"Preemptively scheduling hard-real-time sporadic tasks on one processor \" in IEEE Real-Time Systems Symposium 1990.  S. K. Baruah A. K. Mok and L. E. Rosier \"Preemptively scheduling hard-real-time sporadic tasks on one processor \" in IEEE Real-Time Systems Symposium 1990.","key":"e_1_2_1_13_1","DOI":"10.1109\/REAL.1990.128746"},{"doi-asserted-by":"publisher","key":"e_1_2_1_14_1","DOI":"10.1109\/RTSS.2007.10"},{"doi-asserted-by":"crossref","unstructured":"J.-Y. L.\n       \n      Boudec\n     and \n      \n      \n      P.\n       \n      Thiran Network Calculus: A Theory of Deterministic Queuing Systems for the Internet vol. \n  2050\n   of \n  Lecture Notes in Computer Science\n  . \n  Springer 2001\n  .   J.-Y. L. Boudec and P. Thiran Network Calculus: A Theory of Deterministic Queuing Systems for the Internet vol. 2050 of Lecture Notes in Computer Science . Springer 2001.","key":"e_1_2_1_15_1","DOI":"10.1007\/3-540-45318-0"}],"container-title":["ACM SIGBED Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2544350.2544355","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2544350.2544355","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:04Z","timestamp":1750278124000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2544350.2544355"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["10.1145\/2544350.2544355"],"URL":"https:\/\/doi.org\/10.1145\/2544350.2544355","relation":{},"ISSN":["1551-3688"],"issn-type":[{"type":"electronic","value":"1551-3688"}],"subject":[],"published":{"date-parts":[[2013,10]]},"assertion":[{"value":"2013-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}