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 @@
1		-XWiki.uru
	1	+XWiki.ssm

Content

...	...	@@ -27,7 +27,9 @@
27	27	* **Tight Packing of Connected Components** (Bachelor)
28	28	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.
29	29	{{jira id="KIELER JIRA" columns="key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution" serverId="2851bd34-0bf1-3f02-ab12-7d77ccab0fae" key="KIPRA-1262"}}KIPRA-1262{{/jira}}\\
30		-* **{{jira id="KIELER JIRA" columns="key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution" serverId="2851bd34-0bf1-3f02-ab12-7d77ccab0fae" key="KIPRA-1031"}}KIPRA-1031{{/jira}}Layering Algorithms** (Bachelor, Master)
	30	+* **{{jira id="KIELER JIRA" columns="key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution" serverId="2851bd34-0bf1-3f02-ab12-7d77ccab0fae" key="KIPRA-1031"}}KIPRA-1031{{/jira}}Implement and Evaluate a Layout Algorithm for Simple Cluster Graphs** (Bachelor/Master)
	31	+Cluster graphs are graphs in which every node belongs can belong to one or more groups of nodes, or //clusters//. The clusters can overlap and do not need to form a hierarchy. We already have some ideas for laying out cluster graphs with simple structures. This topic focusses on implementing at least one of these ideas and evaluating it to find out if it works well.
	32	+* **Layering Algorithms** (Bachelor, Master)
31	31	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.
32	32	* **Combining Forces and Layers** (Master)**
33	33	**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.
...	...	@@ -81,24 +81,20 @@
81	81	Modify the KIELER SCEst language so that KIELER is able to compile Esterel step-by-step to C via SCL.
82	82	* **Model-based Compilation of Legacy C Programs** (Bachelor/Master)
83	83	Implement a model-based compiler in KIELER that is able to compile C to (S)CCharts and then back to C again.
84		-* **Extend the SC MoC to handle priority-based variable accesses** (Bachelor/Master)
85		-Add priorities to variable accesses to extend the SC MoC and therefore the number of valid sequentially constructive synchronous programs.
86		-* **Transformation of Circuits to SCCharts** (Bachelor/Master)
87		-Implement a transformation that translates circuits to (dataflow) SCCharts.
88	88	\\\\
89	89	* **Efficient data dependency & scheduling analyses in SCCharts** (Master/Bachelor)
90	90	Implement analyses for data dependency, scheduling (e.g. tick boundaries) for SCCharts to improve static scheduling of the compiler
91	91	* **Curing Schizophrenia in SCCharts **(Master/Bachelor)
92	92	Develop new synchronizer to handle schizophrenia properly (e.g. depth join).
93		-* **SCCharts Debugging** (Master/Bachelor)
94		-Implement more sophisticated debugging mechanisms (e.g. breakpoints, observers) for SCCharts
95		-* **Environment Simulations for SCCharts** (Master/Bachelor)
96		-Develop a system to simulate environments (e.g. for Lego Mindstorms) for SCCharts in KIELER
	91	+* --**Hybrid Models for Legacy Code Extraction **(Master/Bachelor)--
	92	+--Extract legacy code (e.g. legacy C code) to (SCCharts) Hybrid Models.--
	93	+* **Extend the SC MoC to handle priority-based variable accesses** (Bachelor/Master)
	94	+Add priorities to variable accesses to extend the SC MoC and therefore the number of valid sequentially constructive synchronous programs.
97	97	\\\\
98	98	* **Quartz **(Master)
99	99	Integrate the synchronous Quartz language into KIELER for validation purposes and teaching.
100		-* --**Implementation of a priority-based compilation approach **(Master) --
101		---Implement the SyncCharts priority-based compilation approach into the SCCharts compiler chain.--
	98	+* **Implementation of a priority-based compilation approach **(Master)
	99	+Implement the SyncCharts priority-based compilation approach into the SCCharts compiler chain.
102	102	* **Raceyard evaluation** (Master)
103	103	Evaluate the possibility for the use of SCCharts in the Raceyard context and pave the way for future experiments
104	104

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-15532281
	1	+15532151

URL

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