mdh.sePublications
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
GRAPH GENERATION ALGORITHMS FOR THE GRADE DECISION CANVAS
Mälardalen University, School of Innovation, Design and Engineering.
Mälardalen University, School of Innovation, Design and Engineering.
2018 (English)Independent thesis Basic level (degree of Bachelor), 12 HE creditsStudent thesis
Abstract [en]

Development in the field of software architecture, from the early days in the mid-80’s, has been significant. From purely technical descriptions to decision based architectural knowledge, software architecture has seen fundamental changes to its methodologies and techniques. Architectural knowledge is a resource that is managed and stored by companies, this resource is valuable because it can be reused and analysed to improve future development. Companies today are interested in the reasoning behind the software architecture. This reasoning is mainly formulated through the architectural decisions made during development. For architectural decisions to be easier to analyse they need to be stored in a way that enables use of common analytical tools so that comparisons between decisions are consistent and relevant. Additionally, it is also important to have enough data, which leads us to the problem that, preferably, all the individual architectural knowledge cases must be structured and stored. To do this we present a tool that uses graph generation algorithms to generate architectural knowledge as graphs based on an architectural decision canvas called GRADE. This enables multiple decision cases to be encoded through graphs that can be used to analyse relationships and balances between different architectural knowledge elements represented through nodes and edges within a graph.

Place, publisher, year, edition, pages
2018. , p. 32
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:mdh:diva-41200OAI: oai:DiVA.org:mdh-41200DiVA, id: diva2:1257364
Subject / course
Computer Science
Presentation
(English)
Supervisors
Examiners
Available from: 2018-10-19 Created: 2018-10-19 Last updated: 2018-10-19Bibliographically approved

Open Access in DiVA

fulltext(910 kB)45 downloads
File information
File name FULLTEXT01.pdfFile size 910 kBChecksum SHA-512
b583c6acc4e8f9f4a9882941d45345e26cba5bda2d9e7b97c39437b78054256a71efef2a0a326df27a7247591435d121a0c79041bc9ad858030eca4072fcab56
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Achrenius, WilliamBergman Törnkvist, Martin
By organisation
School of Innovation, Design and Engineering
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 45 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: 219 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