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

Greg Chesson

dblp:45/3078 · also Gregory L. Chesson · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
0since 2021 · last 1996
—ORCID · none

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

Computer networks · 4 · 2 first-authorSoftware engineering, systems software and programming languages · 2 · 1 first-authorSystems, 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
Parallel and multicore computing · 39% Memory systems · 30% High-performance computing · 30%
Computer networks
3 papers
Transport protocols and congestion control · 60% Network performance modeling · 30% Internet architecture and protocols · 10%

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

TopicWeightPapersLastEvidence papers
High-performance computing
cluster computing
0.011996
SoftFLASH: Analyzing the Performance of Clustered Distributed Virtual Shared Memory · ASPLOS 1996
Memory systems › shared memory
distributed shared memory
0.011996
SoftFLASH: Analyzing the Performance of Clustered Distributed Virtual Shared Memory · ASPLOS 1996
Parallel and multicore computing › parallel programming models
shared-memory parallelization
0.011996
SoftFLASH: Analyzing the Performance of Clustered Distributed Virtual Shared Memory · ASPLOS 1996
Transport protocols and congestion control
flow control
0.021983
Theoretical Performance Analysis of Sliding Window Flow Control · IEEE J. Sel. Areas Commun. 1983
Theoretical performance analysis of sliding window link level flow control for a local area network · SIGCOMM 1983
Parallel and multicore computing › multiprocessor system
large-scale multiprocessor
0.011996
SoftFLASH: Analyzing the Performance of Clustered Distributed Virtual Shared Memory · ASPLOS 1996
Network performance modeling
queueing analysis
0.011983
Theoretical Performance Analysis of Sliding Window Flow Control · IEEE J. Sel. Areas Commun. 1983
Transport protocols and congestion control › flow control
sliding window flow control
0.011983
Theoretical performance analysis of sliding window link level flow control for a local area network · SIGCOMM 1983
Network performance modeling
throughput and delay analysis
0.011983
Theoretical Performance Analysis of Sliding Window Flow Control · IEEE J. Sel. Areas Commun. 1983
Transport protocols and congestion control
window protocol
0.011983
Theoretical Performance Analysis of Sliding Window Flow Control · IEEE J. Sel. Areas Commun. 1983
Internet architecture and protocols
ARPANET
0.011975
The Network Unix System · SOSP 1975
Internet architecture and protocols
local area network
0.011983
Theoretical performance analysis of sliding window link level flow control for a local area network · SIGCOMM 1983
Operating systems › operating system family
UNIX
0.011975
The Network Unix System · SOSP 1975

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

protocol processors · 0.0kernel implementation · 0.0queueing analysis · 0.0simulation · 0.0interprocess communication · 0.0
YearPublicationVenuePosition
1996 SoftFLASH: Analyzing the Performance of Clustered Distributed Virtual Shared Memory
abstract
One potentially attractive way to build large-scale shared-memory machines is to use small-scale to medium-scale shared-memory machines as clusters that are interconnected with an off-the-shelf network. To create a shared-memory programming environment across the clusters, it is possible to use a virtual shared-memory software layer. Because of the low latency and high bandwidth of the interconnect available within each cluster, there are clear advantages in making the clusters as large as possible. The critical question then becomes whether the latency and bandwidth of the top-level network and the software system are sufficient to support the communication demands generated by the clusters.To explore these questions, we have built an aggressive kernel implementation of a virtual shared-memory system using SGI multiprocessors and 100Mbyte/sec HIPPI interconnects. The system obtains speedups on 32 processors (four nodes, eight processors per node plus additional reserved protocol processors) that range from 6.9 on the communication-intensive FFT program to 21.6 on Ocean (both from the SPLASH 2 suite). In general, clustering is effective in reducing internode miss rates, but as the cluster size increases, increases in the remote latency, mostly due to increased TLB synchronization cost, offset the advantages. For communication-intensive applications, such as FFT, the overhead of sending out network requests, the limited network bandwidth, and the long network latency prevent the achievement of good performance. Overall, this approach still appears promising, but our results indicate that large low latency networks may be needed to make cluster-based virtual shared-memory machines broadly useful as large-scale shared-memory multiprocessors.
Andrew Erlichson, Neal Nuckolls, Greg Chesson, John L. Hennessy
ASPLOS3
1991 The Challenge of Workstations to Networks
Greg Chesson
Comput. Networks ISDN Syst.1
1988 XTP/PE overview
abstract
The Xpress Transfer Protocol (XTP) is a lightweight transport protocol with unified internetwork services conforming to OSI (Open Systems Interconnection) layers 3 and 4. The Protocol Engine (PE) is a chip set designed to execute XTP and other protocols in real time. The author provides an overview of both developments. The VLSI strategy is shown, and the main technical issues in configuring an XTP/PE system at 1 Gbit/sec are described.>
Greg Chesson
LCN1
1983 Theoretical performance analysis of sliding window link level flow control for a local area network
abstract
A transmitter sends packets over a local area network to a receiver. The receiver has a finite amount of storage capacity for buffering messages. A sliding window protocol is employed to insure all packets are delivered without error in order of arrival. Mean throughput rate and packet delay statistics are studied as a function of model parameters. Simulation data are presented.
Ed Arthurs, Greg Chesson, Bart W. Stuck
SIGCOMM2
1983 Theoretical Performance Analysis of Sliding Window Flow Control
abstract
A transmitter breaks a message up into packets and transmits the packets to a receiver over a single virtual circuit within a local area network. The receiver has a finite amount of storage capacity for buffering messages. A sliding window protocol turns the transmitter on and off to ensure there is always storage room in the receiver for packets. Mean throughput rate and delay statistics are studied as a function of model parameters.
Ed Arthurs, Greg Chesson, Bart W. Stuck
IEEE J. Sel. Areas Commun.2
1975 The Network Unix System
abstract
A Network Interface Program (NIP) is that part of an operating system which interfaces with similar entities in a network. Normally, the NIP is a collection of software routines which implement interprocess communication, interhost protocols, data flow controls, and other necessary executive functions. This paper discusses the organization of the NIP currently being used with the Unix operating system on the ARPA network. The Network Unix system is noteworthy because of the natural way that network and local functions are merged. As a result the network appears as a logical extension to the local system - from the point of view of both the interactive terminal and user program.
Greg Chesson
SOSP1