Master thesis: Application of force-directed graph layout techniques in scientific workflow editing
Scientific workflows are commonly modelled as directed compound graphs where nodes represent (computational) tasks and edges represent dependencies or control flow between the tasks. A set of challenging problems arises when graphical workflow editors allow the user to freely place graph components in the workflow diagram. For instance, when the user resizes one of the nodes, one would like to displace surrounding edges and nodes as to avoid overlaps, while modifying the whole workflow graph as little as possible at the same time. One of the most promising ways of dealing with this and similar problems is the application of force-directed graph layouts that model node displacement with repelling forces, while using attracting forces to hold workflow parts in their original positions in an attempt to maintain the overall workflow structure. This approach, however, depends on many modelling choices and parameters, which are supposed to be systematically and empirically explored in this thesis.
Requirements:
- Solid Java programming skills
- Experience in software engineering (theory and practice)
- Basic knowledge of graph theory and computational geometry
- Proficiency in English
Preferably:
- Deeper insight into graph layout and drawing
- Practical skills regarding graphical user interfaces
- Experience with workflow systems, distributed systems, web services or Grid computing
Please send your application to:
Bastian Demuth
Jülich Supercomputing Centre
Forschungszentrum Jülich
52425 Jülich
Germany
Phone: 02461/61-6587
E-mail: b.demuth@fz-juelich.de
