Demo Data from VLDB 2026 / reviewers in the wild / expert
Scott Dresser
dblp:54/4571
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1994
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 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 |
Memory systems · 30% Parallel and multicore computing · 30% Interconnection networks and networks-on-chip · 30% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Memory systems
cache coherence |
0.0 | 1 | 1994 | Integration of Message Passing and Shared Memory in the Stanford FLASH Multiprocessor · ASPLOS 1994 |
Interconnection networks and networks-on-chip › interprocessor communication
message passing protocol |
0.0 | 1 | 1994 | Integration of Message Passing and Shared Memory in the Stanford FLASH Multiprocessor · ASPLOS 1994 |
Parallel and multicore computing › parallel programming models › hybrid programming models
shared memory and message passing |
0.0 | 1 | 1994 | Integration of Message Passing and Shared Memory in the Stanford FLASH Multiprocessor · ASPLOS 1994 |
Processor architecture and microarchitecture
multiprocessor architecture |
0.0 | 1 | 1994 | Integration of Message Passing and Shared Memory in the Stanford FLASH Multiprocessor · ASPLOS 1994 |
Methods — techniques the papers use, named apart from their topics
simulation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1994 | Integration of Message Passing and Shared Memory in the Stanford FLASH MultiprocessorabstractThe advantages of using message passing over shared memory for certain types of communication and synchronization have provided an incentive to integrate both models within a single architecture. A key goal of the FLASH (FLexible Architecture for SHared memory) project at Stanford is to achieve this integration while maintaining a simple and efficient design. This paper presents the hardware and software mechanisms in FLASH to support various message passing protocols. We achieve low overhead message passing by delegating protocol functionality to the programmable node controllers in FLASH and by providing direct user-level access to this messaging subsystem. In contrast to most earlier work, we provide an integrated solution that handles the interaction of the messaging protocols with virtual memory, protected multiprogramming, and cache coherence. Detailed simulation studies indicate that this system can sustain message-transfers rates of several hundred megabytes per second, effectively utilizing projected network bandwidths for next generation multiprocessors. John Heinlein, Kourosh Gharachorloo, Scott Dresser, Anoop Gupta |
ASPLOS | 3 |