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.uru

Content

...	...	@@ -19,6 +19,8 @@
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.
22	22	* **Node Placement With a Focus on Compactness** (Master)
23	23	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.
24	24	* **Compound Graph Layout** (Master)
...	...	@@ -27,6 +27,7 @@
27	27	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"]].
28	28	* **Combining Forces and Layers** (Master)**
29	29	**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	+\\
30	30
31	31	= Modeling Pragmatics =
32	32
...	...	@@ -48,7 +48,7 @@
48	48	* **Merging SCCharts and KLOTS** (Bachelor)
49	49	Implement KLOTS as demonstrator extension of the KIELER SCCharts implementation
50	50	* **On the usability of the KIELER SCCharts compiler** (Bachelor)
51		-Evaluate the actual implementation of the KIELER SCCharts compiler and provide suggestions for improvements
	54	+Evaluate the actual implementation of the KIELER SCCharts compiler and provide suggestions for improvements, i.e. the usability as standalone (commandline) compiler
52	52	\\
53	53	* **Validation Manager for Models **(Bachelor/Master)
54	54	Develop an integrated, flexible and generic syntactic validation framework for models (e.g. Esterel or SyncCharts).
...	...	@@ -57,15 +57,17 @@
57	57	* **Transformation from SCCharts to Esterel** (Bachelor/Master)
58	58	Develop a transformation in Xtend2 to generate Esterel code for SCCharts.
59	59	* **Hardware Synthesis from SCCharts to FPGA **(Bachelor/Master)
60		-Use the circuit-based code generation to produce code for FPGAs
	63	+Use the circuit-based code generation approach to produce code for FPGAs
61	61	* (% style="line-height: 1.4285715;" %)**Optimization of the SCCharts compiler **(%%)(Bachelor/Master)
62		-Profile the actual SCCharts compiler and apply optimizations
	65	+Profile the actual SCCharts compiler and apply optimizations; also evaluate the possibility to use multiple cores for compilation
63	63	* **Optimization of the SCCharts transformations** (Bachelor/Master)
64	64	Profile the actual SCCharts transformations and apply optimizations
65		-* **SCCharts Andriod backend for Mini Drones** (Bachelor/Master)
	68	+* **SCCharts Andriod backend for Mini Drones** (Bachelor/Master)  [work in progress, Bachelor/Master project summer term 2015]
66	66	Develop a new code generation backend for SCCharts for Andriod applications with Mini Drones as demonstrator
67	67	* **On the pragmatics of modelling large models in SCCharts** (Bachelor/Master)
68	68	Evaluate the possibilities to create and maintain large models in model-based languages (i.e. SCCharts) and provide suggestions for improvements
	72	+* **Extend the SC MoC to handle priority-based variable accesses** (Bachelor/Master)
	73	+Add priorities to variable accesses to extend the SC MoC and therefore the number of valid sequentially constructive synchronous programs.
69	69	\\
70	70	* **Detecting tick boundaries in SCCharts **(Master/Bachelor)
71	71	Implement an algorithm that detects tick boundaries (in concurrent) threads and therefore improves the scheduling
...	...	@@ -97,7 +97,7 @@
97	97	* **Adding dataflow to SCCharts** (Bachelor/Master) [work in progress, Axel Umland]
98	98	Add dataflow to SCCharts
99	99	\\
100		-* **Multithreaded/Multicore execution of SCCharts **(Master/Bachelor)
	105	+* **Multithreaded/Multicore execution of SCCharts **(Master/Bachelor)  [work in progress, Tibor Weiß]
101	101	Evaluate possibilities to preserve parallelism in SCCharts, implement mapping for (fine grained) multithreading and multicore
102	102	based on the [[FlexPRET>>url:http://www.eecs.berkeley.edu/Pubs/TechRpts/2013/EECS-2013-172.pdf||shape="rect"]] processor.
103	103

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-10748084
	1	+10751491

URL

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