University of Twente Student Theses
Evaluating data structures for runtime storage of aspect instances
Loker, Andre (2014) Evaluating data structures for runtime storage of aspect instances.
|
PDF
3MB |
| Abstract: | In aspect-oriented execution-environments, aspect instances represent the state that is shared between multiple invocations of advice. Instantiation policies are responsible for retrieving the correct aspect instance for a specific execution of advice. Because this retrieval potentially happens many times during the execution of a program, it should be fast. The choice of data structures used to store aspect instances at runtime affects the execution speed of aspect-instance look-up and the memory footprint of the application. In this thesis, we evaluate different data structures for use as storage for aspect instances with respect to look-up speed and memory usage. Based on a benchmark, we suggest a two-level approach to implement aspect-instance storage: on a baseline level, data structures such as arrays, hash tables and prefix trees provide a widely applicable, but still fast solution, while on a second level, highly specialised data structures and access algorithms allow for even faster retrieval in certain special cases. |
| Item Type: | Essay (Master) |
| Faculty: | EEMCS: Electrical Engineering, Mathematics and Computer Science |
| Subject: | 54 computer science |
| Programme: | Computer Science MSc (60300) |
| Link to this item: | https://purl.utwente.nl/essays/66345 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page