Abstract
Interoperability in non-sequential applications requires communication to exchange information using either the shared-memory or message-passing paradigm. In the past, the communication paradigm in use was determined through the architecture of the underlying computing platform. Shared-memory computing systems were programmed to use shared-memory communication, whereas distributed-memory architectures were running applications communicating via message-passing. Current trends in the architecture of parallel machines are based on shared-memory and distributed-memory. For scalable parallel applications, in order to maintain transparency and efficiency, both communication paradigms have to coexist. Users should not be obliged to know when to use which of the two paradigms. On the other hand, the user should be able to exploit either of the paradigms directly in order to achieve the best possible solution.
The paper presents the VOTE communication support system. VOTE provides coexistent implementations of shared-memory and message-passing communication. Applications can change the communication paradigm dynamically at runtime, thus are able to employ the underlying computing system in the most convenient and application-oriented way. The presented case study and detailed performance analysis underpins the applicability of the VOTE concepts for high-performance parallel computing.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L.M. Adams, H.F. Jordan, “Is SOR Color Blind?” In SIAM Sci. Stat. Computation, Vol. 7, No. 2, pp. 490–506, 1986.
U. Brüning, W.K. Giloi, W. Schröder-Preikschat, “Latency Hiding in Message Passing Architectures”, In Proceedings of the International Parallel Processing Symposium, IPPS-8, pp. 704–709, Cancun, Mexico, Apr., 1994.
G. Cabillic, T. Priol, I. Puaut, “Myoan: An Implementation of the Koan Shared Virtual Memory on the Intel Paragon”, Technical Report, 812, Irisa, Rennes, France, Apr., 1994.
J. Cordsen (ed.), “The SODA Project”, Studien der GMD, Nr. 301, ISBN 3-88457-301-2, October, 1996.
K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta, J. Hennessy, “Memory Consistency and Event Ordering in Scalable Shared-Memory Multiprocessors”, In Proceedings of the 17th International Symposium on Computer Architecture, pp. 15–26, 28–31th May, 1990.
W. Gropp, E. Lusk, “An Abstract Device Definition to Support the Implementation of a High-Level Point-to-Point Message-Passing Interface”, Technical Report MCS-P342-1193, Argonne National Laboratory, Argonne, IL 60439, 1993.
W. Gropp, E. Lusk, A. Skjellum, “Using MPI: Portable Parallel Programming with the Message-Passing Interface”, MIT Press, ISBN 0-262-57104-8, Oct., 1994.
P.T. Koch, R. J. Fowler, E. Jul, “Message-Driven Relaxed Consistency in a Software Distributed Shared Memory”, In Proceedings of the First USENIX Symposium on Operating Systems Designs and Implementation, pp. 75–85, Nov., 1994.
D. Kranz, K. Johnson, A. Agarwal, J. Kubiatowicz, B.-H. Lim, “Integrating Message-Passing and Shared-Memory: Early Experience”, In Proceedings of the 4th Symposium on Principles and Practice of Parallel Programming, pp. 54–63, May, 1993.
J. Kuskin, D. Ofelt, M. Heinrich, J. Heinlein, R. Simoni, K. Gharachorloo, J. Chapin, D. Nakahira, J. Baxter, M. Horowitz, A. Gupta, M. Rosenblum, J. Hennessy, “The Stanford FLASH Multiprocessor”, In Proceedings of the 21st Annual International Symposium on Computer Architecture, pp. 302–313, Apr., 1994.
L. Lamport, “How to make a Multiprocessor Computer that Correctly Executes Multiprocessor Programs”, In IEEE Transactions on Computers, Vol. C-28, No. 9, pp. 241–248, Sep., 1979.
Parsytec, “Parix Programmer's Manual”, Parsytec Computer GmbH, Aachen, Germany, 1991.
A. Geist, A. Beguelin, J.J. Dongorra, W. Jiang, R. Manchek, V.S. Sunderam, “Pvm 3 User's Guide and Reference Manual”, Technical Report Ornl/Tm-12187, Oak Ridge National Laboratory, Oak Ridge, USA, May, 1993.
W. Schröder-Preikschat, “The Logical Design of Parallel Operating Systems”, Prentice-Hall, ISBN 0-13-183369-3.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cordsen, J., Schröder-Preikschat, W. (1997). On the coexistence of shared-memory and message-passing in the programming of parallel applications. In: Hertzberger, B., Sloot, P. (eds) High-Performance Computing and Networking. HPCN-Europe 1997. Lecture Notes in Computer Science, vol 1225. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031643
Download citation
DOI: https://doi.org/10.1007/BFb0031643
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62898-9
Online ISBN: 978-3-540-69041-2
eBook Packages: Springer Book Archive