VAN RENESSE, R., VAN STAVEREN, H., AND WANENBAUM, A. S. Performance of the world's fastest distributed operating system. Oper. Syst. Rev. 22, 4 (Oct. 1988), 25-34. Received May 1989; revised September 1989; accepted October 1989 ACM Transactions on Computer Systems, Vol. 8, No. 1, February 1990.  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
MICHAEL D. SCHROEDER and MICHAEL BURROWS - Digital Equipment Corporation (2003) (Correct)
....Also, the fast path is abandoned more often by lock conflicts on a uniprocessor. Even with just one caller thread, the interrupt code can require a lock held by the caller or server thread. It is plausible that better uniprocessor throughput could be achieved by an RPC design, like Amoeba s [9], V s [3] or Sprite s [6] that streamed a large argument or result from a single call in multiple packets, rather than depended on multiple threads transferring just a packet s worth of data per call. The streaming strategy requires fewer thread to thread context switches. 6. OTHER SYSTEMS ....
....reported performance of different systems. ACM Transactions on Computer Systems, Vol. 8, No. 1, February 1990. 16 M. Schroeder and M. Burrows Table XII. Performance of Remote RPC in Other Systems System Machine Processor MIPs ms call Mbits s Cedar [2] Dorado Custom I x 4 1.1 2. 0 Amoeba [9] Tadpole M68020 I x 1.5 1.4 5.3 V [3] Sun 3 75 M68020 I x 2 2.5 4.4 Sprite [6] Sun 3 75 M68020 I x 2 2.8 5.6 Amoeba UNIX 4 [9] Sun 3 50 M68020 I x 1.5 7.0 1.8 Firefly FF MicroVAX II I x I 4.8 2.5 Firefly FF MicroVAX II 5 x i 2.7 4.6 It is clear from the literature that developers of ....
[Article contains additional citation context not shown here]
VAN RENESSE, R., VAN STAVEREN, H., AND WANENBAUM, A. S. Performance of the world's fastest distributed operating system. Oper. Syst. Rev. 22, 4 (Oct. 1988), 25-34. Received May 1989; revised September 1989; accepted October 1989 ACM Transactions on Computer Systems, Vol. 8, No. 1, February 1990.
Gathering And Using Time Measurements In Distributed Systems - Dietz (1996) (Correct)
.... What happens if an unstable clock is used for interval measurements in a performance study For example, suppose one wants to measure the time it takes to perform a null remote procedure call [Null RPC] A measuring technique often reported in such studies is to take the minimum of repeated calls [Che84, Kar89, Lie83, Mul84, vRvST88, SB89]. Intuitively this method is appropriate because, although the length of a Null RPC is deterministic, it may trigger other features of the operating system which are not (such as a memory fault) The minimum of several calls equals the time taken by the Null RPC itself, while the larger values ....
van Renesse, R., van Staveran, H., and A.S. Tanenbaum. Performance of the World's Fastest Distributed Operating System. Operating Systems Review, (Oct) 1988, 25-34.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC