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

Chris Maeda

dblp:74/6565 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 1997
0009-0001-0616-0609ORCID · reported

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

Software engineering, systems software and programming languages · 3 · 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.

Software engineering, system software, and programming languages
2 papers
Requirements engineering and software design · 69% Operating systems · 31%
Computer networks
1 paper
Internet architecture and protocols · 77% Transport protocols and congestion control · 23%

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

TopicWeightPapersLastEvidence papers
Requirements engineering and software design
software architecture
0.011997
Open Implementation Design Guidelines · ICSE 1997
Internet architecture and protocols
protocol implementation
0.011993
Protocol Service Decomposition for High-Performance Networking · SOSP 1993
Operating systems › network stack › protocol processing
user-space protocol implementation
0.011993
Protocol Service Decomposition for High-Performance Networking · SOSP 1993
Requirements engineering and software design › software architecture › architectural design
module interface design
0.011997
Open Implementation Design Guidelines · ICSE 1997
Transport protocols and congestion control › transport protocols
TCP/IP
0.011993
Protocol Service Decomposition for High-Performance Networking · SOSP 1993

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

protocol decomposition · 0.0library-based protocol implementation · 0.0
YearPublicationVenuePosition
1997 Aspect-Oriented Programming
Gregor Kiczales, John Lamping, Anurag Mendhekar, Chris Maeda, Cristina V. Lopes, Jean-Marc Loingtier, John Irwin
ECOOP4
1997 Open Implementation Design Guidelines
abstract
Designing reusable software modules can be extremely difficult.The design must be balanced between being general enough to address the needs of a wide range of clients and being focused enough to truly satisfy the requirements of each specific client One area where it can be particularly difficult to strike this balance is in the implementation strategy of the module.The problem is that generalpurpose implementation strategies, tuned for a wide range of clients, aren't necessarily optimal for each specific client-this is especially an issue for modules that are intended to be reusable and yet provide high-performance.An examination of existing software systems shows that an increasingly important technique for handling this problem is to design the module's interface in such a way that the client can assist or participate in the selection of the module's implementation strategy.We call this approach open implementation.When designing the interface to a module that allows its clients some control over its implementation strategy, it is important to retain, as much as possible, the advantages of traditional closed implementation modules.This paper explores issues in the design of interfaces to open implementation modules.We identify key design choices, and present guidelines for deciding which choices are likely to work best in particular situations.
Gregor Kiczales, John Lamping, Cristina V. Lopes, Chris Maeda, Anurag Mendhekar, Gail C. Murphy
ICSE4
1993 Protocol Service Decomposition for High-Performance Networking
abstract
In this paper we describe a new approach to implementing network protocols that enables them to have high performance and high flexibility, while retaining complete conformity to existing application programming interfaces. The key insight behind our work is that an application's interface to the network is distinct and separable from its interface to the operating system. We have separated these interfaces for two protocol implementations, TCP/IP and UDP/IP, running on the Mach 3.0 operating system and UNIX server. Specifically, library code in the application's address space implements the network protocols and transfers data to and from the network, while an operating system server manages the heavyweight abstractions that applications use when manipulating the network through operations other than send and receive. On DECstation 5000/200 systems connected by 10Mb/sec Ethernet, this approach to protocol decomposition achieves TCP/IP throughput of 1088 KB/second, which is comparable to that of a high-quality in-kernel TCP/IP implementation, and substantially better than a server-based one. Our approach achieves small-packet UDP/IP round trip latencies of 1.23 ms, again comparable to a kernel-based implementation and more than twice as fast as a server-based one.
Chris Maeda, Brian N. Bershad
SOSP1