Demo Data from EDBT 2026 / reviewers in the wild / expert
John Heinlein
dblp:73/4137
· DBLP profile ↗
4ranked-venue papers
1as 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 · 4 · 1 first-authorSoftware engineering, systems software and programming languages · 4 · 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
4 papers |
Processor architecture and microarchitecture · 28% Memory systems · 22% Parallel and multicore computing · 19% |
Topics — the 10 heaviest of 12, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Processor architecture and microarchitecture
multiprocessor architecture |
0.0 | 3 | 1994 | The Stanford FLASH Multiprocessor · ISCA 1994 The Performance Impact of Flexibility in the Stanford FLASH Multiprocessor · ASPLOS 1994 Integration of Message Passing and Shared Memory in the Stanford FLASH Multiprocessor · ASPLOS 1994 |
Memory systems
cache coherence |
0.0 | 1 | 1994 | Integration of Message Passing and Shared Memory in the Stanford FLASH Multiprocessor · ASPLOS 1994 |
Memory systems › cache coherence
cache-coherent shared memory |
0.0 | 1 | 1994 | The Stanford FLASH Multiprocessor · ISCA 1994 |
Parallel and multicore computing › parallel programming models
message passing |
0.0 | 1 | 1994 | The Stanford FLASH Multiprocessor · ISCA 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 |
Performance modeling and evaluation › profiling
instruction-level profiling |
0.0 | 1 | 1991 | Instruction Level Profiling and Evaluation of the IBM/6000 · ISCA 1991 |
Memory systems › cache coherence
cache coherence protocol |
0.0 | 1 | 1994 | The Performance Impact of Flexibility in the Stanford FLASH Multiprocessor · ASPLOS 1994 |
Interconnection networks and networks-on-chip
network interface |
0.0 | 1 | 1994 | The Stanford FLASH Multiprocessor · ISCA 1994 |
Performance modeling and evaluation
benchmarking |
0.0 | 1 | 1991 | Instruction Level Profiling and Evaluation of the IBM/6000 · ISCA 1991 |
Methods — techniques the papers use, named apart from their topics
simulation · 0.0verilog · 0.0system-level simulation · 0.0instruction level profiling · 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 | 1 |
| 1994 | The Performance Impact of Flexibility in the Stanford FLASH MultiprocessorabstractA flexible communication mechanism is a desirable feature in multiprocessors because it allows support for multiple communication protocols, expands performance monitoring capabilities, and leads to a simpler design and debug process. In the Stanford FLASH multiprocessor, flexibility is obtained by requiring all transactions in a node to pass through a programmable node controller, called MAGIC. In this paper, we evaluate the performance costs of flexibility by comparing the performance of FLASH to that of an idealized hardwired machine on representative parallel applications and a multiprogramming workload. To measure the performance of FLASH, we use a detailed simulator of the FLASH and MAGIC designs, together with the code sequences that implement the cache-coherence protocol. We find that for a range of optimized parallel applications the performance differences between the idealized machine and FLASH are small. For these programs, either the miss rates are small or the latency of the programmable protocol can be hidden behind the memory access time. For applications that incur a large number of remote misses or exhibit substantial hot-spotting, performance is poor for both machines, though the increased remote access latencies or the occupancy of MAGIC lead to lower performance for the flexible design. In most cases, however, FLASH is only 2%–12% slower than the idealized machine. Mark A. Heinrich, Jeffrey Kuskin, David Ofelt, John Heinlein, Joel Baxter, Jaswinder Pal Singh, Richard Simoni, Kourosh Gharachorloo, David Nakahira, Mark Horowitz, Anoop Gupta, Mendel Rosenblum, John L. Hennessy |
ASPLOS | 4 |
| 1994 | The Stanford FLASH MultiprocessorabstractThe FLASH multiprocessor efficiently integrates support for cache-coherent shared memory and high-performance message passing, while minimizing both hardware and software overhead. Each node in FLASH contains a microprocessor, a portion of the machine's global memory, a port to the interconnection network, The MAGIC chip handles all communication both within the node and among nodes, using hardwired data paths for efficient data movement and a programmable processor optimized for executing protocol operations. The use of the protocol processor makes FLASH very flexible/spl minus/it can support a variety of different communication mechanisms/spl minus/and simplifies the design and implementation. This paper presents the architecture of FLASH and MAGIC, and discusses the base cache-coherence and message-passing protocols. Latency and occupancy numbers, which are derived from our system-level simulator and our Verilog code, are given for several common protocol operations. The paper also describes our software strategy and FLASH's current status.> Jeffrey Kuskin, David Ofelt, Mark A. Heinrich, John Heinlein, Richard Simoni, Kourosh Gharachorloo, John Chapin, David Nakahira, Joel Baxter, Mark Horowitz, Anoop Gupta, Mendel Rosenblum, John L. Hennessy |
ISCA | 4 |
| 1991 | Instruction Level Profiling and Evaluation of the IBM/6000abstractArticle Free Access Share on Instruction level profiling and evaluation of the IBM/6000 Authors: Chriss Stephens Center for Dependable Systems, Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA Center for Dependable Systems, Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PAView Profile , Bryce Cogswell Center for Dependable Systems, Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA Center for Dependable Systems, Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PAView Profile , John Heinlein Center for Dependable Systems, Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA Center for Dependable Systems, Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PAView Profile , Gregory Palmer Center for Dependable Systems, Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA Center for Dependable Systems, Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PAView Profile , John P. Shen Center for Dependable Systems, Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA Center for Dependable Systems, Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PAView Profile Authors Info & Claims ISCA '91: Proceedings of the 18th annual international symposium on Computer architectureApril 1991Pages 180–189https://doi.org/10.1145/115952.115971Published:01 April 1991Publication History 30citation385DownloadsMetricsTotal Citations30Total Downloads385Last 12 Months38Last 6 weeks4 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF Chriss Stephens, Bryce Cogswell, John Heinlein, Gregory Palmer, John Paul Shen |
ISCA | 3 |