A Web Computing Environment for Parallel Algorithms in Java

  • Olaf Bonorden
  • Joachim Gehweiler
  • Friedhelm Meyer auf der Heide
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3911)


We present a web computing library (PUBWCL) in Java that allows to execute strongly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style on PCs distributed over the internet whose owners are willing to donate their unused computation power.

PUBWCL is realized as a peer-to-peer system and features migration and restoration of BSP processes executed on it.

The use of Java guarantees a high level of security and makes PUBWCL platform independent. In order to estimate the loss of efficiency inherent in such a Java-based system, we have compared it to our C-based PUB-Library.


Parallel Algorithm Parallel Program Benchmark Program Barrier Synchronization Migratable Program 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Hromkovic, J.: Algorithmics for hard problems. Springer, Heidelberg (2003)zbMATHGoogle Scholar
  2. 2.
    Sarmenta, L.: An Adaptive, Fault-tolerant Implementation of BSP for Java-based Volunteer Computing Systems. In: Rolim, J.D.P. (ed.) IPPS-WS 1999 and SPDP-WS 1999. LNCS, vol. 1586, pp. 763–780. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  3. 3.
    Hill, J., McColl, B., Stefanescu, D., Goudreau, M., Lang, K., Rao, S., Suel, T., Tsantilas, T., Bisseling, R.: The BSP Programming Library. Technical Report, University of Oxford (1997)Google Scholar
  4. 4.
    Sakamoto, T., Sekiguchi, T., Yonezawa, A.: Bytecode Transformation for Portable Thread Migration in Java. Technical Report, University of Tokyo (2000)Google Scholar
  5. 5.
    Ma, M., Wang, C., Lau, F.: Delta Execution: A preemptive Java thread migration mechanism. Cluster Computing, 3, 83 (2000)Google Scholar
  6. 6.,
  7. 7.
    Gehweiler, J.: Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java. Studienarbeit, Universität Paderborn (2003)Google Scholar
  8. 8.
    Great Internet Mersenne Prime Search (GIMPS),
  9. 9.
  10. 10.
    Bonorden, O., Gehweiler, J., der Meyer auf Heide, F.: Load Balancing Strategies in a Web Computing Environment. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Waśniewski, J. (eds.) PPAM 2005. LNCS, vol. 3911, Springer, Heidelberg (2006)Google Scholar
  11. 11.
    Truyen, E., Robben, B., Vanhaute, B., Coninx, T., Joosen, W., Verbaeten, P.: Portable Support for Transparent Thread Migration in Java. Technical Report, K.U. Leuven, Heverlee, Belgium (2000)Google Scholar
  12. 12.
    Bonorden, O., Juurlink, B., von Otte, I., Rieping, I.: The Paderborn University BSP (PUB) Library. Parallel Computing 29(2), 187–207 (2003)CrossRefGoogle Scholar
  13. 13.
    The Paderborn University BSP (PUB) Library,
  14. 14.
    The Paderborn University BSP-based Web Computing Library (PUBWCL),
  15. 15.
    Search for Extraterrestrial Intelligence (SETI@home),
  16. 16.
    Sekiguchi, T., Masuhara, H., Yonezawa, A.: A Simple Extension of Java Language for Controllable Transparent Migration and its Portable Implementation. Technical Report, University of Tokyo (1999)Google Scholar
  17. 17.
    Fünfrocken, S.: Transparent Migration of Java-base Mobile Agents. Technical Report, Universität Darmstadt (1998)Google Scholar
  18. 18.
    Valiant, L.: A bridging model for parallel computation. Communications of the ACM 33(8), 103–111 (1990)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Olaf Bonorden
    • 1
  • Joachim Gehweiler
    • 1
  • Friedhelm Meyer auf der Heide
    • 1
  1. 1.Heinz Nixdorf Institute, Computer Science DepartementPaderborn UniversityPaderbornGermany

Personalised recommendations