Abstract
This paper explores the performance behavior of two core services of the OSF DCE, RPC (Remote Procedure Call) and threads. The RPC performance is gauged as a function of the length of argument(s) passed. We show that:
-
DCE RPC performance behavior with or without security features is linear with the length of the messages and is comparable to that of a commonly available RPC technology once the client and server are fully bound to each other,
-
authentication on RPCs is inexpensive, and
-
encryption and integrity on messages do not come cheap.
We also demonstrate that multi-threading increases throughput even on a single processor system and how much the throughput is improved in comparison with multiple single-threaded processes. The effect of multi-threading a client process on throughput and response time as a function of the number of threads is brought out.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Open Software Foundation, Introduction to OSF DCE, Prentice-Hall, 1992.
W. Rosenbury, and D. Kenney, Understanding DCE, O'Reilly & Associates, Inc., June 1992.
J. Shirley, Guide to Writing DCE Applications, O'Reilly & Associates, Inc., June 1992.
B. Dasarathy, Experience with OSF™ DCE: A Perspective, Panel Discussion on the OSF DCE: User Experiences and Perspective, Proceedings of the UniForum 1993, San Francisco, 1993, pp. 723–724.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dasarathy, B., Khalil, K., Ruddock, D.E. (1993). Some DCE performance analysis results. In: Schill, A. (eds) DCE — The OSF Distributed Computing Environment Client/Server Model and Beyond. DCE 1993. Lecture Notes in Computer Science, vol 731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57306-2_25
Download citation
DOI: https://doi.org/10.1007/3-540-57306-2_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57306-7
Online ISBN: 978-3-540-48048-8
eBook Packages: Springer Book Archive