Literatur

Habilitationsschriften, Dissertationen, Diplomarbeiten

[Bon02] BONORDEN, OLAF: Ein System zur automatischen Konfiguration effizienter paralleler Algorithmen im BSP-Modell.

Diplomarbeit, Universität Paderborn, 2002.

PDF , Postscript

[Geh03] GEHWEILER, JOACHIM: Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java.

Studienarbeit, Universität Paderborn, Mai 2003.

[Kau02] KAUFMANN, PAUL: Experimentelle Auswertung kurzperiodischer, insbesondere 2-dimensionaler Sortierverfahren.

Studienarbeit, Universität Paderborn, August 2002.

[Sch01] SCHMIDT, GUNNAR: Über die Spektren wichtiger Graphklassen.

Studienarbeit, Universität Paderborn, September 2001.

[Soh03] SOHLER, CHRISTIAN: Property Testing and Geometry.

Dissertation, Universität Paderborn, HNI Verlagsschriftenreihe Vol.119, 2003.

Postscript

[Zie02] ZIEGLER, MARTIN: Zur Berechenbarkeit reeller geometrischer Probleme.

Dissertation, Universität Paderborn, HNI Verlagsschriftenreihe Vol.115, 2002.

Abstract, PDF

Begutachtete Publikationen des Teilprojektes

[BBF+02] BODLAENDER, HANS L., HAJO BROERSMA, FEDOR V. FOMIN, ARTEM V. PYATKIN AND GERHARD J. WÖGINGER: Radio labeling with pre-assigned frequencies.

In Proc. of the 10th Annual European Symposium on Algorithms (ESA2002), Seiten 211-222. Springer Verlag Lecture Notes in Computer Science 2461, 2002.

PDF

[BJvOR03] BONORDEN, OLAF, BEN H.H. JUURLINK, INGO VON OTTE AND INGO RIEPING: The Paderborn University BSP (PUB) Library.

Parallel Computing, 29(2):187-207, Februar 2003.

Abstract, PDF , Postscript

[BMW02] BONORDEN, OLAF, FRIEDHELM MEYER AUF DER HEIDE AND ROLF WANKA: Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example.

In ARABNIA, HAMID R. (Herausgeber): Proc. of the Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA), 2002.

Abstract, PDF , Postscript

[BvzGG+01] BONORDEN, OLAF, JOACHIM VON ZUR GATHEN, JÜRGEN GERHARD, OLAF MÜLLER AND MICHAEL NÖCKER: Factoring a binary Polynomial of Degree over one Million.

ACM SIGSAM Bulletin, 35(1):16-18, 2001.

[EKZ01] EMAMY-K., M. REZA AND MARTIN ZIEGLER: New Bounds for Hypercube Slicing Numbers.

In Discrete Mathematics and Theoretical Computer Science (DMTCS), Special Issue: Proc. of the 1st conference Discrete Models, Computational and Combinatorial Geometry (DM-CCG), Seiten 155-163, Paris, 2001.

[FFF01] FIALA, JIRI, ALEXEI V. FISHKIN AND FEDOR V. FOMIN: On-line and Off-line distance constrained labeling of disk graphs.

In 9th European Symposium on Algorithms (ESA2001), Seiten 464-476, 2001.

[JKMR] JUURLINK, BEN H.H., PETR KOLMAN, FRIEDHELM MEYER AUF DER HEIDE AND INGO RIEPING: Optimal Broadcast on Parallel Locality Models.

Journal of Discrete Algorithms - selected papers of SIROCCO 2000, Seiten 151-166, April 2003, Vol. 1, No. 2, Elsevier publishers.

[JR01] JUURLINK, BEN AND INGO RIEPING: Performance Relevant Issues for Parallel Computation Models.

In ARABNIA, HAMID R. (Herausgeber): Proc. of the Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA), volume 4, Seiten 1841-1847, 2001.

Postscript

[KS01] KOLMAN, PETR AND CHRISTIAN SCHEIDELER: Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.

