In spite of many real times scheduling algorithms available it is not clear that these scheduling algorithms support fully the problems in the real time system in multiprocessors. There are certain “open loop” algorithm that can support only some set of characteristics such as the deadlines, precedence constraints, shared resources and future release time etc. Open loop are being referred as once the schedules are fixed there is no alterations based on the continuous feedback. But open loop is fine for the static or dynamic models where the job is perfectly modeled and assigned. But when it is executed for unpredictable dynamic systems the open loop does not offer its full performance. This paper fully focuses on the “closed loop” real time scheduling algorithm for multiprocessors in the usage of multimedia systems. Here the case is studied from the worst case to the best case.