ACM Home Page
Please provide us with feedback. Feedback
Evolutionary algorithms for the mapping of pipelined applications onto heterogeneous embedded systems
Full text PdfPdf (573 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 11th Annual conference on Genetic and evolutionary computation table of contents
Montreal, Québec, Canada
SESSION: Track 13: real world application table of contents
Pages 1435-1442  
Year of Publication: 2009
ISBN:978-1-60558-325-9
Authors
Marco Branca  Politecnico di Milano, Milano, Italy
Lorenzo Camerini  Politecnico di Milano, Milano, Italy
Fabrizio Ferrandi  Politecnico di Milano, Milano, Italy
Pier Luca Lanzi  Politecnico di Milano, Milano, Italy
Christian Pilato  Politenico di Milano, Milano, Italy
Donatella Sciuto  Politecnico di Milano, Milano, Italy
Antonino Tumeo  Politecnico di Milano, Milano, Italy
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 16,   Downloads (12 Months): 41,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1569901.1570094
What is a DOI?

ABSTRACT

In this paper, we compare four algorithms for the mapping of pipelined applications on a heterogeneous multiprocessor platform implemented using Field Programmable Gate Arrays (FPGAs) with customizable processors. Initially, we describe the framework and the model of pipelined application we adopted. Then, we focus on the problem of mapping a set of pipelined applications onto a heterogeneous multiprocessor platform and consider four search algorithms: Tabu Search, Simulated Annealing, Genetic Algorithms, and the Bayesian Optimization Algorithm. We compare the performance of these four algorithms on a set of synthetic problems and on two real-world applications (the JPEG image encoding and the ADPCM sound encoding). Our results show that on our framework the Bayesian Optimization Algorithm outperforms all the other three methods for the mapping of pipelined applications.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
S. Banerjee, T. Hamada, P.M. Chau, and R.D. Fellman. Macro pipelining based scheduling on high performance heterogeneous multiprocessor systems. IEEE Transactions on Signal Processing, 43(6):1468--1484, June 1995.
 
2
 
3
4
 
5
P. Eles, Z. Peng, K. Kuchcinski, and A. Doboli. System level hardware/software partitioning based on simulated annealing and tabu search. Design Automation for Embedded Systems, 2:5--32, 1997.
 
6
 
7
 
8
9
10
11
 
12
 
13
S. Kirkpatrick, C. Gelatt, and M. Vecchi. Optimization by simulated annealing. Science, 220(4598):671--680, 1983. http://www.jstor.org/stable/1690046 Retrieved on 16 January 2009.
14
 
15
 
16
M. Pelikan. Bayesian optimization algorithm with decision graphs in c++, version 1.1, 2000.
 
17
M. Pelikan. Hierarchical Bayesian optimization algorithm: Toward a new generation of evolutionary algorithm. Springer Verlag, Berlin, 2005.
 
18
19
 
20
G. Wang, W. Gong, B. DeRenzi, and R. Kastner. Application partitioning on programmable platforms using the ant colony optimization. Journal of Embedded Computing, 1(12):1--18, 2005.
 
21
22

Collaborative Colleagues:
Marco Branca: colleagues
Lorenzo Camerini: colleagues
Fabrizio Ferrandi: colleagues
Pier Luca Lanzi: colleagues
Christian Pilato: colleagues
Donatella Sciuto: colleagues
Antonino Tumeo: colleagues