In Proc. 13th ACM Symposium on Parallel Algorithms and Architectures (SPAA), Seiten 38-47, 2001.

Postscript

[MW01] MEYER AUF DER HEIDE, FRIEDHELM AND ROLF WANKA: Parallel Bridging Models and Their Impact on Algorithm Design.

In Proc. of the Int. Conf. on Computational Science (ICCS), volume II, Seiten 628-637. Springer Verlag, 2001.

Abstract, Postscript

[PS01] PICCOLBONI, ANTONIO AND CHRISTIAN SCHINDELHAUER: Discrete Prediction Games with arbitrary Feedback and Loss.

In 14th Annual Conference on Computational Learning Theory, COLT 2001 and 5th European Conference on Computational Learning Theory, EuroCOLT 2001, Seiten 208-223, 2001.

PDF

[Wan02] WANKA, ROLF: Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs is Asymptotically Optimal.

In Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2002.

Sonstige Publikationen des Teilprojektes

[BW03] BONORDEN, OLAF AND ROLF WANKA: BSP on heterogenous dynamic architectures.

Manuscript, 2003.

[LMSM03] LEONARDI, S., A. MARCHETTI-SPACCAMELA AND F. MEYER AUF DER HEIDE: Scheduling independent tasks on a parallel system with unpredictable performance changes.

Manuscript, 2003.

[Pub02] PUB-Library, Release 8.0, User Guide and Function Reference.

http://www.upb.de/~pub/, 2002.

[SW02] SCHMIDT, GUNNAR AND ROLF WANKA: The spectra of popular hypercubic networks.

Manuscript, 2002.

Allgemeine Literaturliste

[AL] ALBERS, SUSANNE AND STEFANO LEONARDI: Online Algorithms.

To appear.

[BBTW00] BEDNARA, MARCUS, OLIVER BEYER, JÜRGEN TEICH AND ROLF WANKA: Tradeoff Analysis and Architecture Design of a Hybrid Hardware/Software Sorter.

In Proc. of the Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP), Seiten 299-308, 2000.

Abstract, Postscript

[BEY98] BORODIN, ALLAN AND RAN EL-YANIV: Online Computation and Competitive Analysis.

Cambridge University Press, 1998.

Abstract

[BL98] BARAK, AMNON AND OREN LA'ADAN: The MOSIX Multicomputer Operating System for High Performance Cluster Computing.

Journal of Future Generation Computer Systems, 13(4-5):361-372, March 1998.

PDF , Postscript

[BLH00] BALLEREAU, OLIVIER, FREDERIC LOULERGUE AND GAETAN HAINS: High-level BSP Programming: BSML and BS $\lambda$ .

In MICHAELSON, G. AND PH. TRINDER (Herausgeber): Trends in Functional Programming, Seiten 29-38. Intellect Books, 2000.

Abstract, Postscript

[cal03] CALL: A Complexity Analysis Tool, Projekt-Homepage.

http://nereida.deioc.ull.es/~call/, 2003.

[CG01] CÉRIN, CHRISTOPHE AND JEAN-LUC GAUDIOT: Benchmarking Clusters of Workstations Through Parallel Sorting and BSP Libraries.

Parallel Processing Letters, (1):25-40, 2001.

Abstract, PDF

[dis] distributed.net Project Homepage.

http://www.distributed.net/.

[DK96] DE LA TORRE, P. AND C. P. KRUSKAL: Submachine Locality in the Bulk Synchronous Setting.

In EUROPAR: Parallel Processing, 2nd International EURO-PAR Conference, Seiten 352-358. LNCS, 1996.

[EMP00] ELSÄSSER, ROBERT, BURKHARD MONIEN AND ROBERT PREIS: Diffusive Load Balancing Schemes on Heterogeneous Networks.

12th ACM Symposium on Parallel Algorithms and Architectures (SPAA), Seiten 30-38, 2000.

Abstract, PDF

[GLC01] GU, YAN, BU-SUNG LEE AND WENTONG CAI: JBSP: A BSP Programming Library in Java.

