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

Gert Slavenburg

dblp:00/2903 · also Gerrit A. Slavenburg · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 1998
—ORCID · none

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

Systems, architecture and hardware · 3Software engineering, systems software and programming languages · 2Graphics, computer vision, multimedia, augmented reality and games · 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
2 papers
Processor architecture and microarchitecture · 63% Memory systems · 35% Parallel and multicore computing · 3%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization › dependence analysis
memory disambiguation
0.011994
Speculative Disambiguation: A Compilation Technique for Dynamic Memory Disambiguation · ISCA 1994
Processor architecture and microarchitecture
instruction-level parallelism
0.011994
Speculative Disambiguation: A Compilation Technique for Dynamic Memory Disambiguation · ISCA 1994
Processor architecture and microarchitecture
speculative execution
0.011994
Speculative Disambiguation: A Compilation Technique for Dynamic Memory Disambiguation · ISCA 1994
Memory systems
cache coherence
0.011986
Software-Controlled Caches in the VMP Multiprocessor · ISCA 1986
Memory systems › cache management
software-managed cache
0.011986
Software-Controlled Caches in the VMP Multiprocessor · ISCA 1986
Memory systems › cache › cache organization
virtual cache
0.011986
Software-Controlled Caches in the VMP Multiprocessor · ISCA 1986
Memory systems › memory management
virtual memory
0.011986
Software-Controlled Caches in the VMP Multiprocessor · ISCA 1986
Processor architecture and microarchitecture › instruction-level parallelism
VLIW
0.011994
Speculative Disambiguation: A Compilation Technique for Dynamic Memory Disambiguation · ISCA 1994
Processor architecture and microarchitecture › multiprocessor architecture
bus-based multiprocessor
0.011986
Software-Controlled Caches in the VMP Multiprocessor · ISCA 1986
Parallel and multicore computing
multiprocessor system
0.011986
Software-Controlled Caches in the VMP Multiprocessor · ISCA 1986

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

speculative disambiguation · 0.0guarded execution · 0.0software cache miss handling · 0.0cache consistency state machine · 0.0
YearPublicationVenuePosition
1998 Design space exploration for future TriMedia CPUs
abstract
It is widely recognized that fine-grain parallelism can greatly enhance a processor's performance for signal processing applications. For this reason, future generation TriMedias will combine VLIW and subword parallelism in a single CPU. We present a snapshot of the new CPUs design process: the outlines are clear but fine tuning is still ongoing. We present the design flow and 'workbench' that the designers use for further tuning.
Frans Sijstermans, Evert-Jan D. Pol, Bram Riemens, Kees A. Vissers, Selliah Rathnam, Gert Slavenburg
ICASSP6
1994 Speculative Disambiguation: A Compilation Technique for Dynamic Memory Disambiguation
abstract
Ambiguous memory references have always been one of the main sources of performance bottlenecks. Many papers have addressed this problem using static disambiguation. These methods work extremely well when the memory access pattern is linear and predictable. However they are ineffective when the memory access pattern is nonlinear or when the access pattern cannot be determined statically. For these difficult problems, the authors present speculative disambiguation, a compilation technique for architectures supporting instruction level parallelism and either speculative execution or conditional execution (or both). This technique produces specialized code at compile time to disambiguate memory references at run time. It is shown that on machines with sufficient resources, the technique will always result in lower execution time. Speculative disambiguation has been implemented for a VLIW architecture with guarded execution. Preliminary results indicate that it can help bridge a significant fraction of the performance gap between a good and a perfect static disambiguator. Occasionally it can outperform the perfect static disambiguator.>
Andrew S. Huang, Gert Slavenburg, John Paul Shen
ISCA2
1988 CREATE-LIFE: a design system for high performances VLSI circuits
abstract
CREATE-LIFE (compiler for regular architecture/long instruction word engine) is an architecture-specific design for CMOS VLSI. The design system takes as input a description of the function to be performed by a VLSI module in a general-purpose, Pascal-like programming language. It then produces the CMOS layout of a very high-performance (micro) programmed architecture tailored for that function. The LIFE architectures generated by the design system are single-chip implementations of an improved form of very long instruction word (VLIW) architecture that uses both parallelism and pipelining.>
Junien Labrousse, Gert Slavenburg
ICCD2
1986 Software-Controlled Caches in the VMP Multiprocessor
abstract
VMP is an experimental multiprocessor that follows the familiar basic design of multiple processors, each with a cache, connected by a shared bus to global memory. Each processor has a synchronous, virtually addressed, single master connection to its cache, providing very high memory bandwidth. An unusually large cache page size and fast sequential memory copy hardware make it feasible for cache misses to be handled in software, analogously to the handling of virtual memory page faults. Hardware support for cache consistency is limited to a simple state machine that monitors the bus and interrupts the processor when a cache consistency action is required. In this paper, we show how the VMP design provides the high memory bandwidth required by modern high-performance processors with a minimum of hardware complexity and cost. We also describe simple solutions to the consistency problems associated with virtually addressed caches. Simulation results indicate that the design achieves good performance providing data contention is not excessive.
David R. Cheriton, Gert Slavenburg, Patrick D. Boyle
ISCA2