Abstract
A major research area in the University of Paderborn is Parallel Computing. Next to computer scientists, also researchers in mathematics, electrical and machine engineering, and manufacturing technology employ the computation power of parallel and distributed systems. Further, many institutions of our university focus on research related to this topic: the Paderborn Center for Parallel Computing (PC2) offers support for efficient, comfortable use of parallel machines not only to users of the Paderborn or other universities, but also to users in international industries. Parallel computing in the Heinz Nixdorf Institute and its DFG-Graduate College ranges from basic research to applications in manufacturing technology. The C-LAB, a joint venture with Siemens Nixdorf Informationssysteme AG, contributes design methodology for complex distributed real time systems. All these activities are supported within numerous projects, by, e.g., DFG, BMBF, EU, and industry.
This work is supported by the “DFG Sonderforschungsbereich 376 : Massive Parallelität — Algorithmen, Entwurfsmethoden, Anwendungen” and by the EU ESPRIT Long Term Research Project 20244 (ALCOM-IT). More information about the SFB can be found on our web-pages under http://www.uni-paderborn.de/SFB376.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
Y Bartal:Survey on distributed paging, Proc. of the Dagstuhl Workshop on On-line Algorithms, 1996.
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.
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.
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.
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.
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.
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.
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.
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.
T. Decker, R. Diekmann:Mapping of Coarse-Grained Applications onto WorkstationClusters, Proc. 5th Euromicro Workshop on Parallel and Distr. Processing, pp. 5 – 12, 1997.
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.
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).
R. Feldmann, P Mysliwietz, B. Monien: A fully distributed chess program,Advances in Computer Chess VI, Ellis Horwood Publishers, pp. 1–27, 1991.
R. Karp, M. Luby, F. Meyer auf der Heide: Efficient FRAM simulation on a distributed memory machine,Algorithmica, (16), pp. 517 – 542, 1996.
R. Luling:Lastverteilung zur effizienten Nutzung paralleler Systeme, Ph.D. Theses, ShakerVerlag, 1996, to appear.
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.
C. Lund, N. Reingold, J. Westbrook, and D. Yan:On-line distributed data management, Proc. of the 2nd European Symposium on Algorithms (ESA), 1996.
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.
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.
F. Meyer auf der Heide, B. Vöcking:Static and dynamic data management in networks, Proc. of Euro-Par’ 97, to appear.
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.
A. G. Ranade:How to emulate shared memory, Proc. of the 28th IEEE Symp. on Foundations of Computer Science (FOCS), pages 185 – 194, 1987.
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.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meyer auf der Heide, F., Decker, T. (1997). Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications”. In: Jarke, M., Pasedach, K., Pohl, K. (eds) Informatik ’97 Informatik als Innovationsmotor. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60831-5_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-60831-5_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63066-1
Online ISBN: 978-3-642-60831-5
eBook Packages: Springer Book Archive