Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Maarten J. Boersma is active.

Publication


Featured researches published by Maarten J. Boersma.


symposium on computer arithmetic | 2009

Advanced Clockgating Schemes for Fused-Multiply-Add-Type Floating-Point Units

Jochen Preiss; Maarten J. Boersma; Silvia Melitta Mueller

The paper introduces fine-grain clockgating schemes for fused multiply-add-type floating-point units (FPU). The clockgating is based on instruction type, precision and operand values. The presented schemes focus on reducing the power at peak performance, where each FPU stage is used in nearly every cycle and conventional schemes have little impact on the power consumption. Depending on the instruction mix, the schemes allow to turn off 18% to 74%of the register bits. Even for the worst case instruction 18% to 37% of the FPU are shut down depending on the data patterns.


symposium on computer arithmetic | 2011

The POWER7 Binary Floating-Point Unit

Maarten J. Boersma; Michael Kroner; Christophe J. Layer; Petra Leber; Silvia M. Müller; Kerstin Schelm

The binary Floating-Point Unit (FPU) of the POWER7 processor is a 5.5 cycle Fused Multiply-Add (FMA) design, fully compliant with the IEEE 754-2008 standard. Unlike previous PowerPC designs, the POWER7 FPU merges the scalar and vector FPUs into a single unit executing three floating-point instruction sets: the single and double precision scalar set, the single precision VMX vector set, and the new single and double precision VSX vector and scalar set. Due to a compact buffer-free floor plan and several optimizations in the data and control flow, the streamlined POWER7 FPU achieves a factor of 2 area reduction over the POWER6 design, beyond the normal technology shrink. This results in a very power and area efficient FPU design, supporting a chip frequency of 4.14GHz. A single 64-bit FPU instance measures only 0.26mm2 in 45nm CMOS SOI.


Archive | 2011

Method and data processing unit for calculating at least one multiply-sum of two carry-less multiplications of two input operands, data processing program and computer program product

Maarten J. Boersma; Jens Leenstra; Tim Niggemeier; Philipp Oehler; Philipp Panitz


Archive | 2011

MECHANISM TO SPEED-UP MULTITHREADED EXECUTION BY REGISTER FILE WRITE PORT REALLOCATION

Maarten J. Boersma; Jens Leenstra; Tim Niggemeier; Philipp Oehler; Philipp Panitz


Archive | 2008

System and method for storing numbers in first and second formats in a register file

Maarten J. Boersma; Michael Kroener; Petra Leber; Silvia Melitta Mueller; Jochen Preiss; Kerstin Schelm


Archive | 2012

METHOD AND APPARATUS FOR IMPROVED POWER MANAGEMENT OF MICROPROCESSORS BY INSTRUCTION GROUPING

Tim Niggemeier; Harry Barowski; Maarten J. Boersma; Gunnar Spiess


Archive | 2013

Fused Multiply-Adder with Booth-Encoding

Maarten J. Boersma; Klaus Michael Kroener; Christophe J. Layer; Silvia Melitta Mueller


Archive | 2009

Power gating processor execution units when number of instructions issued per cycle falls below threshold and are independent until instruction queue is full

Tim Niggemeier; Harry Barowski; Maarten J. Boersma; Gunnar Spiess


Archive | 2008

Zero indication forwarding for floating point unit power reduction

Harry Barowski; Maarten J. Boersma; Silvia Melitta Mueller; Tim Niggemeier; Jochen Preiss


Archive | 2013

Reducing issue-to-issue latency by reversing processing order in half-pumped simd execution units

Maarten J. Boersma; Christophe J. Layer; Jens Leenstra; Silvia Melitta Mueller

Researchain Logo
Decentralizing Knowledge