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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Graham Hamilton

dblp:81/2346 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1996
—ORCID · none

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

Software engineering, systems software and programming languages · 2 · 1 first-author

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 · 59% Parallel and multicore computing · 26% Storage systems · 8%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › parallel computing › parallel communication
communication mechanisms
0.011993
Subcontract: A Flexible Base for Distributed Programming · SOSP 1993
Distributed systems
distributed object systems
0.011993
Subcontract: A Flexible Base for Distributed Programming · SOSP 1993
Distributed systems
distributed programming
0.011993
Subcontract: A Flexible Base for Distributed Programming · SOSP 1993
Memory systems
cache
0.011993
Subcontract: A Flexible Base for Distributed Programming · SOSP 1993
Storage systems
crash recovery
0.011993
Subcontract: A Flexible Base for Distributed Programming · SOSP 1993
Distributed systems
replication
0.011993
Subcontract: A Flexible Base for Distributed Programming · SOSP 1993

Methods — techniques the papers use, named apart from their topics

object-oriented programming · 0.0
YearPublicationVenuePosition
1996 Buffer Management Issues in the Implementation of Fast Interprocess Communication
abstract
This paper presents our experience with building a cross-domain object invocation mechanism that is conscious about memory usage. Cross-domain object invocation issues are very similar to cross-domain procedure call issues. Although the cross-domain procedure call performance issues have been discussed widely, there is very little reference to issues regarding space. It is a typical example of a case where the issues arising in practice are more complicated than the ones described in the reference literature. Our mechanism is discussed in terms of the Spring modular operating system, but the same principles are applicable to other operating systems. The Spring system is a distributed computing environment running on a networked collection of computers. Each individual Spring system is based around a microkernel known as the nucleus. The nucleus is structured to support fast and secure cross address-space object invocations. Most of the traditional operating system services are provided by servers running as user-mode domains. In a system such as Spring, fast, secure, and space-efficient cross-domain invocation is extremely important. Argument buffers are used to pass data from one process to another. For fast cross address-space procedure calls the maximum size of this buffer should accommodate a small number of page frames. In typical contemporary architectures this size varies between 5 and 10K. In a system such as Spring, where there is a large number of active calls, this size leads to excessive memory usage. Earlier measurements have shown that at run-time the marshalled form of the arguments of most of the calls is less than a hundred bytes. Copying page size objects is the only notable exception. Our implementation uses small 128 byte buffers by default. A very fast mechanism is used to extend the small buffer for calls with marshaled arguments that do not fit in the small buffer. Therefore, it is very space efficient and does not affect the overall system performance. Measurements from our implementation that support these claims are presented.
Panos Kougiouris, Graham Hamilton
Softw. Pract. Exp.2
1993 Subcontract: A Flexible Base for Distributed Programming
abstract
A key problem in operating systems is permitting the orderly introduction of new properties and new implementation techniques. We describe a mechanism, subcontract, that within the context of an object-oriented distributed system permits application programmers control over fundamental object mechanisms. This allows programmers to define new object communication mechanisms without modifying the base system. We describe how new subcontracts can be introduced as alternative communication mechanisms in the place of existing subcontracts. We also briefly describe some of the uses we have made of the subcontract mechanism to support caching, crash recovery, and replication.
Graham Hamilton, Michael L. Powell, James G. Mitchell
SOSP1