Hybrid algorithm for mapping static task graphs on multiprocessor SoCs

2005 International Symposium on System-on-Chip, Proceedings

Volumn 2005, Issue , 2005, Pages 146-150

  Orsila, Heikki ^a   Kangas, Tero ^a   Hämäläinen, Timo D ^a  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; GLOBAL OPTIMIZATION; GRAPH THEORY; MULTIPROCESSING SYSTEMS; SCHEDULING; SIMULATED ANNEALING;

FINE GRAINED OPTIMIZATION; STANDARD TASK GRAPH SET; STATIC ACYCLIC TASK; SYSTEM-ON-CHIP;

EMBEDDED SYSTEMS;

EID: 33847232246     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/issoc.2005.1595665     Document Type: Conference Paper

References (8)

1. Y.-K. Kwok and I. Abroad, Static scheduling algorithms for allocating directed task graphs to multiprocessors, ACM Comput. Surv., Vol. 31 No. 4, pp. 406-471, 1999.
2. T. Wild, W. Brunnbauer, J. Foag, and N. Pazos, Mapping and scheduling for architecture exploration of networking SoCs, Proc. 16th Int. Conference on VLSI Design. 2003.
3. F. Vahid, Partitioning sequential programs for CAD using a three-step approach, ACM Transactions on Design Automation of Electronic Systems, Vol. 7, No. 3, pp. 413-429, 2002.
4. T. Lei and S. Kumar, A two-step genetic algorithm for mapping task graphs to a network on chip architecture, Proceedings of the Euromicro Symposium on Digital System Design (DSD'03), 2003.
5. S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi, Optimization by simulated annealing, Science, Vol. 200, No. 4598, pp. 671-680, 1983.
6. D. D. Gajski, F. Vahid, S. Narayan, and J. Gong, Specification and design. of embedded systems. Pearsou Education, 1994.
7. I. Ahmad and Y.-K. Kwok, Analysis, evaluation, and comparison by algorithms for scheduling task graphs on parallel processors, Parallel Architectures, Algorithms, and Networks, 1996.
8. Standard task graph set, http://www.kasahara.elec.waseda.ac.jp/ schedule 2003.