Results 1 - 10 of 633

Performance of Firefly RPC

by Michael D. Schroeder, Michael Burrows - ACM TRANSACTIONS ON COMPUTER SYSTEMS , 1990
"... In this paper we report on the performance of the remote procedure call (RPC) implementation for the Firefly multiprocessor and analyze the implementation to account precisely for all measured latency. From the analysis and measurements, we estimate how much faster RPC could be if certain improvemen ..."
Abstract - Cited by 148 (1 self) - Add to MetaCart
In this paper we report on the performance of the remote procedure call (RPC) implementation for the Firefly multiprocessor and analyze the implementation to account precisely for all measured latency. From the analysis and measurements, we estimate how much faster RPC could be if certain

Performance of Firefly RPC

by Michael Schroeder And, Michael D. Schroeder, Michael Burrows - ACM Transactions on Computer Systems , 1989
"... In this paper, we report on the performance of the remote procedure call implementation for the Firefly multiprocessor and analyze the implemen-tation to account precisely for all measured latency. From the analysis and measurements, we estimate how much faster RPC could be if certain improve-ments ..."
Abstract - Add to MetaCart
In this paper, we report on the performance of the remote procedure call implementation for the Firefly multiprocessor and analyze the implemen-tation to account precisely for all measured latency. From the analysis and measurements, we estimate how much faster RPC could be if certain improve-ments

Performance of Firefly RPC

by Nadia Nedjah, Luiza De Macedo Mourelle - INFORMATICA , 1990
"... Generally speaking, public-key cryptographic systems consist of raising elements of some group such as GF(2n), Z/NZ or elliptic curves, to large powers and reducing the result modulo some given element. Such operation is often called modular exponentiation and is performed using modular multiplicati ..."
Abstract - Cited by 8 (0 self) - Add to MetaCart
Generally speaking, public-key cryptographic systems consist of raising elements of some group such as GF(2n), Z/NZ or elliptic curves, to large powers and reducing the result modulo some given element. Such operation is often called modular exponentiation and is performed using modular

ABSTRACT PERFORMANCE OF FIREFLY RPC

by unknown authors
"... In this paper, we report on the performance of the remote procedure call implementation for the Firefly multiprocessor and analyze the implementation to account precisely for all measured latency. From the analysis and measurements, we estimate how much faster RFC could be if certain improvements we ..."
Abstract - Add to MetaCart
In this paper, we report on the performance of the remote procedure call implementation for the Firefly multiprocessor and analyze the implementation to account precisely for all measured latency. From the analysis and measurements, we estimate how much faster RFC could be if certain improvements

Implementing remote procedure calls

by Andrew D. Birrell, Bruce Jay Nelson - ACM Transactions on Computer Systems , 1984
"... Remote procedure calls (RPC) appear to be a useful paradig m for providing communication across a network between programs written in a high-level language. This paper describes a package providing a remote procedure call facility, the options that face the designer of such a package, and the decisi ..."
Abstract - Cited by 1059 (5 self) - Add to MetaCart
, and the decisions ~we made. We describe the overall structure of our RPC mechanism, our facilities for binding RPC clients, the transport level communication protocol, and some performance measurements. We include descriptioro ~ of some optimizations used to achieve high performance and to minimize the load

Lightweight remote procedure call

by Brian N. Bershad, Thomas E. Anderson, Edward D. Lazowska, Henry M. Levy - ACM Transactions on Computer Systems , 1990
"... Lightweight Remote Procedure Call (LRPC) is a communication facility designed and optimized for communication between protection domains on the same machine. In contemporary small-kernel operating systems, existing RPC systems incur an unnecessarily high cost when used for the type of communication ..."
Abstract - Cited by 292 (26 self) - Add to MetaCart
the control transfer and communication model of capability systems with the programming semantics and large-grained protection model of RPC. LRPC achieves a factor-of-three performance improvement over more traditional approaches based on independent threads exchanging messages, reducing the cost of same

Building Secure and Reliable Network Applications

by Kenneth Birman , 1996
"... ly, the remote procedure call problem, which an RPC protocol undertakes to solve, consists of emulating LPC using message passing. LPC has a number of "properties" -- a single procedure invocation results in exactly one execution of the procedure body, the result returned is reliably deliv ..."
Abstract - Cited by 230 (16 self) - Add to MetaCart
ly, the remote procedure call problem, which an RPC protocol undertakes to solve, consists of emulating LPC using message passing. LPC has a number of "properties" -- a single procedure invocation results in exactly one execution of the procedure body, the result returned is reliably

The Peregrine High-performance RPC system

by David B. Johnson, Willy Zwaenepoel , 1993
"... This paper identifies some of the key performance optimizations used in Peregrine, and quantitatively assesses their benefits ..."
Abstract - Cited by 39 (3 self) - Add to MetaCart
This paper identifies some of the key performance optimizations used in Peregrine, and quantitatively assesses their benefits

Performance of DCE RPC

by A. M. Khandker, P. Honeyman - In Proceedings, 2nd International Conference on Services in Distributed and Networked Environments , 1995
"... ..."
Abstract - Cited by 6 (2 self) - Add to MetaCart
Abstract not found

Improving the performance of maxRPC

by Thanasis Balafoutis, Anastasia Paparrizou, Kostas Stergiou, Toby Walsh - In Proceedings of CP-2010 , 2010
"... Abstract. Max Restricted Path Consistency (maxRPC) is a local consistency for binary constraints that can achieve considerably stronger pruning than arc consistency. However, existing maxRPC algorithms suffer from overheads and redundancies as they can repeatedly perform many constraint checks witho ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Abstract. Max Restricted Path Consistency (maxRPC) is a local consistency for binary constraints that can achieve considerably stronger pruning than arc consistency. However, existing maxRPC algorithms suffer from overheads and redundancies as they can repeatedly perform many constraint checks
Results 1 - 10 of 633