Many time critical applications require predictable performance and tasks in these applications have deadlines to be met. For tasks with hard deadlines, a deadline miss can be catastrophic, while for QoS degradable tasks (soft real time tasks) timely approximate results of poorer quality or occasional deadline misses are acceptable. Imprecise computation and (m,k) firm guarantee are two workload models that quantify the trade off between schedulability and result quality. We propose dynamic scheduling algorithms for integrated scheduling of real time tasks, represented by these workload models, in multiprocessor systems. The algorithms aim at improving the schedulability of tasks by exploiting the properties of these models in QoS degradation. We also show how the proposed algorithms can be adapted for integrated scheduling of multimedia streams and hard real time tasks, and demonstrate their effectiveness in quantifying QoS degradation. Through simulation, we evaluate the performance of these algorithms using the metrics-success ratio (measure of schedulability) and quality. Our simulation results show that one of the proposed algorithms, multilevel degradation algorithm, outperforms the others in terms of both the performance metrics. © 1998 IEEE.