Abstract-The majority of contemporary mobile devices and personal computers are based on heterogeneous computing platforms that consist of a number of CPU cores and one or more Graphics Processing Units (GPUs). Despite the high volume of these devices, there are few existing programming frameworks that target full and simultaneous utilization of all CPU and GPU devices of the platform.This article presents a dataflow-flavored Model of Computation (MoC) that has been developed for deploying signal processing applications to heterogeneous platforms. The presented MoC is dynamic and allows describing applications with data dependent run-time behavior. On top of the MoC, formal design rules are presented that enable application descriptions to be simultaneously dynamic and decidable. Decidability guarantees compile-time application analyzability for deadlock freedom and bounded memory.The presented MoC and the design rules are realized in a novel Open Source programming environment "PRUNE" and demonstrated with representative application examples from the domains of image processing, computer vision and wireless communications. Experimental results show that the proposed approach outperforms the state-of-the-art in analyzability, flexibility and performance.

The upcoming Reconfigurable Video Coding (RVC) standard from MPEG (ISO / IEC SC29WG11) defines a library of coding tools to specify existing or new compressed video formats and decoders. The coding tool library has been written in a dataflow/actororiented language named CAL. Each coding tool (actor) can be represented with an extended finite state machine and the data communication between the tools are described as dataflow graphs. This paper proposes an approach to model the CAL actor network with Parameterized Synchronous Data Flow and to derive a quasi-static multiprocessor execution schedule for the system. In addition to proposing a scheduling approach for RVC, an extension to the well-known permutation flow shop scheduling problem that enables rapid runtime scheduling of RVC tasks, is introduced.

Noise reduction is one of the most fundamental digital image processing problems, and is often designed to be solved at an early stage of the image processing path. Noise appears on the images in many different ways, and it is inevitable. In general, various image processing algorithms perform better if their input is as error-free as possible. In order to keep the processing delays small in different computing platforms, it is important that the noise reduction is performed swiftly.The recent progress in the entertainment industry has led to major improvements in the computing capabilities of graphics cards. Today, graphics circuits consist of several hundreds or even thousands of computing units. Using these computing units for general-purpose computation is possible with OpenCL and CUDA programming interfaces. In applications where the processed data is relatively independent, using parallel computing units may increase the performance significantly. Graphics chips enabled with general-purpose computation capabilities are becoming more common also in mobile devices. In addition, photography has never been as popular as it is nowadays by using mobile devices.This thesis aims to implement the calculation of the state-of-the-art technology used in noise reduction, block-matching and three-dimensional filtering (BM3D), to be executed in heterogeneous computing environments. This study evaluates the performance of the presented implementations by making comparisons with existing implementations. The presented implementations achieve significant benefits from the use of parallel computing devices. At the same time the comparisons illustrate general problems in the utilization of using massively parallel processing for the calculation of complex imaging algorithms. Keywords TIIVISTELMÄKohinanpoisto on yksi keskeisimmistä digitaaliseen kuvankäsittelyyn liittyvistä ongelmista, joka useimmiten pyritään ratkaisemaan jo signaalinkäsittelyvuon varhaisessa vaiheessa. Kohinaa ilmestyy kuviin monella eri tavalla ja sen esiintyminen on väistämätöntä. Useat kuvankäsittelyalgoritmit toimivat paremmin, jos niiden syöte on valmiiksi mahdollisimman virheetöntä käsiteltäväksi. Jotta kuvankäsittelyviiveet pysyisivät pieninä eri laskentaalustoilla, on tärkeää että myös kohinanpoisto suoritetaan nopeasti.Viihdeteollisuuden kehityksen myötä näytönohjaimien laskentateho on moninkertaistunut. Nykyisin näytönohjainpiirit koostuvat useista sadoista tai jopa tuhansista laskentayksiköistä. Näiden laskentayksiköiden käyttäminen yleiskäyttöiseen laskentaan on mahdollista OpenCL-ja CUDAohjelmointirajapinnoilla.Rinnakkaislaskenta usealla laskentayksiköllä mahdollistaa suuria suorituskyvyn parannuksia käyttökohteissa, joissa käsiteltävä tieto on toisistaan riippumatonta tai löyhästi riippuvaista. Näytönohjainpiirien käyttö yleisessä laskennassa on yleistymässä myös mobiililaitteissa. Lisäksi valokuvaaminen on nykypäivänä suosituinta juuri mobiililaitteilla.Tämä diplomityö pyrkii selvittämään viimeisimmän kohinanpoistoon käytettävän tekni...

In this paper, we present four scheduling algorithms that provide flexible utilization of fine-grain DSP accelerators with low run-time overhead. Methods that have originally been used in operations research are implemented in a way that minimizes the amount of run-time computations. These low overhead scheduling methods can be used for synchronization in multi-processor systems, especially when dedicated co-processors implement tasks with low turnaround times. We demonstrate our methods by an application to MPEG-4 video decoding. In this demonstration, MPEG-4 macroblock decoding is modeled as a permutation flowshop problem and our proposed algorithms are applied to schedule co-processors that implement MPEG-4 block decoding operations. Experimental results demonstrate the effectiveness of our scheduling approach.

No abstract

