Tabu Search for Partitioning Dynamic Dataflow Programs
Open Access
- 1 January 2016
- journal article
- Published by Elsevier BV in Procedia Computer Science
- Vol. 80, 1577-1588
- https://doi.org/10.1016/j.procs.2016.05.486
Abstract
No abstract availableThis publication has 25 references indexed in Scilit:
- An Ant Colony metaheuristic for energy aware application mapping on NoCsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2013
- Partitioning and mapping dynamic dataflow programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2012
- A survey of hard real-time scheduling for multiprocessor systemsACM Computing Surveys, 2011
- Graph partitioning by multi-objective real-valued metaheuristics: A comparative studyApplied Soft Computing, 2011
- Trace-based KPN composability analysis for mapping simultaneous applications to MPSoC platformsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- Utilizing synthesis methods in accurate system-level exploration of heterogeneous embedded systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Metaheuristics in combinatorial optimizationACM Computing Surveys, 2003
- Tabu Search—Part IINFORMS Journal on Computing, 1989
- Future paths for integer programming and links to artificial intelligenceComputers & Operations Research, 1986
- First version of a data flow procedure languagePublished by Springer Science and Business Media LLC ,1974