Skip to content

Commit 6ccd211

Browse files
author
Antoine Morvan
committed
Remove .exe
1 parent cc363c9 commit 6ccd211

File tree

3 files changed

+14
-8
lines changed

3 files changed

+14
-8
lines changed

_tutos/03-mpsoccodegen.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -22,6 +22,8 @@ Prerequisite:
2222
In addition to the default requirements (see [Requirements for Running Tutorial Generated Code](/tutos/intro/#requirements-for-running-tutorial-generated-code)), download the following files:
2323

2424
* Complete [Sobel Preesm Project](/assets/tutos/parasobel/tutorial1_result.zip)
25+
* [YUV Sequence (7zip)](/assets/downloads/akiyo_cif.7z) (9 MB)
26+
* [DejaVu TTF Font](/assets/downloads/DejaVuSans.ttf) (757KB)
2527
* A [TMS320C6678 Evaluation Module (EVM)](http://www.ti.com/tool/tmdsevm6678)
2628
* [Code Composer Studio (CCS)](http://processors.wiki.ti.com/index.php/Download_CCS) v5.2.1 with [MCSDK 2.x](http://preesm.insa-rennes.fr/website/index.php?id=ccs-setup)
2729

_tutos/04-softwarepipeline.md

Lines changed: 12 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -10,22 +10,26 @@ The following topics are covered in this tutorial:
1010

1111
* Software Pipelining of an Application for Throughput Optimization
1212

13-
Prerequisite: [Tutorial Introduction](index.php?id=tutorial-introduction), [Parallelize an Application on a Multicore CPU](index.php?id=parallelize-an-application-on-a-multicore-cpu)
13+
Prerequisite:
14+
* [Tutorial Introduction](/tutos/intro)
15+
* [Parallelize an Application on a Multicore CPU](/tutos/parasobel)
1416

1517

1618
###### Tutorial created the 10.14.2013 by [K. Desnos](mailto:kdesnos@insa-rennes.fr)
1719

18-
1\. Project setup
19-
-----------------
20+
## Project setup
2021

21-
The starting point of this tutorial is the Preesm project obtained as a result of the [Parallelize an Application on a Multicore CPU](index.php?id=parallelize-an-application-on-a-multicore-cpu) tutorial. The project resulting from this tutorial is available [\[here\]](data/uploads/tutorial_zips/tutorial1_result.zip). The external libraries, the YUV sequence and the generated C code are not included in this archive. Explanation on how to setup these external elements, compile and run the project are available [\[here\]](index.php?id=parallelize-an-application-on-a-multicore-cpu).
22+
In addition to the default requirements (see [Requirements for Running Tutorial Generated Code](/tutos/intro/#requirements-for-running-tutorial-generated-code)), download the following files:
2223

23-
2\. Software Pipelining of an Application
24-
-----------------------------------------
24+
* Complete [Sobel Preesm Project](/assets/tutos/parasobel/tutorial1_result.zip)
25+
* [YUV Sequence (7zip)](/assets/downloads/akiyo_cif.7z) (9 MB)
26+
* [DejaVu TTF Font](/assets/downloads/DejaVuSans.ttf) (757KB)
2527

26-
#### 2.1. What is the software pipelining?
28+
## Software Pipelining of an Application
2729

28-
Software pipelining (also called blocking or block scheduling) is a popular technique used to increase the throughput of an application. The throughput of an application is usually limited by the latency of its critical path. In Synchronous Dataflow (SDF) graphs, the critical path is the chain of actors whose sum of actor execution times is the largest. In the Sobel application, the critical path is composed of the following actors: (read\_YUV)-(Split)-(Sobel\_x)-(Merge)-(display). The basic idea behind the software pipelining technique is to break the critical path into shortest parts by introducing "delays" in the path. The introduction of delays relaxes the dependency constraints between actors and makes possible the concurrent execution of the different stages of the pipelined critical path. More information on software pipelining can be found in [\[1\]](#ref).
30+
### What is Software Pipelining?
31+
32+
Software pipelining (also called blocking or block scheduling) is a popular technique used to increase the throughput of an application. The throughput of an application is usually limited by the latency of its critical path. In Synchronous Dataflow (SDF) graphs, the critical path is the chain of actors whose sum of actor execution times is the largest. In the Sobel application, the critical path is composed of the following actors: ```(read_YUV)-(Split)-(Sobel_x)-(Merge)-(display)```. The basic idea behind the software pipelining technique is to break the critical path into shortest parts by introducing "delays" in the path. The introduction of delays relaxes the dependency constraints between actors and makes possible the concurrent execution of the different stages of the pipelined critical path. More information on software pipelining can be found in [\[1\]](#references).
2933

3034
[![](/assets/tutos/softwarepipeline/sobel_pipelining.png)](/assets/tutos/softwarepipeline/sobel_pipelining.png)
3135

assets/downloads/yuv2dat.exe

-127 KB
Binary file not shown.

0 commit comments

Comments
 (0)