Optimization scheduling of MPEG-4 FGS video coding stream under the feasible mandatory constraint

Huey Min Sun, Lih-Chyun Shu

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

MPEG-4 video coding stream with Fine Granularity Scalability (FGS) can be flexibly dropped by very fine granularity so as to adapt to the available network bandwidth. The MPEG-4 FGS model is similar to the imprecise computation model originally proposed in the real-time scheduling field. In both models, it is required that all the mandatory tasks be completely scheduled before their deadlines even in the worst case, which is called the feasible mandatory constraint. The problem is how to maximize the number of the scheduled tasks based on the importance of tasks and to satisfy the feasible mandatory constraint. We adapt the existing unit-time tasks scheduling algorithm to address the problem by using a weighted assignment scheme that adds constant weights to mandatory tasks. Under the feasible mandatory constraint, we prove that the proposed algorithm maximizes the total weights of the scheduled tasks, and all mandatory tasks are guaranteed to be completely scheduled before their deadlines. The experimental results show the performance of the video quality for our scheduling algorithm by the measurements of Peak Signal to Noise Ratio (PSNR).

Original languageEnglish
Pages (from-to)111-131
Number of pages21
JournalMultimedia Tools and Applications
Volume44
Issue number1
DOIs
Publication statusPublished - 2009 Aug 1

Fingerprint

Image coding
Scalability
Scheduling
Scheduling algorithms
Signal to noise ratio
Bandwidth

All Science Journal Classification (ASJC) codes

  • Software
  • Media Technology
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

@article{f9527ded01fe4673abb8968eb0385c1c,
title = "Optimization scheduling of MPEG-4 FGS video coding stream under the feasible mandatory constraint",
abstract = "MPEG-4 video coding stream with Fine Granularity Scalability (FGS) can be flexibly dropped by very fine granularity so as to adapt to the available network bandwidth. The MPEG-4 FGS model is similar to the imprecise computation model originally proposed in the real-time scheduling field. In both models, it is required that all the mandatory tasks be completely scheduled before their deadlines even in the worst case, which is called the feasible mandatory constraint. The problem is how to maximize the number of the scheduled tasks based on the importance of tasks and to satisfy the feasible mandatory constraint. We adapt the existing unit-time tasks scheduling algorithm to address the problem by using a weighted assignment scheme that adds constant weights to mandatory tasks. Under the feasible mandatory constraint, we prove that the proposed algorithm maximizes the total weights of the scheduled tasks, and all mandatory tasks are guaranteed to be completely scheduled before their deadlines. The experimental results show the performance of the video quality for our scheduling algorithm by the measurements of Peak Signal to Noise Ratio (PSNR).",
author = "Sun, {Huey Min} and Lih-Chyun Shu",
year = "2009",
month = "8",
day = "1",
doi = "10.1007/s11042-009-0279-7",
language = "English",
volume = "44",
pages = "111--131",
journal = "Multimedia Tools and Applications",
issn = "1380-7501",
publisher = "Springer Netherlands",
number = "1",

}

Optimization scheduling of MPEG-4 FGS video coding stream under the feasible mandatory constraint. / Sun, Huey Min; Shu, Lih-Chyun.

In: Multimedia Tools and Applications, Vol. 44, No. 1, 01.08.2009, p. 111-131.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Optimization scheduling of MPEG-4 FGS video coding stream under the feasible mandatory constraint

AU - Sun, Huey Min

AU - Shu, Lih-Chyun

PY - 2009/8/1

Y1 - 2009/8/1

N2 - MPEG-4 video coding stream with Fine Granularity Scalability (FGS) can be flexibly dropped by very fine granularity so as to adapt to the available network bandwidth. The MPEG-4 FGS model is similar to the imprecise computation model originally proposed in the real-time scheduling field. In both models, it is required that all the mandatory tasks be completely scheduled before their deadlines even in the worst case, which is called the feasible mandatory constraint. The problem is how to maximize the number of the scheduled tasks based on the importance of tasks and to satisfy the feasible mandatory constraint. We adapt the existing unit-time tasks scheduling algorithm to address the problem by using a weighted assignment scheme that adds constant weights to mandatory tasks. Under the feasible mandatory constraint, we prove that the proposed algorithm maximizes the total weights of the scheduled tasks, and all mandatory tasks are guaranteed to be completely scheduled before their deadlines. The experimental results show the performance of the video quality for our scheduling algorithm by the measurements of Peak Signal to Noise Ratio (PSNR).

AB - MPEG-4 video coding stream with Fine Granularity Scalability (FGS) can be flexibly dropped by very fine granularity so as to adapt to the available network bandwidth. The MPEG-4 FGS model is similar to the imprecise computation model originally proposed in the real-time scheduling field. In both models, it is required that all the mandatory tasks be completely scheduled before their deadlines even in the worst case, which is called the feasible mandatory constraint. The problem is how to maximize the number of the scheduled tasks based on the importance of tasks and to satisfy the feasible mandatory constraint. We adapt the existing unit-time tasks scheduling algorithm to address the problem by using a weighted assignment scheme that adds constant weights to mandatory tasks. Under the feasible mandatory constraint, we prove that the proposed algorithm maximizes the total weights of the scheduled tasks, and all mandatory tasks are guaranteed to be completely scheduled before their deadlines. The experimental results show the performance of the video quality for our scheduling algorithm by the measurements of Peak Signal to Noise Ratio (PSNR).

UR - http://www.scopus.com/inward/record.url?scp=67449113536&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67449113536&partnerID=8YFLogxK

U2 - 10.1007/s11042-009-0279-7

DO - 10.1007/s11042-009-0279-7

M3 - Article

VL - 44

SP - 111

EP - 131

JO - Multimedia Tools and Applications

JF - Multimedia Tools and Applications

SN - 1380-7501

IS - 1

ER -