1997
DOI: 10.1023/a:1008832202436
|View full text |Cite
|
Sign up to set email alerts
|

Untitled

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

2004
2004
2023
2023

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 121 publications
(4 citation statements)
references
References 14 publications
0
4
0
Order By: Relevance
“…24 Much work is done in the closely related field of hardware/software partitioning. 25 Models in this field better reflect hardware properties, 26 but usually do not differentiate between software units for example, in terms of parallelizability. In order to reduce the development time of hardware-accelerated software systems, there are various efforts to anticipate the expected gain through hardware accelerators using only a high-level software description.…”
Section: State Of the Artmentioning
confidence: 99%
“…24 Much work is done in the closely related field of hardware/software partitioning. 25 Models in this field better reflect hardware properties, 26 but usually do not differentiate between software units for example, in terms of parallelizability. In order to reduce the development time of hardware-accelerated software systems, there are various efforts to anticipate the expected gain through hardware accelerators using only a high-level software description.…”
Section: State Of the Artmentioning
confidence: 99%
“…Another design-time approach to solve the mapping problem is mathematical programming, where the requirements are transformed into mathematical inequalities. After that, by utilizing different mathematical programming solutions including mixed integer linear programming (MILP) [40], Branch and bound [41], constraint programming (CP) [42], and integer linear programming (ILP) [43], the inequalities are solved. In the mathematical programming approach, the optimal solution is always guaranteed as long as the complexity of the mapping problem does not become NP.…”
Section: Mapping Techniquesmentioning
confidence: 99%
“…There are several works regarding the static mapping problem comprising various optimization objectives that have utilized the ILP method. For instance, [40,43,54,55] have studied the design-time mapping problem in homogeneous multi-core architecture using the ILP method while optimizing their solutions considering performance, energy consumption, and temperature as the optimization parameters. Authors in [56] utilized the same method to solve mapping for a heterogeneous architecture, including different optimization goals such as execution time, reliability, and temperature.…”
Section: Optimization Parameters In Mappingmentioning
confidence: 99%
“…Such search strategies can be based on exact, but typically unscalable, methods that guarantee finding the optimal solution(s). These exact methods can, for example, be implemented using integer linear programming (ILP) solutions (e.g., References [6,7]) or branch & bound algorithms (e.g., Reference [8]). Alternatively, so-called meta-heurisics, such as genetic algorithms (GA) or simulated annealing, can be used to search the design space for optimal solutions.…”
mentioning
confidence: 99%