Automated exploration of pareto-optimal configurations in parameterized dynamic memory allocation for embedded systems

Mamagkakis, S; Atienza, D; Poucet, C; Catthoor, F; Soudris, D; Mendias, J

dc.contributor.author	Mamagkakis, S	en
dc.contributor.author	Atienza, D	en
dc.contributor.author	Poucet, C	en
dc.contributor.author	Catthoor, F	en
dc.contributor.author	Soudris, D	en
dc.contributor.author	Mendias, J	en
dc.date.accessioned	2014-03-01T02:43:57Z
dc.date.available	2014-03-01T02:43:57Z
dc.date.issued	2006	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/31573
dc.subject	Case Study	en
dc.subject	Data Storage	en
dc.subject	Dynamic Memory Allocation	en
dc.subject	Embedded System	en
dc.subject	pareto optimality	en
dc.title	Automated exploration of pareto-optimal configurations in parameterized dynamic memory allocation for embedded systems	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1145/1131727	en
heal.identifier.secondary	http://dx.doi.org/10.1145/1131727	en
heal.publicationDate	2006	en
heal.abstract	New applications in embedded systems are becoming increasingly dynamic. In addition to increased dynamism, they have massive data storage needs. Therefore, they rely heavily on dynamic, run-time memory allocation. The design and configuration of a dynamic memory allocation subsystem requires a big design effort, without always achieving the desired results. In this paper, we propose a fully automated exploration of	en
heal.journalName	Design, Automation, and Test in Europe	en
dc.identifier.doi	10.1145/1131727	en