Journal of Parallel and Distributed Computing, 61(8):1126-1142, 2001.

Postscript

[GMV91] GIL, JOSEPH, YOSSI MATIAS AND UZI VISHKIN: Towards a theory of nearly constant time parallel algorithms.

In Proc. of the 32nd Symposium on Foundations of Computer Science, Seiten 698-710, 1991.

Postscript

[GMW96] GIL, JOSEPH, FRIEDHELM MEYER AUF DER HEIDE AND AVI WIGDERSON: The Tree Model for Hashing: Lower and Upper Bounds.

SIAM Journal on Computing, 25(5):939-955, 1996.

[GV92] GERBESSIOTIS, ALEXANDROS V. AND LESLIE G. VALIANT: Direct Bulk-Synchronous Parallel Algorithms.

Technischer Bericht TR-10-92, Harvard University, Computer Science Department, 1992.

Abstract, Postscript

[Hag92] HAGERUP, TORBEN: The log-star revolution.

In Proc. of the 9th Annual Symposium on Theoretical Aspects of Computer Science, volume 577, Seiten 259-278. Springer Verlag Lecture Notes in Computer Science, 1992.

[Jav03] JavaGo, Projekt-Homepage.

http://web.yl.is.s.u-tokyo.ac.jp/amo/JavaGo/doc/index-e.html, Stand 2003.

[JHJV02] JARVIS, STEVEN A., JONATHAN M.D. HILL, CONSTANTINOS J.SINIOLAKIS AND VASIL P. VASILEV: Portable and Architecture Independent Parallel Performance Tuning using BSP.

Parallel Computing, 28(11):1587-1609, 2002.

PDF , Postscript

[JKMR00] JURLINK, BEN H.H., PETR KOLMAN, FRIEDHELM MEYER AUF DER HEIDE AND INGO RIEPING: Optimal Broadcast on Parallel Locality Models.

In Proc. of 7th International Colloquium on Structural Information and Com munication Complexity - Sirocco 2000, Proceedings in Informatics, Seiten 211-226. Carleton Scientific, June 2000.

Abstract, Postscript

[{Jur}01] JURAJ HROMKOVI¸: Algorithmics for Hard Problems.

Springer-Verlag, 2001.

Abstract

[JW96] JUURLINK, BEN H.H. AND HARRY A.G. WIJSHOFF: Communication primitives for BSP computers.

Information Processing Letters, 58:303-310, 1996.

[LTBL97] LITZKOW, MICHAEL, TODD TANNENBAUM, JIM BASNEY AND MIRON LIVNY: Checkpoint and Migration of UNIX Processes in the Condor Distributed Proce ssing System.

Technischer Bericht 1346, University of Wisconsin-Madison Computer Sciences, April 1997.

PDF , Postscript

[MPS02] MITZENMACHER, MICHAEL, BALAJI PRABHAKAR AND DEVAVRAT SHAH: Load Balancing with Memory.

In 43rd Symposium on Foundations of Computer Science (FOCS), Seiten 799-808, 2002.

PDF

