EDBT 2026 Demo / reviewers in the wild / expert
Christian Jacobi 0002
dblp:j/CJacobi2
· DBLP profile ↗
13ranked-venue papers
6as first author
2since 2021 · last 2022
0000-0003-0522-1630ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 8 · 4 first-author · 2 since 2021Software engineering, systems software and programming languages · 6 · 2 first-author · 1 since 2021Theory of computation · 4 · 2 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 |
Hardware accelerators and domain-specific architectures · 33% Storage systems · 28% Processor architecture and microarchitecture · 19% | |
| Software engineering, system software, and programming languages
1 paper |
Program verification · 100% |
Topics — the 10 heaviest of 13, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Hardware accelerators and domain-specific architectures
machine learning accelerator |
0.6 | 1 | 2022 | AI accelerator on IBM telum processor: industrial product · ISCA 2022 |
Processor architecture and microarchitecture › microprocessor
server processor |
0.6 | 1 | 2022 | AI accelerator on IBM telum processor: industrial product · ISCA 2022 |
Hardware accelerators and domain-specific architectures › domain-specific accelerator
compression accelerator |
0.4 | 1 | 2020 | Data Compression Accelerator on IBM POWER9 and z15 Processors : Industrial Product · ISCA 2020 |
Storage systems
data compression |
0.4 | 1 | 2020 | Data Compression Accelerator on IBM POWER9 and z15 Processors : Industrial Product · ISCA 2020 |
Storage systems › data compression
lossless compression |
0.4 | 1 | 2020 | Data Compression Accelerator on IBM POWER9 and z15 Processors : Industrial Product · ISCA 2020 |
Memory systems
cache design |
0.1 | 1 | 2012 | Transactional Memory Architecture and Implementation for IBM System Z · MICRO 2012 |
Parallel and multicore computing
transactional memory |
0.1 | 1 | 2012 | Transactional Memory Architecture and Implementation for IBM System Z · MICRO 2012 |
Program verification
hardware verification |
0.0 | 1 | 2002 | Formal Verification of Complex Out-of-Order Pipelines by Combining Model-Checking and Theorem-Proving · CAV 2002 |
Automated reasoning and model checking
model checking |
0.0 | 1 | 2002 | Formal Verification of Complex Out-of-Order Pipelines by Combining Model-Checking and Theorem-Proving · CAV 2002 |
Processor architecture and microarchitecture › out-of-order execution
out-of-order pipeline |
0.0 | 1 | 2002 | Formal Verification of Complex Out-of-Order Pipelines by Combining Model-Checking and Theorem-Proving · CAV 2002 |
Methods — techniques the papers use, named apart from their topics
on-chip acceleration · 0.6on-chip integration · 0.4instruction set architecture design · 0.1theorem proving · 0.1model checking · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | AI accelerator on IBM telum processor: industrial productabstractIBM Telum is the next generation processor chip for IBM Z and LinuxONE systems. The Telum design is focused on enterprise class workloads and it achieves over 40% per socket performance growth compared to IBM z15. The IBM Telum is the first server-class chip with a dedicated on-chip AI accelerator that enables clients to gain real time insights from their data as it is getting processed. Cédric Lichtenau, Alper Buyuktosunoglu, Ramon Bertran Monfort, Peter Figuli, Christian Jacobi 0002, Nikolaos Papandreou, Haralampos Pozidis, Anthony Saporito, Andrew Sica, Elpida Tzortzatos |
ISCA | 5 |
| 2021 | Real-time AI for Enterprise Workloads: the IBM Telum ProcessorabstractNext generation Z processor is optimized to run enterprise workloads with embedded real time AI insights. Christian Jacobi 0002 |
HCS | 1 |
| 2020 | Data Compression Accelerator on IBM POWER9 and z15 Processors : Industrial ProductabstractLossless data compression is highly desirable in enterprise and cloud environments for storage and memory cost savings and improved utilization I/O and network. While the value provided by compression is recognized, its application in practice is often limited because it's a processor intensive operation resulting low throughput and high elapsed time for compression intense workloads.The IBM POWER9 and IBM z15 systems overcome the shortcomings of existing approaches by including a novel on-chip integrated data compression accelerator. The accelerator reduces processor cycles, I/O traffic, memory and storage footprint of many applications practically with zero hardware cost. The accelerator also eliminates the cost and I/O slots that would have been necessary with FPGA/ASIC based compression adapters. On the POWER9 chip, a single accelerator uses less than 0.5% of the processor chip area, but provides a 388x speedup factor over the zlib compression software running on a general-purpose core and provides a 13x speedup factor over the entire chip of cores. On a POWER9 system, the accelerators provide an end-to-end 23% speedup to Apache Spark TPC-DS workload compared to the software baseline. The z15 chip doubles the compression rate of POWER9 resulting in even much higher speedup factors over the compression software running on general-purpose cores. On a maximally configured z15 system topology, on-chip compression accelerators provide up to 280 GB/s data compression rate, the highest in the industry. Overall, the on-chip accelerators significantly advance the state of the art in terms of area, throughput, latency, compression ratio, reduced processor utilization, power/energy efficiency, and integration into the system stack.This paper describes the architecture, and novel elements of the POWER9 and z15 compression/decompression accelerators with emphasis on trade-offs that made the on-chip implementation possible. Bülent Abali, Bart Blaner, John J. Reilly, Matthias Klein, Craig B. Agricola, Bedri Sendir, Alper Buyuktosunoglu, Christian Jacobi 0002, William J. Starke, Haren Myneni |
ISCA | 9 |
| 2012 | Transactional Memory Architecture and Implementation for IBM System ZabstractWe present the introduction of transactional memory into the next generation IBM System z CPU. We first describe the instruction-set architecture features, including requirements for enterprise-class software RAS. We then describe the implementation in the IBM zEnterprise EC12 (zEC12) microprocessor generation, focusing on how transactional memory can be embedded into the existing cache design and multiprocessor shared-memory infrastructure. We explain practical reasons behind our choices. The zEC12 system is available since September 2012. Christian Jacobi 0002, Timothy J. Slegel, Dan F. Greiner |
MICRO | 1 |
| 2008 | Verifying full-custom multipliers by Boolean equivalence checking and an arithmetic bit level proofabstractIn this paper we describe a practical methodology to formally verify highly optimized, industrial multipliers. We define a multiplier description language which abstracts from low-level optimizations and which can model a wide range of common implementations at a structural and arithmetic level. The correctness of the created model is established by bit level transformations matching the model against a standard multiplication specification. The model is also translated into a gate netlist to be compared with the full-custom implementation of the multiplier by standard equivalence checking. The advantage of this approach is that we use a high level language to provide the correlation between structure and bit level arithmetic. This compares favorably with other approaches that have to spend considerable effort on extracting this information from highly optimized implementations. Our approach is easily portable and proved applicable to a wide variety of state-of-the-art industrial designs. Udo Krautz, Markus Wedler, Wolfgang Kunz, Kai Weber 0001, Christian Jacobi 0002, Matthias Pflanz |
ASP-DAC | 5 |
| 2006 | Evaluating coverage of error detection logic for soft errors using formal methodsabstractIn this paper we describe a methodology to measure exactly the quality of fault-tolerant designs by combining fault-injection in high level design (HLD) descriptions with a formal verification approach. We utilize BDD based symbolic simulation to determine the coverage of online error-detection and -correction logic. We describe an easily portable approach, which can be applied to a wide variety of multi-GHz industrial designs Udo Krautz, Matthias Pflanz, Christian Jacobi 0002, Hans-Werner Tast, Kai Weber 0001, Heinrich Theodor Vierhaus |
DATE | 3 |
| 2006 | Putting it all together - Formal verification of the VAMP
Sven Beyer, Christian Jacobi 0002, Daniel Kroening, Dirk Leinenbach, Wolfgang J. Paul |
Int. J. Softw. Tools Technol. Transf. | 2 |
| 2005 | The Vector Floating-Point Unit in a Synergistic Processor Element of a CELL ProcessorabstractThe floating-point unit in the synergistic processor element of the 1st generation multi-core CELL processor is described. The FPU supports 4-way SIMD single precision and integer operations and 2-way SIMD double precision operations. The design required a high-frequency, low latency, power and area efficiency with primary application to the multimedia streaming workloads, such as 3D graphics. The FPU has 3 different latencies, optimizing the performance critical single precision FMA operations, which are executed with a 6-cycle latency at an 11FO4 cycle time. The latency includes the global forwarding of the result. These challenging performance, power, and area goals were achieved through the co-design of architecture and implementation with optimizations at all levels of the design. This paper focuses on the logical and algorithmic aspects of the FPU we developed, to achieve these goals. Silvia M. Müller, Christian Jacobi 0002, Hwa-Joon Oh, Kevin D. Tran, Scott R. Cottier, Brad W. Michael, Hiroo Nishikawa, Yonetaro Totsuka, Tatsuya Namatame, Naoka Yano, Takashi Machida, Sang H. Dhong |
IEEE Symposium on Computer Arithmetic | 2 |
| 2005 | Automatic Formal Verification of Fused-Multiply-Add FPUsabstractIn this paper we describe a fully-automated methodology for formal verification of fused-multiply-add floating point units (FPU). Our methodology verifies an implementation FPU against a simple reference model derived from the processor's architectural specification, which may include all aspects of the IEEE specification including denormal operands and exceptions. Our strategy uses a combination of BDD- and SAT-based symbolic simulation. To make this verification task tractable, we use a combination of case-splitting, multiplier isolation, and automatic model reduction techniques. The case-splitting is defined only in terms of the reference model, which makes this approach easily portable to new designs. The methodology is directly applicable to multi-GHz industrial implementation models (e.g., HDL or gate-level circuit representations) that contain all details of the high-performance transistor-level model, such as aggressive pipelining, clocking, etc. Experimental results are provided to demonstrate the computational efficiency of this approach. Christian Jacobi 0002, Kai Weber 0001, Viresh Paruthi, Jason Baumgartner |
DATE | 1 |
| 2005 | Formal Verification of the VAMP Floating Point Unit
Christian Jacobi 0002, Christoph Berg |
Formal Methods Syst. Des. | 1 |
| 2003 | Cryptographically Sound and Machine-Assisted Verification of Security Protocols
Michael Backes 0001, Christian Jacobi 0002 |
STACS | 2 |
| 2002 | Formal Verification of Complex Out-of-Order Pipelines by Combining Model-Checking and Theorem-Proving
Christian Jacobi 0002 |
CAV | 1 |
| 1999 | Highly Concurrent Locking in Shared Memory Database Systems
Christian Jacobi 0002, Cédric Lichtenau |
Euro-Par | 1 |