In real-time systems, stringent timing requirements may impose on
periodic tasks to be initiated immediately upon the arrivals of their
periodic requests or at specific time relative to their periodic
requests. One of the reasons for the requirements is to avoid
jitter. In this paper, we propose treatments to the jitter problems
that may occur on scheduling uniform sampling tasks and introduce a
schedulability analysis for a task set consisting of periodic tasks
and a group task, which is a collection of data acquisition subtasks,
scheduled by a static priority scheduling algorithm.
