Abstract
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.
Keywords
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.
Partially supported by DFG-SFB 376 “Massively Parallel Computation”.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Hromkovic, J.: Algorithmics for hard problems. Springer, Heidelberg (2003)
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)
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)
Sakamoto, T., Sekiguchi, T., Yonezawa, A.: Bytecode Transformation for Portable Thread Migration in Java. Technical Report, University of Tokyo (2000)
Ma, M., Wang, C., Lau, F.: Delta Execution: A preemptive Java thread migration mechanism. Cluster Computing, 3, 83 (2000)
distributed.net, http://www.distributed.net/
Gehweiler, J.: Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java. Studienarbeit, Universität Paderborn (2003)
Great Internet Mersenne Prime Search (GIMPS), http://www.mersenne.org/
JavaGo RMI, http://www.joachim-gehweiler.de/software/javago.php
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)
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)
Bonorden, O., Juurlink, B., von Otte, I., Rieping, I.: The Paderborn University BSP (PUB) Library. Parallel Computing 29(2), 187–207 (2003)
The Paderborn University BSP (PUB) Library, http://wwwcs.unipaderborn.de/~pub/
The Paderborn University BSP-based Web Computing Library (PUBWCL), http://wwwcs.uni-paderborn.de/~pubwcl/
Search for Extraterrestrial Intelligence (SETI@home), http://setiathome.berkeley.edu/
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)
Fünfrocken, S.: Transparent Migration of Java-base Mobile Agents. Technical Report, Universität Darmstadt (1998)
Valiant, L.: A bridging model for parallel computation. Communications of the ACM 33(8), 103–111 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bonorden, O., Gehweiler, J., der Heide, F.M.a. (2006). A Web Computing Environment for Parallel Algorithms in Java. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2005. Lecture Notes in Computer Science, vol 3911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11752578_96
Download citation
DOI: https://doi.org/10.1007/11752578_96
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34141-3
Online ISBN: 978-3-540-34142-0
eBook Packages: Computer ScienceComputer Science (R0)