Summary

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

Details

Page properties

Content

...	...	@@ -19,8 +19,6 @@
19	19	Our layout algorithm already supports the placement of edge labels. However, there's still room for improvement...
20	20	* **Layering Algorithms** (Bachelor, Master)
21	21	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.
22		-* **Orthogonal "Edge Bundling"** (Bachelor, Master)
23		-Implement and evaluate strategies for orthogonal edge bundling within our layer-based layout algorithm.
24	24	* **Node Placement With a Focus on Compactness** (Master)
25	25	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.
26	26	* **Compound Graph Layout** (Master)
...	...	@@ -29,12 +29,13 @@
29	29	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"]].
30	30	* **Combining Forces and Layers** (Master)**
31	31	**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.
32		-\\
33	33
34	34	= Modeling Pragmatics =
35	35
36	36	**Advisors:** Reinhard von Hanxleden, Ulf Rüegg, Christoph Daniel Schulze.
37	37
	35	+* **Comment Attachment** (Bachelor)
	36	+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.
38	38	* **Control Flow Graph Exploration / Visualization** (Bachelor)
39	39	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.
40	40	* **Compound Graph Exploration** (Bachelor, Master)
...	...	@@ -46,8 +46,8 @@
46	46
47	47	* **Automatic documentation generation for model-based languages **(Bachelor)
48	48	Develop an automatic SCCharts documentation & comment system
49		-* **On the usability of the KIELER SCCharts compiler** (Bachelor)
50		-Evaluate the actual implementation of the KIELER SCCharts compiler and provide suggestions for improvements, i.e. the usability as standalone (commandline) compiler
	48	+* **Merging SCCharts and KLOTS** (Bachelor)
	49	+Implement KLOTS as demonstrator extension of the KIELER SCCharts implementation
51	51	\\
52	52	* **Validation Manager for Models **(Bachelor/Master)
53	53	Develop an integrated, flexible and generic syntactic validation framework for models (e.g. Esterel or SyncCharts).
...	...	@@ -56,20 +56,16 @@
56	56	* **Transformation from SCCharts to Esterel** (Bachelor/Master)
57	57	Develop a transformation in Xtend2 to generate Esterel code for SCCharts.
58	58	* **Hardware Synthesis from SCCharts to FPGA **(Bachelor/Master)
59		-Use the circuit-based code generation approach to produce code for FPGAs
	58	+Use the circuit-based code generation to produce code for FPGAs
60	60	* (% style="line-height: 1.4285715;" %)**Optimization of the SCCharts compiler **(%%)(Bachelor/Master)
61		-Profile the actual SCCharts compiler and apply optimizations; also evaluate the possibility to use multiple cores for compilation
	60	+Profile the actual SCCharts compiler and apply optimizations
62	62	* **Optimization of the SCCharts transformations** (Bachelor/Master)
63	63	Profile the actual SCCharts transformations and apply optimizations
64		-* **On the pragmatics of modelling large models in SCCharts** (Bachelor/Master)
65		-Evaluate the possibilities to create and maintain large models in model-based languages (i.e. SCCharts) and provide suggestions for improvements
66		-* **Extend the SC MoC to handle priority-based variable accesses** (Bachelor/Master)
67		-Add priorities to variable accesses to extend the SC MoC and therefore the number of valid sequentially constructive synchronous programs.
68	68	\\
69	69	* **Detecting tick boundaries in SCCharts **(Master/Bachelor)
70	70	Implement an algorithm that detects tick boundaries (in concurrent) threads and therefore improves the scheduling
71	71	* **Efficient data dependency analyses in SCCharts** (Master/Bachelor)
72		-Implement data dependency analyses for SCCharts to improve static scheduling of the compiler
	67	+Implement data dependency analyses for SCCharts
73	73	* **KIELER evaluation environment for synchronous languages** (Master/Bachelor)
74	74	Develop a reliable evaluation environment to compare common synchronous languages (i.e. Esterel/SyncCharts & SCCharts)
75	75	* **Raceyard evaluation** (Master/Bachelor)
...	...	@@ -77,11 +77,15 @@
77	77	\\
78	78	* **Quartz **(Master)
79	79	Integrate the synchronous Quartz language into KIELER for validation purposes and teaching.
80		-* **Implementation of a priority-based compilation approach **(Master)
	75	+* **Implementation of a priority-based compilation approach **(Master) [work in progress, Caroline Butschek]
81	81	Implement the SyncCharts priority-based compilation approach into the SCCharts compiler chain.
	77	+* **From Esterel to SCL **(Master) [work in progress, Karsten Rathlev]
	78	+Implement transformations that translate Esterel programs to SCL
82	82	* **Curing Schizophrenia in SCCharts **(Master)
83		-Develop new synchronizer to handle schizophrenia properly (e.g. depth join).
84		-\\
	80	+Develop new synchronizer to handle schizophrenia properly (e.g. depth join).**
	81	+**
	82	+* **Railway 4.0 **(Master) [work in progress, Nis Wechselberg]
	83	+Design a new and modern hardware controlling (Version 4) for the railway installation.
85	85
86	86	= PRETSY / PRETSY2 =
87	87
...	...	@@ -89,7 +89,12 @@
89	89
90	90	* **Real-time extensions for SCCharts** (Bachelor/Master)
91	91	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.
	91	+* **Adding dataflow to SCCharts** (Bachelor/Master) [work in progress, Axel Umland]
	92	+Add dataflow to SCCharts
92	92	\\
	94	+* **Multithreaded/Multicore execution of SCCharts **(Master/Bachelor)
	95	+Evaluate possibilities to preserve parallelism in SCCharts, implement mapping for (fine grained) multithreading and multicore
	96	+based on the [[FlexPRET>>url:http://www.eecs.berkeley.edu/Pubs/TechRpts/2013/EECS-2013-172.pdf||shape="rect"]] processor.
93	93
94	94	= (% style="color: rgb(0,0,0);" %)Miscellaneous Topics(%%) =
95	95

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-10752004
	1	+10748082

URL

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