The Community for Technology Leaders
Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques (2007)
Brasov, Romania
Sept. 15, 2007 to Sept. 19, 2007
ISSN: 1089-795X
ISBN: 0-7695-2944-5
pp: 421
L. Papadopoulos , Democritus University of Thrace, Greece
C. Baloukas , Democritus University of Thrace, Greece
N. Voros , Intracom Telecom Solutions, Greece
K. Potamianos , Intracom Telecom Solutions, Greece
D. Soudris , Democritus University of Thrace, Greece
The modern applications to be implemented in portable devices usually contain complex dynamic data structures. The selection of the dynamic data type (DDT) combination of the application affects the performance and the energy consumption of the memory subsystem. Thus, DDT exploration is used to perform trade-offs between design factors, such as performance and energy consumption. The above trade-offs should be taken into account, when designing the application. Choosing an improper DDT, may have negative impact at the total amount of memory needed to execute the program. Also, it affects the number of total memory accesses, thus taking up valuable resources from the embedded device that can cause performance issues and high energy consumption. Therefore, a systematic exploration that assists the designer to select the optimal data structure implementation for each application given the design constraints is needed. This optimization process is called DDT exploration and is an important part of the tools used to perform efficient Dynamic Memory Management [1] and optimal memory assignment and memory access scheduling. The size of the DDT affects the amount of data transferred, using DMA/DNA, through the interconnect resources and in between the memory hierarchy [4].
L. Papadopoulos, C. Baloukas, N. Voros, K. Potamianos, D. Soudris, "Data Structure Exploration of Dynamic Applications", Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques, vol. 00, no. , pp. 421, 2007, doi:10.1109/PACT.2007.24
93 ms
(Ver 3.3 (11022016))