Demo Data from EDBT 2026 / reviewers in the wild / expert
John S. Keen
dblp:42/4988
· DBLP profile ↗
5ranked-venue papers
3as first author
0since 2021 · last 1997
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 3 · 3 first-authorSystems, architecture and hardware · 2Artificial intelligence and machine learning · 1 · 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
3 papers |
Memory systems · 40% Performance modeling and evaluation · 33% Storage systems · 27% | |
| Databases, data mining, and information retrieval
2 papers |
Transaction processing and concurrency control · 100% |
Topics — the 9 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Transaction processing and concurrency control › transaction models
long-lived transactions |
0.0 | 1 | 1997 | Extended Ehemeral Logging: Log Storage Management for Applications with Long Lived Transactions · ACM Trans. Database Syst. 1997 |
Performance modeling and evaluation
benchmarking |
0.0 | 1 | 1997 | Measuring Memory Hierarchy Performance of Cache-Coherent Multiprocessors Using Micro Benchmarks · SC 1997 |
Memory systems
cache coherence |
0.0 | 1 | 1997 | Measuring Memory Hierarchy Performance of Cache-Coherent Multiprocessors Using Micro Benchmarks · SC 1997 |
Memory systems › shared memory
shared memory multiprocessor performance |
0.0 | 1 | 1997 | Measuring Memory Hierarchy Performance of Cache-Coherent Multiprocessors Using Micro Benchmarks · SC 1997 |
Storage systems › logging
database logging |
0.0 | 1 | 1993 | Performance Evaluation of Ephemeral Logging · SIGMOD Conference 1993 |
Performance modeling and evaluation
simulation |
0.0 | 1 | 1993 | Performance Evaluation of Ephemeral Logging · SIGMOD Conference 1993 |
Memory systems › memory interference
memory contention |
0.0 | 1 | 1997 | Measuring Memory Hierarchy Performance of Cache-Coherent Multiprocessors Using Micro Benchmarks · SC 1997 |
Performance modeling and evaluation
workload characterization |
0.0 | 1 | 1997 | Measuring Memory Hierarchy Performance of Cache-Coherent Multiprocessors Using Micro Benchmarks · SC 1997 |
Transaction processing and concurrency control › recovery
crash recovery |
0.0 | 1 | 1993 | Performance Evaluation of Ephemeral Logging · SIGMOD Conference 1993 |
Methods — techniques the papers use, named apart from their topics
simulation · 0.0microbenchmarking · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1997 | Measuring Memory Hierarchy Performance of Cache-Coherent Multiprocessors Using Micro BenchmarksabstractEven with today's large caches, the increasing performance gap between processors and memory systems imposes a memory bottleneck for many important scientific and commercial applications. This bottleneck is intensified in shared-memory multiprocessors by contention and the effects of cache coherency. Under heavy memory contention, the memory latency may increase 2 or 3 times. Nonethless, as more sophisticated techniques are used to hide latency and increase bandwidth, measuring memory performance has become increasingly difficult. Previous simple methods to measure memory performance can overestimate uniprocessor memory latency and underestimate bandwidth by tens of percent. This paper introduces a micro benchmark suite that measures memory hierarchy performance in light of both uniprocessor optimizations and the contention and coherence effects of multiprocessors. The benchmark suite has been used to improve the memory system performance of the SGI Origin multiprocessor. Cristina Hristea Seibert, Daniel Lenoski, John S. Keen |
SC | 3 |
| 1997 | Extended Ehemeral Logging: Log Storage Management for Applications with Long Lived Transactionsabstractarticle Free AccessExtended ephemeral logging: log storage management for applications with long lived transactions Authors: John S. Keen Silicon Graphics, Mountain View, CA Silicon Graphics, Mountain View, CAView Profile , William J. Dally Massachusetts Institute of Technology, Cambridge, MA Massachusetts Institute of Technology, Cambridge, MAView Profile Authors Info & Claims ACM Transactions on Database SystemsVolume 22Issue 1pp 1–42https://doi.org/10.1145/244810.244811Published:01 March 1997Publication History 5citation636DownloadsMetricsTotal Citations5Total Downloads636Last 12 Months13Last 6 weeks2 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 John S. Keen, William J. Dally |
ACM Trans. Database Syst. | 1 |
| 1994 | XEL: Extended Ephemeral Logging for Log Storage ManagementabstractExtended ephemeral logging (XEL) is a more general variation of the ephemeral logging (EL) technique for managing a log of database activity on disk; it does not require a timestamp to be maintained with each object in the database. XEL does not require periodic checkpoints and does not abort lengthy transactions as frequently as traditional firewall logging for the same amount of disk space. Therefore, it is well suited for concurrent databases and applications which have a wide distribution of transaction lifetimes. John S. Keen, William J. Dally |
CIKM | 1 |
| 1993 | Performance Evaluation of Ephemeral LoggingabstractEphemeral logging (EL) is a new technique for managing a log of database activity on disk. It does not require periodic checkpoints and does not abort lengthy transactions as frequently as traditional firewall logging for the same amount of disk space. Therefore, it is well suited for highly concurrent databases and applications which have a wide distribution of transaction lifetimes.This paper briefly explains EL and then analyzes its performance. Simulation studies indicate that it can offer significant savings in disk space, at the expense of slightly higher bandwidth for logging and more main memory. The reduced size of the log implies much faster recovery after a crash as well as cost savings.EL is the method of choice in some but not all situations. We assess the limitations of our current knowledge about EL and suggest promising directions for further research. John S. Keen, William J. Dally |
SIGMOD Conference | 1 |
| 1992 | The Message Driven Processor: An Integrated Multicomputer Processing ElementabstractA description is given of the Message-Driven Processor (MDP), an integrated multicomputer node. It incorporates a 36-bit integer processor, a memory management unit, a router for a 3D mesh network, a network interface, a 4K*36-bit word static RAM (SRAM), and an ECC dynamic RAM (DRAM) controller on a single 1.1 M-transistor VLSI chip. The MDP is not specialized for a single model of computation. Instead, it incorporates efficient primitive mechanisms for communication, synchronization, and naming. These mechanisms support most proposed parallel programming models. Each processing node of the MIT J-Machine consists of an MDP with 1 Mbit of DRAM.> William J. Dally, Andrew A. Chien, Stuart Fiske, Gregory A. Fyler, Waldemar Horwat, John S. Keen, Richard A. Lethin, Michael D. Noakes, Peter R. Nuth, D. Scott Wills |
ICCD | 6 |