This article has multiple issues. Please help or discuss these issues on the talk page. (Learn how and when to remove these template messages)
This article is an orphan, as no other articles . Please introduce links to this page from ; try the Find link tool for suggestions. (February 2013)
A major contributor to this article appears to have a close connection with its subject. It may require cleanup to comply with Wikipedia's content policies, particularly neutral point of view. Please discuss further on the talk page.(March 2011) (Learn how and when to remove this template message)
The topic of this article may not meet Wikipedia's notability guidelines for products and services. Please help to demonstrate the notability of the topic by citing reliable secondary sources that are independent of the topic and provide significant coverage of it beyond a mere trivial mention. If notability cannot be shown, the article is likely to be merged, redirected, or deleted. Find sources: – ···scholar·JSTOR(March 2011) (Learn how and when to remove this template message)
This article needs additional citations for verification. Please help by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: – ···scholar·JSTOR(March 2011) (Learn how and when to remove this template message)
(Learn how and when to remove this template message)
The PREESM tool inputs are an algorithm graph, an architecture graph, and a scenario which is a set of parameters and constraints that specify the conditions under which the deployment will run. The chosen type of algorithm graph is a hierarchical extension of Synchronous Dataflow (SDF) graphs named Interface-Based hierarchical Synchronous Dataflow (IBSDF). The architecture graph is named System-Level Architecture Model (S-LAM). From these inputs, PREESM maps and schedules automatically the code over the multiple processing elements and generates multi-core code.
Documentation[]
Online documentation is provided in the PREESM Website.