Data Structure Exploration of Dynamic Applications
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. Therefore, a systematic exploration t...
Saved in:
Published in: | 16th International Conference on Parallel Architecture and Compilation Techniques (PACT 2007) p. 421 |
---|---|
Main Authors: | , , , , |
Format: | Conference Proceeding |
Language: | English |
Published: |
IEEE
01-09-2007
|
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | 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. 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 and optimal memory assignment and memory access scheduling. In this paper, we introduce a DDT exploration methodology based on a new DDT Library tool. Using the new DDT Library, the exploration methodology is enchanted and can be applied in a wide range of application domains. |
---|---|
Bibliography: | SourceType-Conference Papers & Proceedings-1 ObjectType-Conference Paper-1 content type line 25 |
ISBN: | 0769529445 9780769529448 |
ISSN: | 1089-795X 2641-7944 |
DOI: | 10.1109/PACT.2007.4336249 |