Predicting MPEG execution times
- 1 June 1998
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 26 (1) , 131-140
- https://doi.org/10.1145/277858.277892
Abstract
This paper reports on a set of experiments that measure the amount of CPU processing needed to decode MPEG-compressed video in software. These experiments were designed to discover indicators that could be used to predict how many cycles are required to decode a given frame. Such predictors can be used to do more accurate CPU scheduling. We found that by considering both frame type and size, it is possible to construct a linear model of MPEG decoding with R 2 values of 0.97 and higher. Moreover, this model can be used to predict decoding times at both the frame and packet level that are almost always accurate to within 25% of the actual decode times. This is a surprising result given the large variability in MPEG decoding times, and suggests that it is feasible to design systems that make quality of service guarantees for MPEG-encoded video.Keywords
This publication has 4 references indexed in Scilit:
- The design, implementation and evaluation of SMARTPublished by Association for Computing Machinery (ACM) ,1997
- Making paths explicit in the Scout operating systemPublished by Association for Computing Machinery (ACM) ,1996
- A hierarchial CPU scheduler for multimedia operating systemsPublished by Association for Computing Machinery (ACM) ,1996
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973