▼♦❞❡r♥ ❡♠❜❡❞❞❡❞ s②st❡♠s s❤♦✇ ❛ ❝•❡❛r tr❡♥❞ t♦✇❛r❞s t❤❡ ✉s❡ ♦❢ ▼✉•t✐♣r♦❝❡ss♦r ❙②st❡♠✲♦♥✲❈❤✐♣ ✭▼P❙♦❈✮ ❛r❝❤✐t❡❝t✉r❡s ✐♥ ♦r❞❡r t♦ ❤❛♥❞✉s ♣r♦❝❡ss♦rs t❤❛t ❝❛♥ ❜❡ s②♥t❤❡s✐③❡❞ ♦♥ ❋P•❆ ❝❤✐♣s✳ ❚❤❡ s②♥t❤❡s✐③❡❞ ♣r♦❝❡ss♦rs ❛r❡ ❱❡r② ▲♦♥❣ ■♥str✉❝t✐♦♥ ❲♦r❞ ✲st②•❡ ♣r♦❝❡ss♦rs✳ ❙✉❝❤ ❛ ♠❡t❤♦❞♦•♦❣② ♣❡r♠✐ts t❤❡ r❛♣✐❞ ❞❡s✐❣♥ ♦❢ ❛ ♠❛♥②✲❝♦r❡ s✐❣♥❛• ♣r♦❝❡ss✐♥❣ s②st❡♠ ✇❤✐❝❤ ❝❛♥ t❛❦❡ ❛❞✈❛♥t❛❣❡ ♦❢ ❛•• •❡✈❡•s ♦❢ ♣❛r❛••❡•✐s♠✳ ❚❤❡ t♦♦•❝❤❛✐♥ ❢✉♥❝t✐♦♥❛•✐t② ❤❛s ❜❡❡♥ ❞❡♠♦♥str❛t❡❞ ❜② s②♥t❤❡s✐③✐♥❣ ❛♥ ▼P❊•✲ ✹ ❙✐♠♣•❡ Pr♦✜•❡ ✈✐❞❡♦ ❞❡❝♦❞❡r t♦ t✇♦ ❞✐✛❡r❡♥t ❋P•❆ ❜♦❛r❞s✳ ❚❤❡ ❞❡❝♦❞❡r ✐s r❡❛•✐③❡❞ ✐♥t♦ ✶✽ ♣r♦❝❡ss♦rs t❤❛t ❞❡❝♦❞❡ ◗❈■❋ r❡s♦•✉t✐♦♥ ✈✐❞❡♦ ❛t ✹✺ ❢r❛♠❡s ♣❡r s❡❝♦♥❞ ♦♥ ❛ ✺✵▼❍③ ❋P•❆ ❝•♦❝❦ ❢r❡q✉❡♥❝②✳ ❚❤❡ r❡s✉•ts s❤♦✇ t❤❛t t❤❡ ❣✐✈❡♥ ❛♣♣•✐❝❛t✐♦♥ ❝❛♥ t❛❦❡ ❛❞✈❛♥t❛❣❡ ♦❢ ❡✈❡r② •❡✈❡• ♦❢ ♣❛r❛••❡•✐s♠✳ ❑❡②✇♦r❞s✿ ❈♦✲❞❡s✐❣♥✱ |❱❈✱ ❉❛t❛✢♦✇ ♣r♦❣r❛♠s✱ ▼P❙♦❈✱ ❚❚❆✱ ❋P•❆ ✶✳ ■♥tr♦❞✉❝t✐♦♥ ❖✈❡r t❤❡ ♣❛st ❢❡✇ ②❡❛rs✱ t❤❡ ✉s❡ ♦❢ ♠✉•t✐♠❡❞✐❛ ❛♣♣•✐❝❛t✐♦♥s ✐♥ ❡♠❜❡❞❞❡❞ s②st❡♠s ❤❛s ♠❛ss✐✈❡•② ❣r♦✇♥ t❤❛♥❦s t♦ t❤❡ ❝♦♠♠❡r❝✐❛• s✉❝❝❡ss ♦❢ ❞❡✈✐❝❡s s✉❝❤ ❊♠❛✐• ❛❞❞r❡ss❡s✿ ❤❡r✈❡✳②✈✐q✉❡•❅✐r✐s❛✳❢r ✭❍✳ (✈✐q✉❡•✮✱ •❛♥✐✳❜♦✉t❡••✐❡r❅❡❡✳♦✉•✉✳❢✐ ✭❏✳ ❇♦✉t❡••✐❡r✮✱ ♠✐❝❦❛❡•✳r❛✉•❡t❅✐♥s❛✲r❡♥♥❡s✳❢r ✭▼✳ |❛✉•❡t✮✱ ❡♠♠❛♥✉❡•✳❝❛ss❡❛✉❅✐r✐s❛✳❢r ✭❊✳ ❈❛ss❡❛✉✮ Pr❡♣r✐♥t s✉❜♠✐tt❡❞ t♦ ❊•s❡✈✐❡r ❋❡❜r✉❛r② ✹✱ ✷✵✶✸

The upcoming Reconfigurable Video Coding (RVC) standard from MPEG (ISO/IEC SC29WG11) defines a library of coding tools to specify existing or new compressed video formats and decoders. The coding tool library has been written in a dataflow/actor-oriented language named CAL. Each coding tool can be represented with an extended finite state machine and the dependencies between the tools are described as dataflow graphs. This paper proposes an approach to derive a multiprocessor execution schedule for RVC systems that are comprised of CAL actors. In addition to proposing a scheduling approach for RVC, an extension to the well-known permutation flow shop scheduling problem that enables rapid run-time scheduling of RVC tasks is introduced.

No abstract