A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
We cover a broad range of algorithms, including deadline-based and utility accrual scheduling algorithms. ... Interestingly, and in contrast to the conclusion of prior research, our results reveal that some global scheduling algorithms (e.g. G-NP-EDF) is actually scalable on large core counts (e.g. 48). ... Global RMS Global rate monotonic scheduling is a simple extension of rate monotonic scheduling to m cores. Our algorithm is implemented on the stop-the-world architecture. ...doi:10.1145/2133803.2345677 fatcat:lev5h3a7qjaitj4ny2sd44zlli
The goal of the seminar is to promote a spirit of co-operation and collaboration within the real-time scheduling community. RTSOPS 2011 is organized around presentation and collaboration sessions. ... This seminar provides a venue for the exchange of ideas and the discussion of interesting unsolved problems in real-time scheduling. ... Hence, the core problem of partitioned scheduling is task allocation. Since the problem is closely related to bin packing, it is NP-hard. ...doi:10.1093/comjnl/29.5.390 fatcat:xsvmc5dpwjasvemenvs74lzzrm
degree of redundancy, (2) A local and online scheduling algorithm that is scalable, energy-efficient, and supports network/workload dynamics while ensuring reliability and real-time performance, (3) An ... approach to minimize latency for in-band integration of multiple low-power networks, (4) A fast and efficient test of schedulability that determines if an application meets the real-time performance requirement ... rate monotonic) scheduler. ...arXiv:2011.03169v1 fatcat:ms6fyb45cbhyvkpfryjhpipgou
We would like to thank Raimund Kirner for his support in integrating his tool CALCWCET 167 and Albrecht Kadlec for many related discussions. ... to the NP-hard nature of integer linear programming problems. ... For modern hardware architectures, however, Liu and Layland's assumption of negligible context switch costs  no longer holds. ...doi:10.4230/oasics.wcet.2008 fatcat:gohrtwqyzbfwdckw3fryeikrge