Dissertation/ Thesis
Preserving the Mental Map when Visualizing Dynamic Graphs : An Approach for Intermediate Representations in the C2 Java Compiler ; Bevarande av den mentala kartan vid visualisering av dynamiska grafer : Ett tillvägagångssätt för mellanrepresentationer i C2 Java-kompilatorn
| Τίτλος: | Preserving the Mental Map when Visualizing Dynamic Graphs : An Approach for Intermediate Representations in the C2 Java Compiler ; Bevarande av den mentala kartan vid visualisering av dynamiska grafer : Ett tillvägagångssätt för mellanrepresentationer i C2 Java-kompilatorn |
|---|---|
| Συγγραφείς: | Yin, Emmy |
| Στοιχεία εκδότη: | KTH, Skolan för elektroteknik och datavetenskap (EECS) |
| Έτος έκδοσης: | 2023 |
| Συλλογή: | Royal Inst. of Technology, Stockholm (KTH): Publication Database DiVA |
| Θεματικοί όροι: | Dynamic Graphs, Graph Layout Algorithms, Visualization, Hierarchical Graph Layouts, Dynamiska grafer, grafritningsalgoritmer, visualisering, hierarkiska grafritningar, Computer and Information Sciences, Data- och informationsvetenskap |
| Περιγραφή: | Graphs are powerful data structures that are widely used to represent complex forms of information. One area in which graphs are successfully being used is within compiler engineering, where a program under compilation can be represented as a graph that changes as the program is being compiled. These graphs, known as Intermediate Representation graphs, can be visualized to aid compiler engineers in understanding and debugging the compiler. However, graphs that change over time need to be visualized so that the viewer’s internal understanding of the graph is maintained. Simultaneously, the graph layouts should be of high quality. These criteria can be conflicting, making the visualization of changing graphs difficult. In this thesis, a dynamic graph layout algorithm to visualize dynamic Intermediate Representation graphs used in the C2 compiler in the Java HotSpotTM Virtual Machine was developed and evaluated. Currently, these graphs are visualized with hierarchical layouts, using a static graph layout algorithm. Five metrics were developed and used to evaluate the layouts by the dynamic algorithm against the layouts by the static algorithm. Four of these were concerned with the layout quality, by measuring the number of edge crossings, number of reversed edges, average degree of the edge bends and the average edge length. The fifth metric was related to mental map preservation and measures the Euclidean distance of node displacement across two layouts. Two experiments were conducted to compare the algorithms. The first experiment measured the layouts drawn by the algorithms when there were a couple of nodes added to or removed from a graph iteratively. A total of 1061 layouts were measured. In 74% of these, the dynamic algorithm caused less node displacement. The second experiment aimed to evaluate the algorithms against what is possible to achieve in regards of minimum node displacement while maintaining a high quality. The results of both experiments indicate that the dynamic layout algorithm yields layouts ... |
| Τύπος εγγράφου: | bachelor thesis |
| Περιγραφή αρχείου: | application/pdf |
| Γλώσσα: | English |
| Relation: | TRITA-EECS-EX; 2023:343 |
| Διαθεσιμότητα: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-329352 |
| Rights: | info:eu-repo/semantics/openAccess |
| Αριθμός Καταχώρησης: | edsbas.312EAA63 |
| Βάση Δεδομένων: | BASE |
| FullText | Text: Availability: 0 CustomLinks: – Url: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-329352# Name: EDS - BASE (ns324271) Category: fullText Text: View record from BASE |
|---|---|
| Header | DbId: edsbas DbLabel: BASE An: edsbas.312EAA63 RelevancyScore: 851 AccessLevel: 3 PubType: Dissertation/ Thesis PubTypeId: dissertation PreciseRelevancyScore: 851.480346679688 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Preserving the Mental Map when Visualizing Dynamic Graphs : An Approach for Intermediate Representations in the C2 Java Compiler ; Bevarande av den mentala kartan vid visualisering av dynamiska grafer : Ett tillvägagångssätt för mellanrepresentationer i C2 Java-kompilatorn – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Yin%2C+Emmy%22">Yin, Emmy</searchLink> – Name: Publisher Label: Publisher Information Group: PubInfo Data: KTH, Skolan för elektroteknik och datavetenskap (EECS) – Name: DatePubCY Label: Publication Year Group: Date Data: 2023 – Name: Subset Label: Collection Group: HoldingsInfo Data: Royal Inst. of Technology, Stockholm (KTH): Publication Database DiVA – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22Dynamic+Graphs%22">Dynamic Graphs</searchLink><br /><searchLink fieldCode="DE" term="%22Graph+Layout+Algorithms%22">Graph Layout Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Visualization%22">Visualization</searchLink><br /><searchLink fieldCode="DE" term="%22Hierarchical+Graph+Layouts%22">Hierarchical Graph Layouts</searchLink><br /><searchLink fieldCode="DE" term="%22Dynamiska+grafer%22">Dynamiska grafer</searchLink><br /><searchLink fieldCode="DE" term="%22grafritningsalgoritmer%22">grafritningsalgoritmer</searchLink><br /><searchLink fieldCode="DE" term="%22visualisering%22">visualisering</searchLink><br /><searchLink fieldCode="DE" term="%22hierarkiska+grafritningar%22">hierarkiska grafritningar</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+and+Information+Sciences%22">Computer and Information Sciences</searchLink><br /><searchLink fieldCode="DE" term="%22Data-+och+informationsvetenskap%22">Data- och informationsvetenskap</searchLink> – Name: Abstract Label: Description Group: Ab Data: Graphs are powerful data structures that are widely used to represent complex forms of information. One area in which graphs are successfully being used is within compiler engineering, where a program under compilation can be represented as a graph that changes as the program is being compiled. These graphs, known as Intermediate Representation graphs, can be visualized to aid compiler engineers in understanding and debugging the compiler. However, graphs that change over time need to be visualized so that the viewer’s internal understanding of the graph is maintained. Simultaneously, the graph layouts should be of high quality. These criteria can be conflicting, making the visualization of changing graphs difficult. In this thesis, a dynamic graph layout algorithm to visualize dynamic Intermediate Representation graphs used in the C2 compiler in the Java HotSpotTM Virtual Machine was developed and evaluated. Currently, these graphs are visualized with hierarchical layouts, using a static graph layout algorithm. Five metrics were developed and used to evaluate the layouts by the dynamic algorithm against the layouts by the static algorithm. Four of these were concerned with the layout quality, by measuring the number of edge crossings, number of reversed edges, average degree of the edge bends and the average edge length. The fifth metric was related to mental map preservation and measures the Euclidean distance of node displacement across two layouts. Two experiments were conducted to compare the algorithms. The first experiment measured the layouts drawn by the algorithms when there were a couple of nodes added to or removed from a graph iteratively. A total of 1061 layouts were measured. In 74% of these, the dynamic algorithm caused less node displacement. The second experiment aimed to evaluate the algorithms against what is possible to achieve in regards of minimum node displacement while maintaining a high quality. The results of both experiments indicate that the dynamic layout algorithm yields layouts ... – Name: TypeDocument Label: Document Type Group: TypDoc Data: bachelor thesis – Name: Format Label: File Description Group: SrcInfo Data: application/pdf – Name: Language Label: Language Group: Lang Data: English – Name: NoteTitleSource Label: Relation Group: SrcInfo Data: TRITA-EECS-EX; 2023:343 – Name: URL Label: Availability Group: URL Data: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-329352 – Name: Copyright Label: Rights Group: Cpyrght Data: info:eu-repo/semantics/openAccess – Name: AN Label: Accession Number Group: ID Data: edsbas.312EAA63 |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.312EAA63 |
| RecordInfo | BibRecord: BibEntity: Languages: – Text: English Subjects: – SubjectFull: Dynamic Graphs Type: general – SubjectFull: Graph Layout Algorithms Type: general – SubjectFull: Visualization Type: general – SubjectFull: Hierarchical Graph Layouts Type: general – SubjectFull: Dynamiska grafer Type: general – SubjectFull: grafritningsalgoritmer Type: general – SubjectFull: visualisering Type: general – SubjectFull: hierarkiska grafritningar Type: general – SubjectFull: Computer and Information Sciences Type: general – SubjectFull: Data- och informationsvetenskap Type: general Titles: – TitleFull: Preserving the Mental Map when Visualizing Dynamic Graphs : An Approach for Intermediate Representations in the C2 Java Compiler ; Bevarande av den mentala kartan vid visualisering av dynamiska grafer : Ett tillvägagångssätt för mellanrepresentationer i C2 Java-kompilatorn Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Yin, Emmy IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Type: published Y: 2023 Identifiers: – Type: issn-locals Value: edsbas – Type: issn-locals Value: edsbas.oa |
| ResultId | 1 |