Predicting MPEG execution times

Andy C. Bavier, A. Brady Montz, Larry L. Peterson

Research output: Contribution to journalArticle

65 Scopus citations

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 R2 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.

Original languageEnglish (US)
Pages (from-to)131-140
Number of pages10
JournalPerformance Evaluation Review
Volume26
Issue number1
DOIs
StatePublished - Jun 1998

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Predicting MPEG execution times'. Together they form a unique fingerprint.

Cite this