SuperLectures.com

SCHEDULING OF CAL ACTOR NETWORKS BASED ON DYNAMIC CODE ANALYSIS

Full Paper at IEEE Xplore

Parallel Software Implementation of DSP Algorithms

Přednášející: Jani Boutellier, Autoři: 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.

  Přepis řeči

|

  Slajdy

Zvětšit slajd | Zobrazit všechny slajdy

0:00:16

  1. slajd

0:00:41

  2. slajd

0:01:41

  3. slajd

0:02:12

  4. slajd

0:02:44

  5. slajd

0:03:30

  6. slajd

0:03:53

  7. slajd

0:04:35

  8. slajd

0:05:31

  9. slajd

0:05:57

 10. slajd

0:07:34

 11. slajd

0:08:27

 12. slajd

0:09:14

    12. slajd

0:09:35

 13. slajd

0:10:19

 14. slajd

0:10:42

 15. slajd

0:11:09

 16. slajd

0:12:08

 17. slajd

0:13:05

 18. slajd

0:13:39

 19. slajd

0:13:56

 20. slajd

0:14:59

 21. slajd

  Komentáře

Please sign in to post your comment!

  Informace o přednášce

Nahráno: 2011-05-27 16:55 - 17:15, Club H
Přidáno: 21. 6. 2011 19:23
Počet zhlédnutí: 16
Rozlišení videa: 1024x576 px, 512x288 px
Délka videa: 0:17:42
Audio stopa: MP3 [5.97 MB], 0:17:42