SuperLectures.com

SCHEDULING OF CAL ACTOR NETWORKS BASED ON DYNAMIC CODE ANALYSIS

Parallel Software Implementation of DSP Algorithms

Full Paper at IEEE Xplore

Presented by: Jani Boutellier, Author(s): Jani Boutellier, University of Oulu, Finland; Mickaël Raulet, INSA Rennes, France; Olli Silvén, University of Oulu, Finland

CAL is a dataflow oriented language for writing high-level specifications of signal processing applications. The language has recently been standardized and selected for the new MPEG Reconfigurable Video Coding standard. Application specifications written in CAL can be transformed into executable implementations through development tools. Unfortunately, the present tools provide no way to schedule the CAL entities efficiently at run-time. This paper proposes an automated approach to analyze specifications written in CAL, and produce run-time schedules that perform on average 1.45x faster than implementations relying on default scheduling. The approach is based on quasi-static scheduling, which reduces conditional execution in the run-time system.

  Speech Transcript

|

  Slides

Enlarge the slide | Show all slides in a pop-up window

0:00:16

  1. slide

0:00:41

  2. slide

0:01:41

  3. slide

0:02:12

  4. slide

0:02:44

  5. slide

0:03:30

  6. slide

0:03:53

  7. slide

0:04:35

  8. slide

0:05:31

  9. slide

0:05:57

 10. slide

0:07:34

 11. slide

0:08:27

 12. slide

0:09:14

    12. slide

0:09:35

 13. slide

0:10:19

 14. slide

0:10:42

 15. slide

0:11:09

 16. slide

0:12:08

 17. slide

0:13:05

 18. slide

0:13:39

 19. slide

0:13:56

 20. slide

0:14:59

 21. slide

  Comments

Please sign in to post your comment!

  Lecture Information

Recorded: 2011-05-27 16:55 - 17:15, Club H
Added: 21. 6. 2011 19:23
Number of views: 16
Video resolution: 1024x576 px, 512x288 px
Video length: 0:17:42
Audio track: MP3 [5.97 MB], 0:17:42