Abstract
Sciddle 4.0 makes it possible to use remote procedure calls (RPCs) within the PVM environment. Parallelism is achieved through asynchronous RPCs. No explicit message passing is necessary. Rather all data transfers occur within the RPCs.
In Sciddle, an application is decomposed into a client process and an arbitrary number of server processes. Servers are special PVM tasks that are ready to execute RPCs from their clients. Servers can also start other servers themselves. Thus the topology of a Sciddle application can be described by a tree structure.
Sciddle applications enjoy the safety and ease of use of RPCs. They are also extremely portable as PVM becomes available on more and more platforms. In this paper we show that the overhead introduced by Sciddle is minimal and can be neglected for applications with large data sets.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
P. Arbenz, H. P. Lüthi, J. E. Mertz, and W. Scott, Applied Distributed Supercomputing in Homogeneous Networks, International Journal of High Speed Computing, 4, 87–108, 1992.
P. Arbenz, H. P. Lüthi, Ch. Sprenger, and S. Vogel, Sciddle: A Tool for Large Scale Distributed Computing, Concurrency: Practice and Experience, 7, 121–146, 1995.
H. Casanova, J. Dongarra, and W. Jiang, The Performance of PVM on Massively Parallel Processing Systems, Tech. Report CS-95-301, University of Tennessee, Computer Science Department, Knoxville, TN, August 1995, http://www.cs.utk.edu/∼library/TechReports/1995/ut-cs-95-301.ps.Z.
A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam, PVM, Parallel Virtual Machine: A Users' Guide and Tutorial for Networked Parallel Computing, The MIT Press, Cambridge, MA, 1994.
H. P. Lüthi and J. Almlöf, Network Supercomputing: A Distributed-Concurrent Direct SCF Scheme, Theoretica Chimica Acta, 84, 443–455, 1993.
The MathWorks Inc., MATLAB, High-Performance Numeric Computation and Visualization Software, Natick, Massachusetts, 1992.
H. Poxon and L. Costello, Network PVM Performance, Cray Research Inc., Software Division, Eagan, MN, unpublished manuscript, June 1995.
Ch. Sprenger, User's Guide to Sciddle Version 3.0, Technical Report 208, ETH Zürich, Computer Science Department, December 1993, ftp://ftp.inf.ethz.ch/pub/publications/tech-reports/2xx/208.ps.
V. Strumpen, The Network Machine, Diss. ETH No. 11227, Swiss Federal Institute of Technology (ETH), Zürich, 1995, ftp://ftp.inf.ethz.ch/pub/publications/dissertations/th11227.ps.
V. Sunderam, G. A. Geist, J. Dongarra, and R. Manchek, The PVM Concurrent Computing System: Evolution, Experiences, and Trends, Parallel Computing, 20, 531–545, 1994.
St. Vogel, J. Hutter, T. H. Fischer, and H. P. Lüthi, Direct SCF Structure Optimization of Large Molecules on Networks of Workstations, International Journal of Quantum Chemistry, 45, 665–678, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arbenz, P., Gander, W., Lüthi, H.P., von Matt, U. (1996). Sciddle 4.0, or, remote procedure calls in PVM. In: Liddell, H., Colbrook, A., Hertzberger, B., Sloot, P. (eds) High-Performance Computing and Networking. HPCN-Europe 1996. Lecture Notes in Computer Science, vol 1067. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61142-8_632
Download citation
DOI: https://doi.org/10.1007/3-540-61142-8_632
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61142-4
Online ISBN: 978-3-540-49955-8
eBook Packages: Springer Book Archive