{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T00:35:39Z","timestamp":1777077339791,"version":"3.51.4"},"reference-count":0,"publisher":"California Digital Library (CDL)","issue":"1","license":[{"start":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T00:00:00Z","timestamp":1661731200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Systems Research"],"abstract":"<p>Task pipelines are common in today\u2019s embedded systems, as data moves from source to sink in sensing-processing-actuation task chains. A real-time task pipeline is constructed by connecting a series of periodic tasks with data buffers. In a time-critical system, end-to-end timing and data-transfer properties of a task pipeline must be guaranteed. A guarantee could be mathematically expressed by assigning constraints to the tasks of a pipeline. However, deriving task scheduling parameters to meet end-to-end guarantees is an NP-hard constraint optimization problem. Hence, a traditional constraint solver is not a suitable runtime solution. In this paper, we present a heuristic constraint solver algorithm, CoPi, to derive the execution times and periods of pipelined tasks that meet the end-to-end constraints and schedulability requirements. We consider two upper bound constraints on a task pipeline: end-to-end delay and loss-rate. After satisfying these constraints, CoPi schedules a pipeline as a set of asynchronous and data independent periodic tasks, under the rate-monotonic scheduling algorithm. Simulations show that CoPi has a comparable pipeline acceptance ratio and significantly better runtime than open-source MINLPsolvers. Furthermore, we use CoPi to map multiple task pipelines to a multiprocessor system. We demonstrate that a partitioned multiprocessor scheduling algorithm coupled with CoPi accommodates dynamically appearing pipelines, while attempting to minimize task migrations.<\/p>","DOI":"10.5070\/sr32158647","type":"journal-article","created":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T01:37:09Z","timestamp":1661737029000},"source":"Crossref","is-referenced-by-count":3,"title":["[Solution] End-to-end Scheduling of Real-time Task Pipelines on Multiprocessors"],"prefix":"10.5070","volume":"2","author":[{"given":"Soham","family":"Sinha","sequence":"first","affiliation":[]},{"given":"Richard","family":"West","sequence":"additional","affiliation":[]}],"member":"29705","published-online":{"date-parts":[[2022,8,29]]},"container-title":["Journal of Systems Research"],"original-title":[],"link":[{"URL":"https:\/\/escholarship.org\/content\/qt2h11n6xj\/qt2h11n6xj.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T23:40:06Z","timestamp":1777074006000},"score":1,"resource":{"primary":{"URL":"https:\/\/escholarship.org\/uc\/item\/2h11n6xj"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,29]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,1,1]]}},"URL":"https:\/\/doi.org\/10.5070\/sr32158647","relation":{},"ISSN":["2770-5501"],"issn-type":[{"value":"2770-5501","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,29]]}}}