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

Content

...	...	@@ -1,11 +1,5 @@
1		-Here's a selection of possible bachelor and master topics. If you're interested in one of them, don't hesitate to contact us! We'll sit down, have tea, and talk about what we great things we could do together.
	1	+Here's a selection of possible bachelor and master topics. If you're interested in one of them, don't hesitate to contact us! We'll sit down, have tea, and talk about what we could do together.
2	2
3		-**On this Page**
4		-
5		-
6		-
7		-{{toc/}}
8		-
9	9	= Bachelor Topics =
10	10
11	11	== Graph Layout ==
...	...	@@ -14,9 +14,7 @@
14	14	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.
15	15	* **{{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**
16	16	Implement an alternative algorithm for the layer assignment problem used in the layer-based approach to graph layout.
17		-* **Tight Packing of Connected Components**
18		-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.
19		-* **{{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**
	11	+* **Integrate KIML with JGraph**
20	20	Provide automatic layout through KIML for the JGraph diagram library and develop a simple JGraph-based graph editor to test the integration with.
21	21	* **{{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**
22	22	Our layout algorithm already supports the placement of edge labels. However, there's still room for improvement...
...	...	@@ -44,17 +44,7 @@
44	44	Develop an automatic SCCharts documentation system
45	45	* **Optimizations for the SCCharts compiler **[possibly also Master Topic]
46	46	Profile the actual SCCharts compiler and apply optimizations
47		-* **Multi-core SCCharts compiler **[possibly also Master Topic]
48		-Implement the possibility to use more than one core to compile large SCCharts
49		-* **Adding dataflow to SCCharts** [possibly also Master Topic]
50		-Add dataflow to SCCharts
51	51
52		-== PRETSY / PRETSY2 ==
53		-
54		-* **Real-time extensions for SCCharts** [possibly also Master Topic]
55		-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.
56		-* See also Semantics and Synchronous Languages: **Adding dataflow to SCCharts**
57		-
58	58	== Miscellaneous Topics ==
59	59
60	60	* **Developing an Info Screen**
...	...	@@ -64,9 +64,6 @@
64	64
65	65	= (% style="color: rgb(0,0,0);" %)Master Topics(%%) =
66	66
67		-(% style="color: rgb(0,0,0);" %)(see also Bachelor Topics for potentially expansible topics)
68		-
69		-
70	70	== Graph Layout ==
71	71
72	72	* **Layering Algorithms**
...	...	@@ -82,6 +82,8 @@
82	82
83	83	== Modeling Pragmatics ==
84	84
	64	+
	65	+
85	85	* **Diagram Description Language**
86	86	Developing the concepts and implementation of a diagram description language based on Klighd, with SyncCharts as application example.
87	87
...	...	@@ -93,18 +93,11 @@
93	93	Implement the SyncCharts priority-based compilation approach into the SCCharts compiler chain.
94	94	* **Curing Schizophrenia in SCCharts**
95	95	Develop new synchronizer to handle schizophrenia properly (e.g. depth join).
	77	+* **Adding dataflow to SCCharts**
	78	+Add dataflow to SCCharts
96	96	* **Detecting tick boundaries in SCCharts**
97	97	Implement an algorithm that detects tick boundaries (in concurrent) threads and therefore improves the scheduling
98		-* **Multithreaded/Multicore execution of SCCharts **(see below PRETSY/PRETSY2)**
99		-**
	81	+* **Preserving concurrency for multi-core **
	82	+Evaluate possibilities to preserve parallelism in SCCharts**.**
100	100	* **Railway 2.0**
101	101	Design a new and modern hardware controlling (Version 4) for the railway installation.
102		-
103		-== PRETSY / PRETSY2 ==
104		-
105		-* **Multithreaded/Multicore execution of SCCharts**
106		-Evaluate possibilities to preserve parallelism in SCCharts, implement mapping for (fine grained) multithreading and multicore
107		-based on the [[FlexPRET>>url:http://www.eecs.berkeley.edu/Pubs/TechRpts/2013/EECS-2013-172.pdf||shape="rect"]] processor.**
108		-**
109		-
110		-

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-10747970
	1	+9471794

URL

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