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

Content

...	...	@@ -26,8 +26,8 @@
26	26
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		-{{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}}Implement and Evaluate a Layout Algorithm for Simple Cluster Graphs** (Bachelor/Master)
	29	+{{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}}\\
	30	+* **{{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}}Implement and Evaluate a Layout Algorithm for Simple Cluster Graphs** (Bachelor/Master)
31	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	32	* **Layering Algorithms** (Bachelor, Master)
33	33	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.
...	...	@@ -71,34 +71,41 @@
71	71
72	72	In diesem Kontext sind Themenstellungen für Bachelor-/Master-/Diplom- und Studienarbeiten beispielhaft genannt. Bei Fragen oder sprechen Sie einen Betreuer bitte direkt an:
73	73
74		-
75		-
	74	+* --**Automatic documentation generation for model-based languages **(Bachelor)--
	75	+--Develop an automatic SCCharts documentation & comment system--
	76	+* --**On the usability of the KIELER SCCharts compiler** (Bachelor)--
	77	+--Evaluate the actual implementation of the KIELER SCCharts compiler and provide suggestions for improvements, i.e. the usability as standalone (commandline) compiler--
	78	+\\\\
	79	+* --**Transformation from SCCharts to Esterel** (Bachelor/Master)--
	80	+--Develop a transformation in Xtend2 to generate Esterel code for SCCharts.--
	81	+* --**Hardware Synthesis from SCCharts to FPGA **(Bachelor/Master)--
	82	+--Use the circuit-based code generation approach to produce code for FPGAs--
76	76	* (% style="line-height: 1.4285715;" %)**Optimization of the SCCharts compiler/transformations **(%%)(Bachelor/Master)
77	77	Profile the actual SCCharts compiler/transformations and apply optimizations; also evaluate the possibility to use multiple cores for compilation
78	78	* (% style="line-height: 1.4285715;" %)**On the pragmatics of modeling large models in SCCharts**(%%) (Bachelor/Master)
79	79	Evaluate the possibilities to create and maintain large models in model-based languages (i.e. SCCharts) and provide suggestions for improvements
80		-* **Visualization of Model-based Simulation via Tracing** (Bachelor/Master)
81		-Use the already implemented Model-to-Model-Tracing in KIELER to visualize simulations.
82		-* **Incremental Compilation of SCEst** (Bachelor/Master)
83		-Modify the KIELER SCEst language so that KIELER is able to compile Esterel step-by-step to C via SCL.
84		-* **Model-based Compilation of Legacy C Programs** (Bachelor/Master)
85		-Implement a model-based compiler in KIELER that is able to compile C to (S)CCharts and then back to C again.
	87	+* **Extend the SC MoC to handle priority-based variable accesses** (Bachelor/Master)
	88	+Add priorities to variable accesses to extend the SC MoC and therefore the number of valid sequentially constructive synchronous programs.
	89	+* **The Semantics of Hybrid SCCharts** (Bachelor/Master)
	90	+Evaluate SCCharts hybrid models and define semantics for the new features of SCCharts (3.0).
86	86	\\\\
87		-* **Efficient data dependency & scheduling analyses in SCCharts** (Master/Bachelor)
88		-Implement analyses for data dependency, scheduling (e.g. tick boundaries) for SCCharts to improve static scheduling of the compiler
	92	+* **Detecting tick boundaries in SCCharts **(Master/Bachelor)
	93	+Implement an algorithm that detects tick boundaries (in concurrent) threads and therefore improves the scheduling
	94	+* **Efficient data dependency analyses in SCCharts** (Master/Bachelor)
	95	+Implement data dependency analyses for SCCharts to improve static scheduling of the compiler
	96	+* --**KIELER evaluation environment for synchronous languages** (Master/Bachelor)--
	97	+--Develop a reliable evaluation environment to compare common synchronous languages (i.e. Esterel/SyncCharts & SCCharts)--
	98	+* **Raceyard evaluation** (Master/Bachelor)
	99	+Evaluate the possibility for the use of SCCharts in the Raceyard context and pave the way for future experiments
89	89	* **Curing Schizophrenia in SCCharts **(Master/Bachelor)
90	90	Develop new synchronizer to handle schizophrenia properly (e.g. depth join).
91	91	* --**Hybrid Models for Legacy Code Extraction **(Master/Bachelor)--
92	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.
95	95	\\\\
96	96	* **Quartz **(Master)
97	97	Integrate the synchronous Quartz language into KIELER for validation purposes and teaching.
98	98	* **Implementation of a priority-based compilation approach **(Master)
99	99	Implement the SyncCharts priority-based compilation approach into the SCCharts compiler chain.
100		-* **Raceyard evaluation** (Master)
101		-Evaluate the possibility for the use of SCCharts in the Raceyard context and pave the way for future experiments
102	102
103	103	= PRETSY / PRETSY2 =
104	104

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-15532151
	1	+15532042

URL

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