Solving Out-of-Order Communication in Kahn Process Networks
| Autor: | Ed F. Deprettere, Bart Kienhuis, Alexandru Turjan |
|---|---|
| Rok vydání: | 2005 |
| Předmět: |
Out-of-order execution
FIFO (computing and electronics) Computer science Reading (computer) Distributed computing Process (computing) Kahn process networks Parallel computing computer.software_genre Blocking (computing) Signal Processing Pattern recognition (psychology) Compiler Electrical and Electronic Engineering computer Information Systems |
| Zdroj: | Journal of VLSI signal processing systems for signal, image and video technology. 40:7-18 |
| ISSN: | 0922-5773 |
| DOI: | 10.1007/s11265-005-4935-5 |
| Popis: | The Compaan compiler framework automates the transformation of DSP applications written in Matlab into Kahn Process Networks (KPNs). These KPNs express the signal processing applications in a parallel distributed way making them more suitable for mapping onto parallel architectures. A simple instance of a generated KPN by Compaan is a Producer process that communicates with a Consumer process via a FIFO buffer, with the Consumer reading data from the FIFO using a blocking read. When the sequence of producing data is different from the sequence of consuming data, a simple FIFO is not sufficient to implement the communication. For such case, extra storage and control are needed at the consumer side. This paper presents a compile approach that determines whether a FIFO buffer is sufficient for every Producer/Consumer pair of a Compaan-generated KPN. When additional memory is required, we provide an address generation mechanism to perform the reordering and furthermore give a lower bound on the amount of memory needed to perform the reordering. The presented approach is based on the Ehrhart theory |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|