[N{"o}c01] NÖCKER, MICHAEL: Data structures for parallel exponentiation in finite fields.

Dissertation, Universität Paderborn, http://ubdata.uni-paderborn.de/ediss/17/2001/noecker/index.htm, 2001.

Abstract, PDF

[RSW02] RÄCKE, HARALD, CHRISTIAN SOHLER AND MATTHIAS WESTERMANN: Online Scheduling for Sorting Buffers.

In Proc. of the 10th ESA (Rome), Seiten 820-832, 2002.

Abstract, Postscript

[set] Seti@Home Project Homepage.

http://setiathome.ssl.berkeley.edu/.

[TR92] T., SETZ AND ROTH R.: LIPS: a System for Distributed Processing on Workstations.

Technischer Bericht SFB 124 TP D5, Universität des Saarlandes, 1992.

Abstract, Postscript

Literaturliste 1998-2000, 1996-1998

Navigationshilfe:

Olaf Bonorden

[Bon02]	BONORDEN, OLAF: Ein System zur automatischen Konfiguration effizienter paralleler Algorithmen im BSP-Modell.
	Diplomarbeit, Universität Paderborn, 2002.
	PDF , Postscript
[Geh03]	GEHWEILER, JOACHIM: Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java.
	Studienarbeit, Universität Paderborn, Mai 2003.
[Kau02]	KAUFMANN, PAUL: Experimentelle Auswertung kurzperiodischer, insbesondere 2-dimensionaler Sortierverfahren.
	Studienarbeit, Universität Paderborn, August 2002.
[Sch01]	SCHMIDT, GUNNAR: Über die Spektren wichtiger Graphklassen.
	Studienarbeit, Universität Paderborn, September 2001.
[Soh03]	SOHLER, CHRISTIAN: Property Testing and Geometry.
	Dissertation, Universität Paderborn, HNI Verlagsschriftenreihe Vol.119, 2003.
	Postscript
[Zie02]	ZIEGLER, MARTIN: Zur Berechenbarkeit reeller geometrischer Probleme.
	Dissertation, Universität Paderborn, HNI Verlagsschriftenreihe Vol.115, 2002.
	Abstract, PDF

[BBF+02]	BODLAENDER, HANS L., HAJO BROERSMA, FEDOR V. FOMIN, ARTEM V. PYATKIN AND GERHARD J. WÖGINGER: Radio labeling with pre-assigned frequencies.
	In Proc. of the 10th Annual European Symposium on Algorithms (ESA2002), Seiten 211-222. Springer Verlag Lecture Notes in Computer Science 2461, 2002.
	PDF
[BJvOR03]	BONORDEN, OLAF, BEN H.H. JUURLINK, INGO VON OTTE AND INGO RIEPING: The Paderborn University BSP (PUB) Library.
	Parallel Computing, 29(2):187-207, Februar 2003.
	Abstract, PDF , Postscript
[BMW02]	BONORDEN, OLAF, FRIEDHELM MEYER AUF DER HEIDE AND ROLF WANKA: Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example.
	In ARABNIA, HAMID R. (Herausgeber): Proc. of the Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA), 2002.
	Abstract, PDF , Postscript
[BvzGG+01]	BONORDEN, OLAF, JOACHIM VON ZUR GATHEN, JÜRGEN GERHARD, OLAF MÜLLER AND MICHAEL NÖCKER: Factoring a binary Polynomial of Degree over one Million.
	ACM SIGSAM Bulletin, 35(1):16-18, 2001.
[EKZ01]	EMAMY-K., M. REZA AND MARTIN ZIEGLER: New Bounds for Hypercube Slicing Numbers.
	In Discrete Mathematics and Theoretical Computer Science (DMTCS), Special Issue: Proc. of the 1st conference Discrete Models, Computational and Combinatorial Geometry (DM-CCG), Seiten 155-163, Paris, 2001.
[FFF01]	FIALA, JIRI, ALEXEI V. FISHKIN AND FEDOR V. FOMIN: On-line and Off-line distance constrained labeling of disk graphs.
	In 9th European Symposium on Algorithms (ESA2001), Seiten 464-476, 2001.
[JKMR]	JUURLINK, BEN H.H., PETR KOLMAN, FRIEDHELM MEYER AUF DER HEIDE AND INGO RIEPING: Optimal Broadcast on Parallel Locality Models.
	Journal of Discrete Algorithms - selected papers of SIROCCO 2000, Seiten 151-166, April 2003, Vol. 1, No. 2, Elsevier publishers.

[JR01]	JUURLINK, BEN AND INGO RIEPING: Performance Relevant Issues for Parallel Computation Models.
	In ARABNIA, HAMID R. (Herausgeber): Proc. of the Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA), volume 4, Seiten 1841-1847, 2001.
	Postscript
[KS01]	KOLMAN, PETR AND CHRISTIAN SCHEIDELER: Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.
	In Proc. 13th ACM Symposium on Parallel Algorithms and Architectures (SPAA), Seiten 38-47, 2001.
	Postscript
