Vorbesprechung mit Themenvergabe: Do 14.07.2005, 11:15 Uhr, HS IV (Lahnberge)
Es sind noch 3 Themen zu vergeben. Bitte wenden Sie sich bei Interesse an Frau Prof. Dr. Loogen.
Beginn: Dienstag, 8. November 2005

• Parallele Modelle
  1. Einführung und Überblick
     S. Forteva , Termin: 8.11.2005, Ausarbeitung, Klassifikation, Vortragsfolien
     Literatur:
     • D.B. Skillicorn, D. Talia: Models and Languages for Parallel Computation, ACM Computing Surveys, Vol. 30, No. 2, June 1998.
     • D.B. Skillicorn, S. Pelagatti: Building Programs in the Network of Tasks Model, SAC'00, ACM 2000..
  2. Linda und JavaSpaces
     Michael Heidt , Termin: 15.11.2005, Ausarbeitung, Vortragsfolien
     Literatur:
     • Nicholas Carriero and David Gelernter: How to Write Parallel Programs: A Guide to the Perplexed, ACM Computing Surveys, Sept., 1989.
     • N. Carriero, D. Gelernter: Linda in context, Communications of the ACM, Volume 32 Issue 4, April 1989´.
     • JavaSpaces Spezifikation
  3. Bulk Synchronous Programming (BSP) und LogP
     Simone Geisel , Termin: 22.11.2005, Ausarbeitung,
     Literatur:
     • Valiant, L. G., 1990. A Bridging Model for Parallel Computation, Communications of the ACM, 33:8, August 1990, pages 103-111.
     • Culler, D., Karp, R., Patterson, D., Sahay, A., Schauser, K. E., Santos, E., Subramonian, R., and von Eicken, T. 1993. LogP: Towards a Realistic Model of Parallel Computation, Proceedings of the Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, May 1993, pages 1-12.
     • Gianfranco Bilardi, Kieran T Herley, Andrea Pietracaprina, Geppino Pucci, Paul Spirakis: BSP vs LogP, ACM SPAA 96, Padua Italy 1996.
  4. Parallele Array-Sprachen
     noch zu vergeben
     Literatur:
     • SAC - Single Assignment C
     • HPF - High Performance Fortran
     • ZPL
• Skelett-Programmierung
  2 Themen noch zu vergeben
  5. Structured Coordination Language (SCL)
     Literatur:
     • Darlington et al.: Parallel Skeletons for Structured Composition, PPoPP 95.
  6. P3L
     Martin Scholl, Termin: 29.11.2005 fällt aus, neuer Termin: 31.01.2006
     Literatur:
     • B. Bacci, M. Danelutto, S. Orlando, S. Pelagatti and M. Vanneschi, P3L: A structured high level programming language and its structured support, in Concurrency: Practice and Experience vol.7 n.3, pages 225--255, May 1995
     • M. Danelutto, R. Di Meglio, S. Orlando, S. Pelagatti and M. Vanneschi A methodology for the development and the support of massively parallel programs in Future Generation Computer Systems , North Holland Volume 8 (1992) Numbers 1-3, July 1992.
  7. MPI-Skelettbibliotheken
     Literatur:
     • H. Kuchen: The Munster Skeleton Library Muskel
     • M. Cole, A. Benoit: The Edinburgh Skeleton Library eSkel
• Funktionale Programmierung
  8. Nebenläufige Programmierung in Haskell mit komponierbaren Speichertransaktionen
     Bastian Zapf, Termin: 6.12.2005,Ausarbeitung
     Literatur:
     • SL Peyton Jones, A Gordon, S Finne: Concurrent Haskell, 23rd ACM Symposium on Principles of Programming Languages, St Petersburg Beach, Florida, Jan 1996, pp295-308.
     • Tim Harris, Simon Marlow, Simon Peyton Jones, and Maurice Herlihy: Composable memory transactions, PPoPP 2005.
• Parallele Algorithmen
  9. Bestimmung minimal aufspannender Bäume
     Gassan Gousseinov , Termin: 13.12.2005, Der Vortrag fällt aus! Literatur:
     • KA WONG CHONG et al.: Concurrent Threads and Optimal Parallel Minimum Spanning Trees Algorithm, Journal of the ACM, Vol. 48, No. 2, March 2001, pp. 297–323.
     • Micah Adler, Wolfgang Dittrich, Ben Juurlink, Miroslaw Kutylowski, Ingo Rieping: Communication-Optimal Parallel Minimum Spanning Tree Algorithms, SPAA 98.
  10. Sortieren auf PRAMS
      Michael Lemler , Termin: 10.01.2006, Ausarbeitung
      Literatur:
      • Yijie Han and Xiaojun Shen: Parallel Integer Sorting Is More Efficient than Parallel Exclusive Write PRAMS, Proceedings of the 10th ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics, January 1999.
      • Lasse Natvig: Logarithmic Time Cost Optimal Parallel Sorting is Not Yet Fast in Practice! , Proceedings of the 1990 conference on Supercomputing, ACM Press 1990.
  11. Radix Sort
      Svetlana Tumanskaya , Termin: 17.01.2006, Ausarbeitung
      Literatur:
      • Daniel Jiménez-González Juan J. Navarro Josep-L. Larriba-Pey: Fast Parallel In-Memory 64-bit Sorting, ICS ’01 Sorrento, Italy
      • Andrew Sohn, Yuetsu Kodamai: Load Balanced Parallel Radix Sort, ICS'98, Melbourne Australia.
  12. Das N-Body-Problem
      Matthias Graefenhan, Termin: 24.01.2006, fällt aus, neuer Termin: 07.02.2006
      Literatur:
      • Yu Hu and S. Lennart Johnsson: A Data–Parallel Implementation of O(N) Hierarchical N–body Methods, Proceedings of the 1996 ACM/IEEE conference on Supercomputing, ACM Press, IEEE Computer Society 1996
      • David Blackston, Torsten Suel: Highly Portable and Efficient Implementations of Parallel Adaptive N-Body Methods, ACM. Proceedings of the 1997 ACM/IEEE conference on Supercomputing, ACM Press 1997.