  Real-time systems increasingly use multicore processors in order to satisfy
thermal, power, and computational requirements. To exploit the architectural
parallelism offered by the multicore processors, parallel task models,
scheduling algorithms and response-time analyses with respect to real-time
constraints have to be provided. In this paper, we propose a reservation-based
scheduling algorithm for sporadic constrained-deadline parallel conditional DAG
tasks with probabilistic execution behaviour for applications that can tolerate
bounded number of deadline misses and bounded tardiness. We devise design rules
and analyses to guarantee bounded tardiness for a specified bounded probability
for $k$-consecutive deadline misses without enforcing late jobs to be
immediately aborted.
