|
|
|
|
|
The Dagstuhl seminar on "Parallel and Distributed Algorithms" generally deals with a wide range of topics, including parallel data structures, models of parallel computation, parallel complexity theory, efficient algorithms for PRAMs, networks of processors or workstations, and Boolean circuits, and randomization techniques for parallel algorithms.
This time (being the sixth in its series) special emphasis will be put on dynamic load balancing and communication problems. Besides the discussion of current problems in the field of parallel and distributed algorithms, our main goal is to deal with questions that arise for routing problems, access to global variables, dynamic generation of tasks, the design and modeling of appropriate protocols and tools for their analysis, like stochastic analysis, adversary models, or competitive analysis.
To goal of this workshop is to gather experts for dynamic communication and load balancing problems and to discuss and compare models as mentioned above, to investigate their significance and their robustness, and to discuss their relevance for applications as well as their theoretical properties.
We understand this seminar to be an interface between fundamental theoretical problems and application oriented questions.
Reports on previous Seminars on this topic are still available at Dagstuhl office, the last two can be downloaded as PS-Files.Report No. 8, E.W. Mayr, F. Meyer a.d. Heide, Parallel and Distributed Algorithms,
Seminar No. 9110, 04.03.-08.03.91
Report No. 33, R. Cole, E.W. Mayr, F. Meyer a.d. Heide, Parallel and Distributed Algorithms,
Seminar No. 9210, 02.03.-06.03.92
Report No. 72, R. Cole, E.W. Mayr, F. Meyer a.d. Heide, Parallel and Distributed Algorithms,
Seminar No. 9337, 13.09.-17.09.93
Report No. 125, C. Dwork, E.W. Mayr, F. Meyer a.d. Heide, Parallel and Distributed Algorithms,
Seminar No. 9537, 11.09.-15.09.95
Report No. 188, E.W. Mayr, F. Meyer a.d. Heide, L. Rudolph, Parallel and Distributed Algorithms,
Seminar No. 9737, 08.09.-12.09.97