Optimal image partitioning in heterogeneous computing systems

Optimal image partitioning in heterogeneous computing systems

A large and useful subset of image processing applications can be characterised using data parallel iterative synchronous algorithms. A partitioning and co-scheduling algorithm with minimum task's finish time is presented. One important rational characteristic of this algorithm is that it has c...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Electronics letters 2002-08, Vol.38 (18), p.1023-1023
Hauptverfasser: Zhiyong, Zeng, Xinda, Lu
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A large and useful subset of image processing applications can be characterised using data parallel iterative synchronous algorithms. A partitioning and co-scheduling algorithm with minimum task's finish time is presented. One important rational characteristic of this algorithm is that it has considered the communication overhead.
ISSN:0013-5194
1350-911X
DOI:10.1049/el:20020725