Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Adaptation of Legacy Codes to Context-Aware Composition using Aspect-Oriented Programming for Data Representation Conversion
Linnaeus University, Faculty of Engineering and Technology, Department of Computer Science.
2013 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

    Different computation problem domains such as sorting, matrix multiplication, etc. usually require different data representations and algorithms variants implementations in order to be adapted and re-designed to context-aware composition (CAC). Context-aware composition is a technique for the design of applications that can adapt its behavior according to changes in the program. We considered two application domains: matrix multiplication and graph algorithms (DFS algorithm in particular). The main problem in the implementation of the representation mechanisms applied in these problem domains is time spent on the data representation conversion that in the end should not influence the application performance.  

     This thesis work presents a flexible aspect-based architecture that includes the data structure representation adaptation in order to reduce implementation efforts required for adaptation different application domains.

     Although, manual approach has small overhead 4-10% for different problems compared to the AOP-based approach, experiments show that the manual adaptation to CAC requires on average three times more programming effort in terms of lines of code than AOP-based approach. Moreover, the AOP-based approach showed the average speed-up over baseline algorithms that use standard data structures of 2.1.

Place, publisher, year, edition, pages
2013. , 40 p.
Keyword [en]
aspect-oriented programing, context-aware composition, matrix multiplication, graph algorithm, data representation
National Category
Software Engineering
Identifiers
URN: urn:nbn:se:lnu:diva-25321OAI: oai:DiVA.org:lnu-25321DiVA: diva2:616246
Subject / course
Computer Science
Educational program
Software Technology Programme, Master Programme, 120 credits
Uppsok
Physics, Chemistry, Mathematics
Supervisors
Examiners
Available from: 2013-04-16 Created: 2013-04-15 Last updated: 2013-04-16Bibliographically approved

Open Access in DiVA

MasterThesis(1185 kB)169 downloads
File information
File name FULLTEXT01.pdfFile size 1185 kBChecksum SHA-512
b417db7b8f804dcb0ff3443e07e742b64bdecc791b0e74247fe4399c25ebbdd71443c8b0c8c1c5511f1244e83f537423380201e99fece2fef6b56e8e371dedff
Type fulltextMimetype application/pdf

By organisation
Department of Computer Science
Software Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 169 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 151 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf