BSPlab is an environment for experimenting with BSP programs on different computer architectures. Parallel applications are written in Visual C++ using the BSPlib standard for communication and synchronisation. The BSPlib is the result of the standardisation effort within BSP programming made by BSP World Wide. The user may select among various predefined parallel computer architectures. Currently, these are shared memory, distributed shared memory, network of workstations, or multiprocessors with message passing organised in various network topologies. The user may also develop user-defined architectures. The BSP programs are debugged and executed in BSPlab to achieve (simulated) performance measures and hopefully a better understanding of the interplay between hardware (i.e. architecture) and software (i.e. BSP-programs). BSPlab is primarily an environment for studying BSP computations with focus on the impact of algorithms and architectures on BSP program performance. However, BSPlab can also be used as a programming environment for BSP applications developed for real parallel computers running BSPlib.

BSPlab was developed as the diploma work of Haakon Dybdahl and Ivan Uthus from august 1996 to february 1997 under the supervision of Lasse Natvig. The work was done in Group for Computer Architecture and Design, a part of the Department of Computer and Information Science (IDI), at Norwegian University of Science and Technology (NTNU) in Trondheim, Norway.

BSPlab Copyright Notice

NEW! A short introduction to BSPlab 16 slides

Table of contents

  1. What is BSPlab? (short summary)
  2. Documentation
  3. Download instructions and installation guide
  4. How to give feedback, mailing list
  5. Future plans
  6. Using BSPlab, a very simple example
  7. Pointers to available BSP-programs
  8. Known bugs, suggested fixes, (updates)
  9. A collection of relevant pointers

1. What is BSPlab?

We are working on a paper describing BSPlab in a more compact way than the complete BSPlab report, which is a large document. However, as short introductions, we can currently offer: [Back to table of contents]

2. Available documentation

The diploma thesis written by Haakon and Ivan is a large document. It has been split into 9 main parts. All the parts, and the paper mentioned just above, have been packed in a zip-file called [ ]

We also plan to make a BSPlab FAQ-list (Frequently Asked Questions).

[Back to table of contents]

3. Download instructions

[Back to table of contents]

4. Feedback, mailing list, and user registration.

All feedback about BSPlab should be e-mailed to "bsplab [AT] idi [dot] ntnu [dot] no" We appriciate if you send any information such as why you are interested in BSP and BSPlab, your experience with BSPlab, comments to BSPlab, suggestions for improvemenst on BSPlab and these web-pages, etc. etc.
[Back to table of contents]

5. Future plans

Here is a short list of our plans for future work on BSPlab:

[Back to table of contents]

6. Using BSPlab, examples

See chapter 7 (The BSPSim User's Guide) and chapter 9 (Testing of The Simulator) in the report by Dybdahl and Uthus. It is found in part 3 and part 5 of the documentation respectively. We hope to provide more examples in the future.

[Back to table of contents]

7. Pointers to available BSP programs

Here we plan to provide a list of pointers to web-pages offering BSP programs that run in the BSPlab environment.
  • The regular BSPlab installation contains several BSP programs. Some examples are ...
  • If you have run a BSP program on BSPlab that other people may have interest in, please send a pointer to bsplab AT idi DOT ntnu DOT no
  • More will come....
[Back to table of contents]

8. Know bugs, suggested fixes, updates

  • This will start as a list, but probably grow into a page :-)
[Back to table of contents]

9. Some relevant pointers

[Back to table of contents]

No of accesses since 1 jan. 1998: ******
URL of this page:


Responsible for contents: Lasse Natvig
Send comments to: bsplab AT idi DOT ntnu DOT no
Last modified: Tue Apr 25 13:02:24 MET DST 2000