Demo Data from VLDB 2026 / reviewers in the wild / expert
Michael Koster
dblp:43/3564
· DBLP profile ↗
3ranked-venue papers
1as first author
0since 2021 · last 1999
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 3 · 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
1 paper |
Memory systems · 61% Processor architecture and microarchitecture · 30% Parallel and multicore computing · 9% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Memory systems › non-uniform memory access
CC-NUMA |
0.0 | 1 | 1999 | WildFire: A Scalable Path for SMPs · HPCA 1999 |
Memory systems › shared memory
distributed shared memory |
0.0 | 1 | 1999 | WildFire: A Scalable Path for SMPs · HPCA 1999 |
Processor architecture and microarchitecture › multiprocessor architecture
symmetric multiprocessor |
0.0 | 1 | 1999 | WildFire: A Scalable Path for SMPs · HPCA 1999 |
Parallel and multicore computing
locality optimization |
0.0 | 1 | 1999 | WildFire: A Scalable Path for SMPs · HPCA 1999 |
Methods — techniques the papers use, named apart from their topics
hierarchical affinity scheduling · 0.0coherent memory replication · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1999 | WildFire: A Scalable Path for SMPsabstractResearchers have searched for scalable alternatives to the symmetric multiprocessor (SMP) architecture since it was first introduced in 1982. The paper introduces an alternative view of the relationship between scalable technologies and SMPs. Instead of replacing large SMPs with scalable technology, we propose new scalable techniques that allow large SMPs to be tied together efficiently, while maintaining the compatibility with, and performance characteristics of, an SMP. The trade-offs of such an architecture differ from those of traditional, scalable, Non-Uniform Memory Architecture (cc-NUMA) approaches. WildFire is a distributed shared memory (DSM) prototype implementation based on large SMPs. It relies on two techniques for creating application-transparent locality: Coherent Memory Replication (CMR), which is a variation of Simple COMA/Reactive NUMA, and Hierarchical Affinity Scheduling (HAS). These two optimizations create extra node locality, which blurs the node boundaries to an application such that SMP-like performance can be achieved with no NUMA-specific optimizations. We present a performance study of a large OLTP benchmark running on DSMs built from various sized nodes and with varying amounts of application-transparent locality. WildFire's measured performance is shown to be more than two times that of an unoptimized NUMA implementation built from small nodes and within 13% of the performance of the ideal implementation: a large SMP with the same access time to its entire shared memory as the local memory access time of WildFire. Erik Hagersten, Michael Koster |
HPCA | 2 |
| 1993 | The Siemens high-level synthesis system CALLASabstractIn this paper we present the Siemens high-level synthesis system CALLAS and describe its design methodology and synthesis strategy. It supports the synthesis of control-dominated applications and uses a VHDL subset for the algorithmic specification. Its main feature can be characterized as "What you simulate is what you synthesize." This principle permits a validation of the synthesis results by simulation or even formal verification. CALLAS has been successfully applied on real designs which were implemented in silicon. These examples demonstrate that CALLAS fulfils the constraints and objectives of a hardware designer. The circuits are comparable in quality to results achieved by synthesis starting at the register-transfer-level.> Jörg Biesenack, Michael Koster, Anton Langmaier, Stephane Ledeux, Sabine März, Michael Payer, Michael Pilsl, Steffen Rumler, Holger Soukup, Norbert Wehn, Peter Duzy |
IEEE Trans. Very Large Scale Integr. Syst. | 2 |
| 1990 | ASIC design using the high-level synthesis system CALLAS: a case studyabstractThe Siemens high-level synthesis system CALLAS was used to synthesize an ASIC for moving-object detection consisting of 3400 equivalent gates. The digital signal processing (DSP) problem was formulated on algorithmic level in the hardware description language DSDL as a three-page algorithm. Only a few days were needed from specification to the chip layout. Design steps included were high-level behavior simulation, library mapping, and standard cell layout generation using a state-of-the-art physical design system. The authors give a brief overview of the CALLAS system, introduce the DSP example, and discuss the synthesis process and the simulations performed.> Michael Koster, Martin Geiger, Peter Duzy |
ICCD | 1 |