Changes for page Available Topics

Last modified by Niklas Rentz on 2025/03/13 09:21

From version < 38.1 >

edited by ima
on 2014/09/23 14:16

To version < 46.1 >

edited by ssm
on 2015/03/02 13:17

Change comment: There is no comment for this version

Raw
Rendered

Summary

Page properties (2 modified, 0 added, 0 removed)
Objects (1 modified, 0 added, 0 removed)
- Confluence.Code.ConfluencePageClass[0]

Details

Page properties

Author

@@ -1,1 +1,1 @@
--XWiki.ima
++XWiki.ssm

Content

@@ -6,105 +6,106 @@
  {{toc/}}
--= Bachelor Topics =
++= Graph Layout =
--== Graph Layout ==
++**Advisors:** Ulf Rüegg, Christoph Daniel Schulze.
--* (% style="line-height: 1.4285715;" %)**Implement Greedy Switch Heuristic for Crossing Minimization**(%%)
--The order of nodes in a layer determines the number of crossings and is computed during the crossing minimization step. The results can usually be further improved by switching the order of nodes around, which we currently lack proper algorithms for.
--* **{{jira columns="key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution" id="KIELER JIRA" serverId="2851bd34-0bf1-3f02-ab12-7d77ccab0fae" key="KIPRA-891"}}KIPRA-891{{/jira}}Layering Algorithms**
--Implement an alternative algorithm for the layer assignment problem used in the layer-based approach to graph layout.
--* **Tight Packing of Connected Components**
--Different connected components of a graph are often laid out separately and combined again afterwards. This combination step often produces too much whitespace. Research relevant 2D packing literature and implement a better solution.
--* **{{jira columns="key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution" id="KIELER JIRA" serverId="2851bd34-0bf1-3f02-ab12-7d77ccab0fae" key="KIPRA-1031"}}KIPRA-1031{{/jira}}Integrate KIML with JGraph**
--Provide automatic layout through KIML for the JGraph diagram library and develop a simple JGraph-based graph editor to test the integration with.
--* **{{jira showSummary="true" columns="key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution" id="KIELER JIRA" serverId="2851bd34-0bf1-3f02-ab12-7d77ccab0fae" key="KIPRA-1214"}}KIPRA-1214{{/jira}}Improved Edge Label Placement**
++* **Tight Packing of Connected Components** (Bachelor)
++Different connected components of a graph are often laid out separately and combined again afterwards. This combination step often produces too much whitespace. Research relevant 2D packing literature and implement a better solution.
++{{jira columns="key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution" id="KIELER JIRA" serverId="2851bd34-0bf1-3f02-ab12-7d77ccab0fae" key="KIPRA-1262"}}KIPRA-1262{{/jira}}\\
++* **{{jira columns="key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution" id="KIELER JIRA" serverId="2851bd34-0bf1-3f02-ab12-7d77ccab0fae" key="KIPRA-1031"}}KIPRA-1031{{/jira}}Integrate KIML with JGraph** (Bachelor)
++Provide automatic layout through KIML for the JGraph diagram library and develop a simple JGraph-based graph editor to test the integration with.\\
++* **{{jira showSummary="true" columns="key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution" id="KIELER JIRA" serverId="2851bd34-0bf1-3f02-ab12-7d77ccab0fae" key="KIPRA-1214"}}KIPRA-1214{{/jira}}Improved Edge Label Placement** (Bachelor)
  Our layout algorithm already supports the placement of edge labels. However, there's still room for improvement...
