Exploiting the Expressiveness of Cyclo-Static Dataflow to Model Multimedia Implementations

  • PDF / 1,073,475 Bytes
  • 14 Pages / 600.03 x 792 pts Page_size
  • 35 Downloads / 184 Views

DOWNLOAD

REPORT


Research Article Exploiting the Expressiveness of Cyclo-Static Dataflow to Model Multimedia Implementations Kristof Denolf,1 Marco Bekooij,2 Johan Cockx,1 Diederik Verkest,1, 3, 4 and Henk Corporaal5 1 Nomadic

Embedded Systems (NES), Interuniversity Micro Electronics Centre (IMEC), Kapeldreef 75, 3001 Leuven, Belgium Research, Systems and Circuits, Prof. Holstlaan 4, 5656 AE Eindhoven, The Netherlands 3 Department of Electrical Engineering, Katholieke Universiteit Leuven (KU-Leuven), 3001 Leuven, Belgium 4 Department of Electrical Engineering, Vrije Universiteit Brussel (VUB), 1050 Brussels, Belgium 5 Faculty of Electrical Engineering, Technical University Eindhoven, Den Dolech 2, 5612 AZ Eindhoven, The Netherlands 2 NXP

Received 14 September 2006; Revised 11 February 2007; Accepted 23 April 2007 Recommended by Roger Woods The design of increasingly complex and concurrent multimedia systems requires a description at a higher abstraction level. Using an appropriate model of computation helps to reason about the system and enables design time analysis methods. The nature of multimedia processing matches in many cases well with cyclo-static dataflow (CSDF), making it a suitable model. However, channels in an implementation often use for cost reasons a kind of shared buffer that cannot be directly described in CSDF. This paper shows how such implementation specific aspects can be expressed in CSDF without the need for extensions. Consequently, the CSDF graph remains completely analyzable and allows reasoning about its temporal behavior. The obtained relation between model and implementation enables a buffer capacity analysis on the model while assuring the throughput of the final implementation. The capabilities of the approach are demonstrated by analyzing the temporal behavior of an MPEG-4 video encoder with a CSDF graph. Copyright © 2007 Kristof Denolf et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

1.

INTRODUCTION

The increasing complexity and concurrency in digital multiprocessor systems used to build modern multimedia codecs or wireless communications require a design flow covering different abstract layers that evolve gradually towards a final, efficient implementation. Describing the system first at higher level of abstraction, using a model of computation (MoC), permits the designer to model and reason about the system. Dataflow MoCs have proven to be useful for describing multimedia processing applications [1] as they enable a natural visual representation exposing the parallelism and allowing an evaluation of the temporal behavior. Cyclo-static dataflow (CSDF) [2] is particularly interesting because this variant is one of the most expressive dataflow models while still being fully analyzable at design time (e.g., consistency checks, dead-lock analysis). An implementation on a multiprocessor platform has optimized communication channels,