Advertisement

Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications”

  • Friedhelm Meyer auf der Heide
  • Thomas Decker
Conference paper
Part of the Informatik aktuell book series (INFORMAT)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    B. Awerbuch, Y Bartal, and A. Fiat:Competitive distributed file allocation, Proc. of the 25th ACM Symp. on Theory of Computing (STOC), pages 164 – 173, 1993.Google Scholar
  2. 2.
    B. Awerbuch, Y Bartal, and A. Fiat:Distributed paging for general networks, Proc. of the 7th ACM Symp. on Discrete Algorithms (SODA), pages 574 – 583, 1996.Google Scholar
  3. 3.
    Y Bartal:Survey on distributed paging, Proc. of the Dagstuhl Workshop on On-line Algorithms, 1996.Google Scholar
  4. 4.
    R. D. Blumhofe, C. E. Leiserson:Scheduling Multithreaded Computations by Work Stealing, Proc. 36th Symp. on Foundations of Computer Science (FOCS’ 95 ), pp. 356 – 368, 1995.Google Scholar
  5. 5.
    P Berenbrink, F. Meyer auf der Heide, V Stemann: Fault Tolerant Shared Memory Simulations.Proc.13th Symp. on Theoretical Aspects of Computer Science, pp. 181 – 192, 1996.Google Scholar
  6. 6.
    P Berenbrink,F Meyer auf der Heide, K. Schröder:Allocating Weighted Jobs in Parallel, Proc. of 9th ACM Symp. on Parallel Algorithms and Architectures (SPAR 97), to appear.Google Scholar
  7. 7.
    A. Czumaj, F. Meyer auf der Heide, V. Stemann:Shared memory simulations with triplelogarithmic delay, Proc. of 3rd European bbbp m Symposium on Algorithms (ESA), pp. 46 – 59, 1995.Google Scholar
  8. 8.
    A. Czumaj, F. Meyer auf der Heide, V. Stemann:Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures, Technical Report SFB tr-rsfb96-006, Paderborn University, Jan. 1996.Google Scholar
  9. 9.
    A. Czumaj, F. Meyer auf der Heide, V Stemann:Contention Resolution in Hashing Based Shared Memory Simulations, Technical Report SFB tr-rsfb-96-005, Paderborn University, Dec. 1996, and: Information and Computation, to appear.Google Scholar
  10. 10.
    R. Cypher, F. Meyer auf der Heide, C. Scheideler, and B. Vöcking:Universal algorithms for store-and forward and wormhole routing, Proc. of the 26th ACM Symp. on Theory of Computing (STOC), pages 356 – 365, 1996.Google Scholar
  11. 11.
    T. Decker:Virtual Data Space - A Universal Load Balancing Scheme, Proc. 4th Int. Symp. on Solving Irregularly Structured Problems in Parallel, IRREGULAR’ 97, 1997, to appear.Google Scholar
  12. 12.
    T. Decker, R. Diekmann:Mapping of Coarse-Grained Applications onto WorkstationClusters, Proc. 5th Euromicro Workshop on Parallel and Distr. Processing, pp. 5 – 12, 1997.Google Scholar
  13. 13.
    T. Decker, R. Diekmann, R. Lüling, B. Monien:Towards Developing Universal Dynamic Mapping Algorithms, 7th IEEE Symp. on Parallel and Distr. Processing, 1995, pp. 456 – 459.CrossRefGoogle Scholar
  14. 14.
    R. Diekmann, B. Monien, R. Preis: Load Balancing Strategies for Distributed Memory Machines, F.Karsch, H. Satz (ed. ): “Multi-Scale Phenomena and their Simulation”, World Scientific, 1997 (to appear). Google Scholar
  15. 15.
    R. Feldmann, P Mysliwietz, B. Monien: A fully distributed chess program,Advances in Computer Chess VI, Ellis Horwood Publishers, pp. 1–27, 1991. Google Scholar
  16. 16.
    R. Karp, M. Luby, F. Meyer auf der Heide: Efficient FRAM simulation on a distributed memory machine,Algorithmica, (16), pp. 517 – 542, 1996.Google Scholar
  17. 17.
    R. Luling:Lastverteilung zur effizienten Nutzung paralleler Systeme, Ph.D. Theses, ShakerVerlag, 1996, to appear.Google Scholar
  18. 18.
    F. T. Leighton, B. M. Maggs, A. G. Ranade, and S. B. Rao: Randomized routing and sorting on fixed-connection networks,Journal of Algorithms, (17), pp. 157 – 205, 1994.MathSciNetzbMATHCrossRefGoogle Scholar
  19. 19.
    C. Lund, N. Reingold, J. Westbrook, and D. Yan:On-line distributed data management, Proc. of the 2nd European Symposium on Algorithms (ESA), 1996.Google Scholar
  20. 20.
    B. Maggs, F. Meyer auf der Heide, B. Vöcking, and M. Westermann:Exploiting locality for networks of limited bandwidth, Techn. Report tr-rsfb-97–042, University of Paderborn, 1997.Google Scholar
  21. 21.
    F. Meyer auf der Heide, B. Vöcking: Apacket routing protocol for arbitrary networks, Proc. 12th Symp. on Theoretical Aspects of Computer Science (STACS), pages 291 – 302, 1995.Google Scholar
  22. 22.
    F. Meyer auf der Heide, B. Vöcking:Static and dynamic data management in networks, Proc. of Euro-Par’ 97, to appear.Google Scholar
  23. 23.
    R. Ostrovsky and Y Rabani:Universal O(congestion -f- dilation + log1+en) local control packet switching algorithms, Proc. of the 29th ACM Symp. on Theory of Computing (STOC), to appear, 1997.Google Scholar
  24. 24.
    A. G. Ranade:How to emulate shared memory, Proc. of the 28th IEEE Symp. on Foundations of Computer Science (FOCS), pages 185 – 194, 1987.Google Scholar
  25. 25.
    C.-Z. Xu, B. Monien, R. Luling, F. C. M. Lau:An Analytical Comparison of Nearest Neighbour Algorithms for Load Balancing in Parallel ComputersProc. of International Parallel Processing Symposium (IPPS’ 95 ), pp. 472 – 479, 1995.Google Scholar
  26. 26.
    C.-Z. Xu, S. Tschoke, B. Monien:Performance Evaluation of Load Distribution Strategies in Parallel Branch and Bound Computations Proc. 7th Symposium on Parallel and Distributed Processing (SPDP’ 95 ), pp. 402 – 405, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Friedhelm Meyer auf der Heide
    • 1
  • Thomas Decker
    • 1
  1. 1.Department of Mathematics and Computer Science and Heinz Nixdorf InstituteUniversity of PaderbornGermany

Personalised recommendations