The article studies real-time systems which have a set of periodic readers and writers accessing a shared data object. The sufficient scheduling conditions for these tasks to finish their executions before the end of their periods are derived. The paper also studies a scheduling technique called job coalescence which combines many reader jobs or writer jobs into a job cluster and executes the cluster as a single job.
展开▼
