Optimal scheduling algorithms for communication constrained parallel processing

D. Turgay Altılar, Yakup Paker

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

37 Citations (Scopus)

Abstract

With the advent of digital TV and interactive multimedia over broadband networks, the need for high performance computing for broadcasting is stronger than ever. Processing a digital video sequence requires considerable computing. One of the ways to cope with the demands of video processing in real-time, we believe, is parallel processing. Scheduling plays an important role in parallel processing especially for video processing applications which are usually bounded by the data bandwidth of the transmission medium. Although periodic real-time scheduling algorithms have been under research for more than a decade, scheduling for continuous data streams and impact of scheduling on communication performance are still unexplored. In this paper we examine periodic real-time scheduling assuming that the application is communication constrained where input and output data sizes are not equal.

Original languageEnglish
Title of host publicationEuro-Par 2002 Parallel Processing - 8th International Euro-Par Conference Paderborn, Germany, August 27-30, 2002 Proceedings
EditorsBurkhard Monien, Rainer Feldmann
PublisherSpringer Verlag
Pages197-206
Number of pages10
ISBN (Print)3540440496
DOIs
Publication statusPublished - 2002
Externally publishedYes
Event8th International Euro-Par Conference on Parallel Processing, Euro-Par 2002 - Paderborn, Germany
Duration: 27 Aug 200230 Aug 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2400
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference8th International Euro-Par Conference on Parallel Processing, Euro-Par 2002
Country/TerritoryGermany
CityPaderborn
Period27/08/0230/08/02

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.

Fingerprint

Dive into the research topics of 'Optimal scheduling algorithms for communication constrained parallel processing'. Together they form a unique fingerprint.

Cite this