On Search-Space Restriction for Design Space Exploration of Multi-/Many-Core Systems

DSpace Repositorium (Manakin basiert)

Zur Kurzanzeige

dc.contributor.author Richthammer, Valentina
dc.contributor.author Glaß, Michael
dc.date.accessioned 2018-09-20T13:09:29Z
dc.date.available 2018-09-20T13:09:29Z
dc.date.issued 2018-03-13
dc.identifier.isbn 978-3-00-059317-8
dc.identifier.other 511161298
dc.identifier.uri http://hdl.handle.net/10900/84285
dc.identifier.uri http://nbn-resolving.de/urn:nbn:de:bsz:21-dspace-842855 de_DE
dc.identifier.uri http://dx.doi.org/10.15496/publikation-25675
dc.description.abstract Design Space Exploration (DSE) for embedded system design with its multi-objective nature and large search spaces typically prohibits exhaustive search and popularized the use of metaheuristic optimization techniques. Recent large-scale multi- and especially many-core architectures offering a multitude of application mapping possibilities create tremendously large search spaces which give rise to the question whether established metaheuristics are still efficient. In this work, we propose to employ a heuristic search-space restriction (SSR) approach based on the exploration of subsystems, which significantly reduces individual search-space size and, thus, exploration time. Knowing that this kind of restriction may miss global optima, we also investigate the use of high-quality solutions derived from subsystems as an initial population for the optimization of the complete system. Experimental results for tiled 8x8 to 24x24 many-core architectures and several benchmark applications show that the proposed SSR enables the metaheuristic to derive implementations of higher quality in a significantly reduced exploration time. Although not all global optima are exposed to the restricted problem, this work gives evidence that too complex search spaces may sacrifice the efficiency of metaheuristics drastically and, thus, serves as a motivation for future research into SSR or splitting techniques for DSE. en
dc.language.iso en de_DE
dc.publisher Universität Tübingen de_DE
dc.rights ubt-podno de_DE
dc.rights.uri http://tobias-lib.uni-tuebingen.de/doku/lic_ohne_pod.php?la=de de_DE
dc.rights.uri http://tobias-lib.uni-tuebingen.de/doku/lic_ohne_pod.php?la=en en
dc.subject.classification Explorative Suche de_DE
dc.subject.ddc 004 de_DE
dc.subject.other design space exploration en
dc.subject.other multi-/many-core systems en
dc.subject.other metaheuristic optimization en
dc.subject.other search-space restriction en
dc.subject.other search-space splitting en
dc.subject.other system-level design en
dc.subject.other evolutionary algorithms en
dc.title On Search-Space Restriction for Design Space Exploration of Multi-/Many-Core Systems en
dc.type ConferencePaper de_DE
utue.publikation.fachbereich Informatik de_DE
utue.publikation.fakultaet 7 Mathematisch-Naturwissenschaftliche Fakultät de_DE
utue.opus.portal mbmv2018 de_DE
utue.publikation.reiheohneschema MBMV 2018 de_DE

Dateien:

Das Dokument erscheint in:

Zur Kurzanzeige