Πρωτότυπος Αλγόριθμος Επίλυσης του Προβλήματος της Τοποθέτησης σε Επαναδιαμορφούμενες Αρχιτεκτονικές Τριών  Διαστάσεων με χρήση Αλγορίθμων Αποικιών Μυρμηγκιών

Δανασής, Παναγιώτης; Danassis, Panagiotis

dc.contributor.author	Δανασής, Παναγιώτης	el
dc.contributor.author	Danassis, Panagiotis	en
dc.date.accessioned	2015-07-16T11:16:34Z
dc.date.available	2016-07-16T02:00:21Z
dc.date.issued	2015-07-16
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/40986
dc.identifier.uri	http://dx.doi.org/10.26240/heal.ntua.10481
dc.rights	Αναφορά Δημιουργού - Μη Εμπορική Χρήση - Παρόμοια Διανομή 3.0 Ελλάδα	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-sa/3.0/gr/	*
dc.subject	Επαναδιαμορφούμενες αρχιτεκτονικές	el
dc.subject	Πρόβλημα της τοποθέτησης	el
dc.subject	Εργαλεία σχεδίασης με χρήση υπολογιστή	el
dc.subject	Αλγόριθμοι αποικιών μυρμηγκιών	el
dc.subject	Τρισδιάστατες αρχιτεκτονικές	el
dc.subject	FPGA	en
dc.subject	CAD	en
dc.subject	Placement	en
dc.subject	Ant colony optimization	en
dc.subject	Three dimensional reconfigurable architectures	en
dc.title	Πρωτότυπος Αλγόριθμος Επίλυσης του Προβλήματος της Τοποθέτησης σε Επαναδιαμορφούμενες Αρχιτεκτονικές Τριών Διαστάσεων με χρήση Αλγορίθμων Αποικιών Μυρμηγκιών	el
dc.title	A Novel 3-D FPGA Placement Algorithm based on Ant Colony Optimization	en
heal.type	bachelorThesis
heal.classification	Ενσωματωμένα συστήματα	el
heal.classification	Embedded systems	en
heal.language	en
heal.access	free	el
heal.recordProvider	ntua	el
heal.publicationDate	2015-06-11
heal.abstract	Placement is considered one of the most arduous and time-consuming processes in physical implementation flows for reconfigurable architectures, while it highly affects the quality of derived application implementation as it has impact on the maximum operating frequency. This problem becomes more acute for three-dimensional (3-D) architectures, because the complexity of these architectures imposes additional challenges that have to be sufficiently addressed. Throughout this thesis we introduced a novel placement algorithm, targeting 3-D reconfigurable architectures, based on Ant Colony Metaheuristics. Ant colonies are distributed systems that, in spite of the simplicity of their individuals, present a highly structured social organization and as a result can accomplish complex tasks using the collective intelligence of the group. One of the most successful examples of ant based algorithms is known as Ant Colony Optimization (ACO). ACO is inspired by the foraging behavior of ants. Our proposed algorithm incorporates concepts from both MAX-MIN Ant System and Ant Colony System, the two best performing algorithms of the ACO family. It exhibits numerous advantages, such as inherent parallelism, direct enforcement of legality constrains into the cost function and support of heterogeneous architectures. Experimental results validate the effectiveness of our algorithm since it achieves on average 10% reduction on the critical path delay. This results to designs with increased maximum operating frequency and reduced power consumption. Additionally our placer can achieve speedup in multi-core architectures very close to the theoretical one. This means that our proposed algorithm can take full advantage of todays multi-core CPUs, further decreasing the execution run-time.	en
heal.advisorName	Σούντρης, Δημήτριος	el
heal.committeeMemberName	Σούντρης, Δημήτριος	el
heal.committeeMemberName	Πεκμεστζή, Κιαμάλ	el
heal.committeeMemberName	Οικονομάκος, Γιώργος	el
heal.academicPublisher	Εθνικό Μετσόβιο Πολυτεχνείο. Σχολή Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών. Τομέας Τεχνολογίας Πληροφορικής και Υπολογιστών	el
heal.academicPublisherID	ntua
heal.numberOfPages	130 σ.
heal.fullTextAvailability	true