Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Nathan Glasser

dblp:82/210 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1988
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 75% High-performance computing · 25%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
High-performance computing › data transfer
bulk data transfer
0.011988
Remote Pipes and Procedures for Efficient Distributed Communication · ACM Trans. Comput. Syst. 1988
Distributed systems › operating system support
interprocess communication
0.011988
Remote Pipes and Procedures for Efficient Distributed Communication · ACM Trans. Comput. Syst. 1988
Distributed systems › distributed coordination
message ordering
0.011988
Remote Pipes and Procedures for Efficient Distributed Communication · ACM Trans. Comput. Syst. 1988
Distributed systems
remote procedure call
0.011988
Remote Pipes and Procedures for Efficient Distributed Communication · ACM Trans. Comput. Syst. 1988
YearPublicationVenuePosition
1988 Remote Pipes and Procedures for Efficient Distributed Communication
abstract
We describe a new communication model for distributed systems that combines the advantages of remote procedure call with the efficient transfer of bulk data. Three ideas form the basis of this model. First, remote procedures are first-class values which can be freely exchanged among nodes, thus enabling a greater variety of protocols to be directly implemented in a remote procedure call framework. Second, a new type of abstract object, called a pipe , allows bulk data and incremental results to be efficiently transported in a type-safe manner. Unlike procedure calls, pipe calls do not return values and do not block a caller. Data sent down a pipe is received by the pipe's sink node in the order sent. Third, the relative sequencing of pipes and procedures can be controlled by combining them into channel groups . Calls on the members of a channel group are guaranteed to be processed in order. Application experience with this model, which we call the Channel Model , is reported. Derived performance bounds and experimental measures demonstrate k pipe calls can perform min ( 1 + ( r / p ), k ) times faster than k procedure calls, where r is the total roundtrip remote communication time and p is the procedure execution time.
David K. Gifford, Nathan Glasser
ACM Trans. Comput. Syst.2