Abstract
Scheduling guarantees are essential in many real-time embedded computer systems. They can only be achieved by performing analysis of scheduling feasibility prior to run-time. This paper examines some issues related to this problem in the context of hardware architectures that are more complex than a single bus linking several processors. It raises questions about how well existing static scheduling and schedulability analysis techniques scale up to the larger systems that are likely to be in use in the future. >
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call