Dynamic Data Type Refinement Methodology

HTML
DOWNLOAD

Μέγεθος: px

Εμφάνιση ξεκινά από τη σελίδα:

Download "Dynamic Data Type Refinement Methodology"

Ἀλέξανδρος Αργυρις Πυλαρινός
8 χρόνια πριν
Προβολές:

1 School of Electrical and Computer Engineering N.T.U.A. Embedded System Design Lazaros Papadopoulos Dynamic Data Type Refinement Methodology

2 Άδεια Χρήσης Το παρόν εκπαιδευτικό υλικό υπόκειται σε άδειες χρήσης Creative Commons. Για εκπαιδευτικό υλικό, όπως εικόνες, που υπόκειται σε άδεια χρήσης άλλου τύπου, αυτή πρέπει να αναφέρεται ρητώς.

3 Overview Dynamic applications DDTR Implementation in various application domains DDTR extensions

4 Dynamic behavior of network and multimedia applications MM WL Dynamic applications: Increased interaction with the environment Sensitivity in user input The number of data accesses is unknown The timing of data accesses is unknown 3

5 Dynamic applications Network algorithms Games Databases Streaming

6 Dynamic Data Structures Dynamic applications organize the data in dynamic data structures. The application performs requests of data insertion or removal during the execution. The selected data structure affects the memory footprint and the memory accesses needed to satisfy the application's requests. A single layer data structure: Singly Linked List of 100 nodes A multi-layer data structure: Single Linked List of Arrays of 100 nodes Record Record Record

7 A simple motivational Example Dynamic array vs. single linked list

8 Power consumption in mobile devices

9 Library Design // Dynamic Application: We designed a library of more than 20 dynamic data structures that monitors the memory accesses and memory footprint. The interface of the library is plugged in the application. Operations such as insert and remove are performed via the data structure of the library. DDT Library Selected DDTs: SLL DLL... // Original DDT Declarations: // std:: vector<packet> ddt1; // std:: vector<node> ddt1; // Library DDT Declarations // replace the original: SingleLinkedList<Packet> ddt1 DoubleLinkedList<Node> ddt2 function() { // insert is performed through the library: ddt1.insert() } // delete is performed through the library: ddt2. Remove() Energy Mem. Accesses Energy Mem. Footprint Mem. Footprint Mem. Accesses LEGEND: Library Input Output LOGFILE Memory accesses Memory footprint Design Constraints DDT Library Pareto Point Analysis 8

10 Optimizing dynamic applications INPUT: Application source code Dynamic Data Type Exploration Plug DDT Library Interface to the application s source code DDT Exploration for dynamic access behavior Record Record Record INPUT: Design Constraints Pareto Optimal Exploration Execution Time vs. Energy Memory Accesses vs. Memory Footprint... Execution Time (Normalized) Pareto Curve execution time vs. energy consumption Optimized Application Energy (mj) 500 Pareto Curve mem. accesses vs. mem. footprint Memory Accesses 8.0e7 6.0e7 4.0e7 2.0e Memory Footprint

Supported New DDT library Supported Extended (Sorted Lists, Trees, Sets, and more) Easy (due to the object oriented design of

11 Matisse and new DDT library Comparison Feature Absract Data Type (ADT) DDT Implementations provided Extension of the DDT Library Combination of DDTs in more complex ones Matisse profiling tool Not supported Limited (Unsorted Lists only) Not easy Supported New DDT library Supported Extended (Sorted Lists, Trees, Sets, and more) Easy (due to the object oriented design of the Library) Supported, but easier (due to the object oriented design of the Library) Interface No STL compliant STL compliant 10

Experimental Results: A 2D Strategy Game 100000 80000 2D Strategy Game Pareto curve

12 Experimental Results: A 2D Strategy Game D Strategy Game Pareto curve SLL(R) Memory Accesses SLL(P) ARR Memory Footprint (KB)

13 Experimental Results: A 3D Game 2.E+06 2.E+06 3D Racing Game Pareto curve SLL(P) Memory Accesses 1.E+06 8.E+05 4.E+05 SLL ARR 0.E Memory Footprint (MB)

14 DDTR extensions Runtime data structure adaptivity. Data structure efficiency is not affected only by the application access pattern, but also by the system hardware specifications, e.g. the cache. DDTR in multicore architectures. Other extensions

15 DDTR in multicore architectures

16 DDTR in multicore architectures

18 DDTR Adaptive approach Methodology Runtime Manager Input: Jobs: Pareto Points Overheads Decides when to move to a new Pareto point taking into account: DDT characteristics Application demands System demands Overhead

19 Overheads of the Adaptive approach Design time exploration (usually takes less than 1min) Code size of runtime manager (about 1KB) Performance overhead (is configurable and usually trivial since every time consuming calculation takes place at design time) Overheads of mode changes: performance and memory footprint (can be configured by the designer)

20 Other extensions: DDTR in other programming languages Python list data structure is implemented as dynamic arrays. Python deque data structure is implemented as a list of arrays. typedef struct { PyObject_HEAD Py_ssize_t ob_size; /* Vector of pointers to list elements. list[0] is ob_item[0], etc. */ PyObject **ob_item; /* ob_item contains space for 'allocated' elements. The number * currently in use is ob_size. * Invariants: * 0 <= ob_size <= allocated * len(list) == ob_size * ob_item == NULL implies ob_size == allocated == 0 */ Py_ssize_t allocated; } PyListObject;

21 Χρηματοδότηση Το παρόν εκπαιδευτικό υλικό έχει αναπτυχθεί στα πλαίσια του εκπαιδευτικού έργου του διδάσκοντα. Το έργο «Ανοικτά Ακαδημαϊκά Μαθήματα» του ΕΜΠ έχει χρηματοδοτήσει μόνο την αναδιαμόρφωση του υλικού. Το έργο υλοποιείται στο πλαίσιο του Επιχειρησιακού Προγράμματος «Εκπαίδευση και Δια Βίου Μάθηση» και συγχρηματοδοτείται από την Ευρωπαϊκή Ένωση (Ευρωπαϊκό Κοινωνικό Ταμείο) και από εθνικούς πόρους.

Σχετικά έγγραφα

ΒΟΗΘΗΤΙΚΕΣ ΣΗΜΕΙΩΣΕΙΣ

Ε.Μ.Π. ΣΧΟΛΗ ΑΡΧΙΤΕΚΤΟΝΩΝ ΤΟΜΕΑΣ ΣΥΝΘΕΣΕΩΝ ΤΕΧΝΟΛΟΓΙΚΗΣ ΑΙΧΜΗΣ ΠΕΡΙΟΧΗ ΟΙΚΟΔΟΜΙΚΗΣ ntua ACADEMIC OPEN COURSES ΒΟΗΘΗΤΙΚΕΣ ΣΗΜΕΙΩΣΕΙΣ ΓΙΑ ΤΟ ΜΑΘΗΜΑ ΤΗΣ ΟΙΚΟΔΟΜΙΚΗΣ II Β. ΤΣΟΥΡΑΣ Επίκουρος Καθηγητής Άδεια