In this paper, we present the exact analysis of the worst case response time of the general multiframe (MF) task model executing on a uniprocessor according to the fixed priority scheduling scheme. The analysis is given in three steps. Firstly, we relax the restriction of Accumulatively Monotonic (AM) and present the basic response time analysis where we optimize the number of frames that have to be considered in such analysis; we show how they can be significantly reduced by eliminating non critical frames that are dominated by other frames. Secondly, we extend this analysis to be applicable to MF tasks with release jitter. Lastly, the basic analysis is improved to cope with arbitrary deadlines.