++* **Layering Algorithms** (Bachelor, Master)
++Implement an alternative algorithm for the layer assignment problem used in the layer-based approach to graph layout. The focus of the algorithm could the consideration of the number of edge crossings, a given aspect ratio, or overall compactness.
++* **Node Placement With a Focus on Compactness** (Master)
++Node placement algorithms often try to draw as many edges as straight lines as possible. However, that usually results in less compact diagrams. The focus of this topic would be to devise or adapt a node placement algorithm that tries to strike a balance between straightness and compactness.
++* **Compound Graph Layout** (Master)
++Design and implement new concepts for computing layer-based layouts of compound graphs. The main focus shall be on //maintainability//: ensuring that the implementation can be kept working over the years. The main area to be considered here is the crossing minimization phase.
++* **Force Based Drawing with Port Constraints** (Master)
++Develop methods for integrating port constraints in force-based drawing approaches. The resulting node placement shall be evaluated using an edge router such as [[libavoid>>url:http://www.adaptagrams.org/||shape="rect"]] on the model library of [[Ptolemy>>url:http://ptolemy.eecs.berkeley.edu/||shape="rect"]].
++* **Combining Forces and Layers** (Master)**
++**Design and implement a layout algorithm that combines the force-based and the layer-based approaches. The first three phases of the layer-based approach shall be replaced by a node distribution computed with a force-based approach.
--== Modeling Pragmatics ==
++= Modeling Pragmatics =
--* **Comment Attachment**
++**Advisors:** Reinhard von Hanxleden, Ulf Rüegg, Christoph Daniel Schulze.
++
++* **Comment Attachment** (Bachelor)
  When computing a new layout for a diagram that contains comments (comparable to comments in source code), the comments often get placed far away of the nodes they refer to. This is because often the reference is not explicitly encoded in the original model. We have used a distance-based metric in the past to discover references automatically, but there are lots of ideas for improvement. This bachelor thesis would implement them, perhaps come up with additional ideas, and finally evaluate them in a thorough experiment.
--* **Control Flow Graph Exploration / Visualization**
--Use pragmatics concepts (automatic layout, focus & context) for exploring/visualizing control flow graphs and specific paths, eg. as computed by OTAWA WCET analysis tool, eg. using Klighd.
--* **OMG DD Format**
--Explore the mapping of [[KGraph>>doc:KGraph Meta Model]] / [[KRendering>>doc:The KRendering Notation Model]] to the [[Diagram Definition>>url:http://www.omg.org/spec/DD/||shape="rect"]] format of the OMG.
++* **Control Flow Graph Exploration / Visualization** (Bachelor)
++Use pragmatics concepts (automatic layout, focus & context) for exploring/visualizing control flow graphs and specific paths, eg. as computed by OTAWA WCET analysis tool, eg. using KLighD.
++* **Compound Graph Exploration** (Bachelor, Master)
++A new graph exploration approach should be examined which is uses different zoom levels for different compound nodes. This tries to map the "Google Maps approach" of only showing the information of interest at any given zoom level to the field of graph exploration.
--== Semantics and Synchronous Languages ==
++= Semantics and Synchronous Languages =
--* **Validation Manager for Models**
++**Advisors:** Christian Motika, Steven Smyth
++
++* **Automatic documentation generation for model-based languages **(Bachelor)
++Develop an automatic SCCharts documentation & comment system
++* **Merging SCCharts and KLOTS** (Bachelor)
++Implement KLOTS as demonstrator extension of the KIELER SCCharts implementation
++* **On the usability of the KIELER SCCharts compiler** (Bachelor)
++Evaluate the actual implementation of the KIELER SCCharts compiler and provide suggestions for improvements, i.e. the usability as standalone (commandline) compiler
++\\
++* **Validation Manager for Models **(Bachelor/Master)
  Develop an integrated, flexible and generic syntactic validation framework for models (e.g. Esterel or SyncCharts).
--* **SCCharts compiler validation with Esterel**
++* **SCCharts compiler validation with Esterel **(Bachelor/Master)
  Automate the validation of the SCCharts compiler using the Esterel simulation.
--* **Transformation from SCCharts to Esterel** [possibly also Master Topic]
++* **Transformation from SCCharts to Esterel** (Bachelor/Master)
  Develop a transformation in Xtend2 to generate Esterel code for SCCharts.
--* **Hardware Synthesis from SCCharts to FPGA **[possibly also Master Topic]
--Use the circuit-based code generation to produce code for FPGAs
--* **Automatic documentation generation **[possibly also Master Topic]
--Develop an automatic SCCharts documentation system
--* **Optimizations for the SCCharts compiler **[possibly also Master Topic]
--Profile the actual SCCharts compiler and apply optimizations
--* **Multi-core SCCharts compiler **[possibly also Master Topic]
--Implement the possibility to use more than one core to compile large SCCharts
--* **Adding dataflow to SCCharts** [possibly also Master Topic]
--Add dataflow to SCCharts
--
--== PRETSY / PRETSY2 ==
--
--* **Real-time extensions for SCCharts** [possibly also Master Topic]
--Make the timing instructions //delay_until// und //exception_on_expire// of the [[FlexPRET>>url:http://rtsys.informatik.uni-kiel.de/confluence/Multithreaded/Multicore execution of SCCharts Evaluate possibilities to preserve parallelism in SCCharts, implement mapping for (fine grained) multithreading and multicore based on the FlexPRET||shape="rect"]] processor available in SCCharts.
--* See also Semantics and Synchronous Languages: **Adding dataflow to SCCharts**
--
--== Miscellaneous Topics ==
--
--* **Developing an Info Screen**
--Info screens are screens that present data in ways that can be easily understood. This includes static data (project description graphics, members of a team, ...) as well as dynamically aggregated data (bug statistics, automatic build overviews, ...). This topic is about developing such an info screen for our group and making it easily configurable.
--
------
--
--= (% style="color: rgb(0,0,0);" %)Master Topics(%%) =
--
--(% style="color: rgb(0,0,0);" %)(see also Bachelor Topics for potentially expansible topics)
--
--
--== Graph Layout ==
--
--* **Layering Algorithms**
--Develop an alternative algorithm for the layer assignment problem used in the layer-based approach to graph layout. The algorithm shall be extended to consider the number of edge crossings and an optimal aspect ratio.
--* **Node Placement**
--Develop a new node placement algorithm that finds a good balance between keeping edges straight and keeping the drawing from getting too big.
--* (% style="line-height: 1.4285715;" %)**Compound Graph Layout**(%%)
--Design and implement new concepts for computing layer-based layouts of compound graphs. The main focus shall be on //maintainability//: ensuring that the implementation can be kept working over the years.
--* **Force Based Drawing with Port Constraints**
--Develop methods for integrating port constraints in force-based drawing approaches. The resulting node placement shall be evaluated using an edge router such as [[libavoid>>url:http://www.adaptagrams.org/||shape="rect"]] on the model library of [[Ptolemy>>url:http://ptolemy.eecs.berkeley.edu/||shape="rect"]].
--* **Combining Forces and Layers
--**Design and implement a layout algorithm that combines the force-based and the layer-based approaches. The first three phases of the layer-based approach shall be replaced by a node distribution computed with a force-based approach.
--
--== Modeling Pragmatics ==
--
--* **Diagram Description Language**
--Developing the concepts and implementation of a diagram description language based on Klighd, with SyncCharts as application example.
--
--== Semantics and Synchronous Languages ==
--
--* **Quartz**
++* **Hardware Synthesis from SCCharts to FPGA **(Bachelor/Master)
++Use the circuit-based code generation approach to produce code for FPGAs
++* (% style="line-height: 1.4285715;" %)**Optimization of the SCCharts compiler **(%%)(Bachelor/Master)
++Profile the actual SCCharts compiler and apply optimizations; also evaluate the possibility to use multiple cores for compilation
++* **Optimization of the SCCharts transformations** (Bachelor/Master)
++Profile the actual SCCharts transformations and apply optimizations
++* **SCCharts Andriod backend for Mini Drones** (Bachelor/Master)  [work in progress, Bachelor/Master project summer term 2015]
++Develop a new code generation backend for SCCharts for Andriod applications with Mini Drones as demonstrator
++* **On the pragmatics of modelling large models in SCCharts** (Bachelor/Master)
++Evaluate the possibilities to create and maintain large models in model-based languages (i.e. SCCharts) and provide suggestions for improvements
++* **Extend the SC MoC to handle priority-based variable accesses** (Bachelor/Master)
++Add priorities to variable accesses to extend the SC MoC and therefore the number of valid sequentially constructive synchronous programs.
++\\
++* **Detecting tick boundaries in SCCharts **(Master/Bachelor)
++Implement an algorithm that detects tick boundaries (in concurrent) threads and therefore improves the scheduling
++* **Efficient data dependency analyses in SCCharts** (Master/Bachelor)
++Implement data dependency analyses for SCCharts to improve static scheduling of the compiler
++* **KIELER evaluation environment for synchronous languages** (Master/Bachelor)
++Develop a reliable evaluation environment to compare common synchronous languages (i.e. Esterel/SyncCharts & SCCharts)
++* **Raceyard evaluation** (Master/Bachelor)
++Evaluate the possibility for the use of SCCharts in the Raceyard context and pave the way for future experiments
++\\
++* **Quartz **(Master)
  Integrate the synchronous Quartz language into KIELER for validation purposes and teaching.
--* **Implementation of a priority-based compilation approach**
++* **Implementation of a priority-based compilation approach **(Master) [work in progress, Caroline Butschek]
  Implement the SyncCharts priority-based compilation approach into the SCCharts compiler chain.
--* **Curing Schizophrenia in SCCharts**
--Develop new synchronizer to handle schizophrenia properly (e.g. depth join).
--* **Detecting tick boundaries in SCCharts**
--Implement an algorithm that detects tick boundaries (in concurrent) threads and therefore improves the scheduling
--* **Multithreaded/Multicore execution of SCCharts **(see below PRETSY/PRETSY2)**
++* **From Esterel to SCL **(Master) [work in progress, Karsten Rathlev]
++Implement transformations that translate Esterel programs to SCL
++* **Curing Schizophrenia in SCCharts **(Master)
++Develop new synchronizer to handle schizophrenia properly (e.g. depth join).**
  **
--* **Railway 2.0**
++* **Railway 4.0 **(Master) [work in progress, Nis Wechselberg]
  Design a new and modern hardware controlling (Version 4) for the railway installation.
--== PRETSY / PRETSY2 ==
++= PRETSY / PRETSY2 =
--* **Multithreaded/Multicore execution of SCCharts**
--Evaluate possibilities to preserve parallelism in SCCharts, implement mapping for (fine grained) multithreading and multicore
--based on the [[FlexPRET>>url:http://www.eecs.berkeley.edu/Pubs/TechRpts/2013/EECS-2013-172.pdf||shape="rect"]] processor.**
--**
++**Advisors:** Insa Fuhrmann, Steven Smyth
--
++* **Real-time extensions for SCCharts** (Bachelor/Master)
++Make the timing instructions //delay_until// und //exception_on_expire// of the [[FlexPRET>>url:http://rtsys.informatik.uni-kiel.de/confluence/Multithreaded/Multicore execution of SCCharts Evaluate possibilities to preserve parallelism in SCCharts, implement mapping for (fine grained) multithreading and multicore based on the FlexPRET||shape="rect"]] processor available in SCCharts.
++* **Adding dataflow to SCCharts** (Bachelor/Master) [work in progress, Axel Umland]
++Add dataflow to SCCharts
++\\
++* **Multithreaded/Multicore execution of SCCharts **(Master/Bachelor)  [work in progress, Tibor Weiß]
++Evaluate possibilities to preserve parallelism in SCCharts, implement mapping for (fine grained) multithreading and multicore
++based on the [[FlexPRET>>url:http://www.eecs.berkeley.edu/Pubs/TechRpts/2013/EECS-2013-172.pdf||shape="rect"]] processor.
++
++= (% style="color: rgb(0,0,0);" %)Miscellaneous Topics(%%) =
++
++**Advisors:** to be determined.
++
++* **Developing an Info Screen** (Bachelor)
++Info screens are screens that present data in ways that can be easily understood. This includes static data (project description graphics, members of a team, ...) as well as dynamically aggregated data (bug statistics, automatic build overviews, ...). This topic is about developing such an info screen for our group and making it easily configurable.

Confluence.Code.ConfluencePageClass[0]

Id

@@ -1,1 +1,1 @@
--10747970
++10751487

URL

@@ -1,1 +1,1 @@
--https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/10747970/Topics for Student Theses
++https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/10751487/Topics for Student Theses

Changes for page Available Topics

Summary

Details

Navigation

Quick Links