Multimedia applications process streams of values and can often be represented as task graphs. For performance reasons, these task graphs are executed on multiprocessor systems. Inter-task communication is performed via buffers, where the order in which values are written into a buffer can differ from the order in which they are read. Some existing approaches perform inter-task communication via ﬁrst-in-ﬁrst-out buffers in combination with reordering tasks and require applications with affne index-expressions. In our previous work, we used circular buffers with a non-overlapping read and write window, such that a reordering task is not required. However, these windows can cause deadlock for cyclic task graphs. In this paper, we introduce circular buffers with multiple overlapping windows that do not delay the release of locations and therefore they do not introduce deadlock for cyclic task graphs. We show that buffers with multiple overlapping read and write windows are attractive, because they avoid that a buffer has to be selected from which a value has to be read or into which a value has to be written. This signiﬁcantly simpliﬁes the extraction of a task graph from a sequential application. These buffers are also attractive, because a buffer capacity equal to the array size is sufficient for deadlock-free execution, instead of performing global analysis to compute sufficient buffer capacities. Our case-study presents two applications that require these buffers.
|Title of host publication||Transactions on High-Performance Embedded Architectures and Compilers III|
|Place of Publication||Berlin|
|Number of pages||18|
|Publication status||Published - 12 Mar 2011|
|Name||Lecture Notes in Computer Science|
Bijlsma, T., Bekooij, M. J. G., & Smit, G. J. M. (2011). Circular Buﬀers with Multiple Overlapping Windows for Cyclic Task Graphs. In P. Stenström (Ed.), Transactions on High-Performance Embedded Architectures and Compilers III (Lecture Notes in Computer Science; Vol. 6590). Berlin: Springer. https://doi.org/10.1007/978-3-642-19447-4