[MW01]	MEYER AUF DER HEIDE, FRIEDHELM AND ROLF WANKA: Parallel Bridging Models and Their Impact on Algorithm Design.
	In Proc. of the Int. Conf. on Computational Science (ICCS), volume II, Seiten 628-637. Springer Verlag, 2001.
	Abstract, Postscript
[PS01]	PICCOLBONI, ANTONIO AND CHRISTIAN SCHINDELHAUER: Discrete Prediction Games with arbitrary Feedback and Loss.
	In 14th Annual Conference on Computational Learning Theory, COLT 2001 and 5th European Conference on Computational Learning Theory, EuroCOLT 2001, Seiten 208-223, 2001.
	PDF
[Wan02]	WANKA, ROLF: Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs is Asymptotically Optimal.
	In Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2002.

[BW03]	BONORDEN, OLAF AND ROLF WANKA: BSP on heterogenous dynamic architectures.
	Manuscript, 2003.
[LMSM03]	LEONARDI, S., A. MARCHETTI-SPACCAMELA AND F. MEYER AUF DER HEIDE: Scheduling independent tasks on a parallel system with unpredictable performance changes.
	Manuscript, 2003.
[Pub02]	PUB-Library, Release 8.0, User Guide and Function Reference.
	http://www.upb.de/~pub/, 2002.
[SW02]	SCHMIDT, GUNNAR AND ROLF WANKA: The spectra of popular hypercubic networks.
	Manuscript, 2002.

[AL]	ALBERS, SUSANNE AND STEFANO LEONARDI: Online Algorithms.
	To appear.
[BBTW00]	BEDNARA, MARCUS, OLIVER BEYER, JÜRGEN TEICH AND ROLF WANKA: Tradeoff Analysis and Architecture Design of a Hybrid Hardware/Software Sorter.
	In Proc. of the Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP), Seiten 299-308, 2000.
	Abstract, Postscript
[BEY98]	BORODIN, ALLAN AND RAN EL-YANIV: Online Computation and Competitive Analysis.
	Cambridge University Press, 1998.
	Abstract
[BL98]	BARAK, AMNON AND OREN LA'ADAN: The MOSIX Multicomputer Operating System for High Performance Cluster Computing.
	Journal of Future Generation Computer Systems, 13(4-5):361-372, March 1998.
	PDF , Postscript
[BLH00]	BALLEREAU, OLIVIER, FREDERIC LOULERGUE AND GAETAN HAINS: High-level BSP Programming: BSML and BS $\lambda$ .
	In MICHAELSON, G. AND PH. TRINDER (Herausgeber): Trends in Functional Programming, Seiten 29-38. Intellect Books, 2000.
	Abstract, Postscript
[cal03]	CALL: A Complexity Analysis Tool, Projekt-Homepage.
	http://nereida.deioc.ull.es/~call/, 2003.
[CG01]	CÉRIN, CHRISTOPHE AND JEAN-LUC GAUDIOT: Benchmarking Clusters of Workstations Through Parallel Sorting and BSP Libraries.
	Parallel Processing Letters, (1):25-40, 2001.
	Abstract, PDF
[dis]	distributed.net Project Homepage.
	http://www.distributed.net/.
[DK96]	DE LA TORRE, P. AND C. P. KRUSKAL: Submachine Locality in the Bulk Synchronous Setting.
	In EUROPAR: Parallel Processing, 2nd International EURO-PAR Conference, Seiten 352-358. LNCS, 1996.
[EMP00]	ELSÄSSER, ROBERT, BURKHARD MONIEN AND ROBERT PREIS: Diffusive Load Balancing Schemes on Heterogeneous Networks.
	12th ACM Symposium on Parallel Algorithms and Architectures (SPAA), Seiten 30-38, 2000.
	Abstract, PDF
[GLC01]	GU, YAN, BU-SUNG LEE AND WENTONG CAI: JBSP: A BSP Programming Library in Java.
	Journal of Parallel and Distributed Computing, 61(8):1126-1142, 2001.
	Postscript
