Rob Bisseling

Name          : Rob Bisseling
Function      : Professor in Scientific Computing
Department    : Mathematics
                Utrecht University
                the Netherlands
Postal Address: PO Box 80010
                3508 TA Utrecht
                the Netherlands
For visiting  : Budapestlaan 6
                De Uithof
                room MI 517
Email (note the spam prevention) : R. H. Bisseling "AT" uu. nl 
Phone         : +31 30-2531481
Fax           : +31 30-2518394

Invited lecture at SIAM Conference on Parallel Processing for Scientific Computation / SIAM Workshop on Combinatorial Scientific Computation, Seattle, USA, February 12, 2020

Parallel Tomographic Reconstruction - Where Combinatorics Meets Geometry by Rob H. Bisseling. (46 MB. The PDF file contains a movie in mp4 format. It works best with Acrobat Reader, and you have to enable reading of the mp4 file.)

Bug fix release of Mondriaan 4.2.1 (August 8, 2019)

Information on the Mondriaan package.

Download the latest version of the Mondriaan software, version 4.2.1 (tar gzipped).

Bulk: a Modern C++ Interface for Bulk-Synchronous Parallel Programs (August 20, 2018)

Bulk: a Modern C++ Interface for Bulk-Synchronous Parallel Programs by Jan-Willem Buurlage, Tom Bannink, and Rob H. Bisseling, in Proceedings Euro-Par 2018, Lecture Notes in Computer Science, Vol. 11014, Springer, 2018, pp. 519-532. Published version. Software available from Bulk repository on Github.

Release of Mondriaan 4.2 (September 17, 2017)

Version 4.2 contains several improvements compared to version 4.1. These are:

Right: linocut "Dr. Mondrian" by Henk van der Vorst (August 2010). Henk's web gallery.

New: release of SAWdoubler version 2.0 (March 28, 2017)

SAWdoubler software. SAWdoubler is a software package for counting the number of self-avoiding walks on a regular lattice, based on the length-doubling method described in: Exact enumeration of self-avoiding walks by Raoul D. Schram, Gerard T. Barkema, and Rob H. Bisseling, Journal of Statistical Mechanics: Theory and Experiment (2011) p06019.

The aim of the package is to enable counting self-avoiding walks on a variety of lattices, and stimulate research into this topic. Please feel free to explore the possibilities of modifying this program. Have fun!

New features of version 2.0:

Results on the BCC and FCC lattice are obtained and analysed in Exact enumeration of self-avoiding walks on BCC and FCC lattices by Raoul D. Schram, Gerard T. Barkema, Rob H. Bisseling, and Nathan Clisby", arXiv:1703.09340 [cond-mat.stat-mech] March 27, 2017. Accepted for publication in Journal of Statistical Mechanics: Theory and Experiment.

New: Slides (in Dutch) Lunchlezing tentoonstelling Imaginary, February 8, 2017, Stadskantoor Utrecht

Slides of the lecture Wiskunde in Stijl; van Mondriaan tot matrix
Download of the embedded movies: Matrix LNS_3937
Matrix pi

New: Hot Topic in ACM Computing Reviews (June 2016)

Thinking in Sync: The Bulk-Synchronous Parallel Approach to Large-Scale Computing by Rob H. Bisseling and Albert-Jan N. Yzelman, ACM Computing reviews, Vol. 57, No. 6 (2016), pp. 322-327. Essay on state-of-the-art in bulk-synchronous parallel computing, with related web resources.

Oratie (Inaugural lecture)

Tuesday December 8, 2009 16.15 hour: Oratie Rob Bisseling, "Parallel, groen en snel" (in Dutch), Aula Academiegebouw, Domplein 29, Utrecht.



Proceedings 58th European Study Group Mathematics with Industry, Utrecht 29 Jan. - 2 Feb. 2007. Edited by Rob Bisseling, Karma Dajani, Tammo Jan Dijkema, Johan van de Leur, Paul Zegeling. Published 30 December 2007. 115 pages. PDF file of book (2.6 MB). Topics: Modeling a heart pump (AMC), cabin crew rostering (KLM), sampling for maskless lithography of computer chips (ASML), optimising a closed greenhouse (Innogrow), optimising a 7-tesla MRI scanner for individual patients (UMC), pricing options based on variable interest rates and volatilities (ING). Website of the Study Group.

Parallel Scientific Computation: A Structured Approach using BSP and MPI, by Rob H. Bisseling, Oxford University Press, March 2004. 324 pages. ISBN 978-0-19-852939-2. Official home page of the book at the UK site of Oxford University Press. The page contains a detailed description of the book contents, but also the complete first chapter, 49 pages, as a sample in PDF format. This chapter is a primer on BSP and BSPlib.

Electronic version from Oxford Scholarship Online (OSO). Available since September 2007. The book is available as part of a collection of 1300 Online books from Oxford University Press. The full texts of the collection are accessible if your library has subscribed to OSO.

This book is the first text explaining how to use the bulk synchronous parallel (BSP) model and the freely available BSPlib communication library in parallel algorithm design and parallel programming. Aimed at upper level undergraduates, graduate students and researchers in mathematics, physics and computer science, the main topics treated in the book are core topics in the area of scientific computation and many additional topics are treated in numerous exercises. An appendix on the message-passing interface (MPI) discusses how to program in BSP style using the MPI communication library. MPI equivalents of all the programs are also presented.

Book page at Amazon (US). New feature: this page gives access to sample pages, complete table of contents, index, front/back cover, and it allows you to search in the complete text. It even has a concordance: the most frequently used words (out of 78,753) are: processor (903), matrix (624), algorithm (522), distribution (519), communication (419), vector (406), cost (334), parallel (320), number (312), superstep (297), row (292), computation (285), time (283), data (282).
Book page at Barnes and Noble (US).
An extensive book review has appeared in ACM Computing Reviews June 5, 2006 by Diego Llanos. Other book reviews have appeared in Scalable Computing: Practice and Experience Volume 7, No. 2, June 2006 by Ami Marowka; Zentralblatt MATH 2006, by Willi Schonauer; Jahresbericht der DMV 2005 (in German) by Timo von Oertzen.
Additional teaching material is available through my parallel algorithms course page: PDF files of my lectures, which closely follow the book; their sources in LaTeX. This allows teachers (and students) to adapt my material and replace my jokes by better ones. The material is now complete and covers all sections of the book (January 24, 2007).

What's new?


My research interests are

Courses in 2017/2018

Courses in 2016/2017

Some of my work

Interesting links

Meet me at

Last update of this page: February 14, 2020