[GMV91]	GIL, JOSEPH, YOSSI MATIAS AND UZI VISHKIN: Towards a theory of nearly constant time parallel algorithms.
	In Proc. of the 32nd Symposium on Foundations of Computer Science, Seiten 698-710, 1991.
	Postscript
[GMW96]	GIL, JOSEPH, FRIEDHELM MEYER AUF DER HEIDE AND AVI WIGDERSON: The Tree Model for Hashing: Lower and Upper Bounds.
	SIAM Journal on Computing, 25(5):939-955, 1996.
[GV92]	GERBESSIOTIS, ALEXANDROS V. AND LESLIE G. VALIANT: Direct Bulk-Synchronous Parallel Algorithms.
	Technischer Bericht TR-10-92, Harvard University, Computer Science Department, 1992.
	Abstract, Postscript
[Hag92]	HAGERUP, TORBEN: The log-star revolution.
	In Proc. of the 9th Annual Symposium on Theoretical Aspects of Computer Science, volume 577, Seiten 259-278. Springer Verlag Lecture Notes in Computer Science, 1992.
[Jav03]	JavaGo, Projekt-Homepage.
	http://web.yl.is.s.u-tokyo.ac.jp/amo/JavaGo/doc/index-e.html, Stand 2003.
[JHJV02]	JARVIS, STEVEN A., JONATHAN M.D. HILL, CONSTANTINOS J.SINIOLAKIS AND VASIL P. VASILEV: Portable and Architecture Independent Parallel Performance Tuning using BSP.
	Parallel Computing, 28(11):1587-1609, 2002.
	PDF , Postscript
[JKMR00]	JURLINK, BEN H.H., PETR KOLMAN, FRIEDHELM MEYER AUF DER HEIDE AND INGO RIEPING: Optimal Broadcast on Parallel Locality Models.
	In Proc. of 7th International Colloquium on Structural Information and Com munication Complexity - Sirocco 2000, Proceedings in Informatics, Seiten 211-226. Carleton Scientific, June 2000.
	Abstract, Postscript
[{Jur}01]	JURAJ HROMKOVI¸: Algorithmics for Hard Problems.
	Springer-Verlag, 2001.
	Abstract
[JW96]	JUURLINK, BEN H.H. AND HARRY A.G. WIJSHOFF: Communication primitives for BSP computers.
	Information Processing Letters, 58:303-310, 1996.
[LTBL97]	LITZKOW, MICHAEL, TODD TANNENBAUM, JIM BASNEY AND MIRON LIVNY: Checkpoint and Migration of UNIX Processes in the Condor Distributed Proce ssing System.
	Technischer Bericht 1346, University of Wisconsin-Madison Computer Sciences, April 1997.
	PDF , Postscript
[MPS02]	MITZENMACHER, MICHAEL, BALAJI PRABHAKAR AND DEVAVRAT SHAH: Load Balancing with Memory.
	In 43rd Symposium on Foundations of Computer Science (FOCS), Seiten 799-808, 2002.
	PDF
[N{"o}c01]	NÖCKER, MICHAEL: Data structures for parallel exponentiation in finite fields.
	Dissertation, Universität Paderborn, http://ubdata.uni-paderborn.de/ediss/17/2001/noecker/index.htm, 2001.
	Abstract, PDF
[RSW02]	RÄCKE, HARALD, CHRISTIAN SOHLER AND MATTHIAS WESTERMANN: Online Scheduling for Sorting Buffers.
	In Proc. of the 10th ESA (Rome), Seiten 820-832, 2002.
	Abstract, Postscript
[set]	Seti@Home Project Homepage.
	http://setiathome.ssl.berkeley.edu/.
[TR92]	T., SETZ AND ROTH R.: LIPS: a System for Distributed Processing on Workstations.
	Technischer Bericht SFB 124 TP D5, Universität des Saarlandes, 1992.
	Abstract, Postscript