Network


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

Hotspot


Dive into the research topics where Markus Buehler is active.

Publication


Featured researches published by Markus Buehler.


Ibm Journal of Research and Development | 2011

Design methodology for the IBM POWER7 microprocessor

Joshua Friedrich; Ruchir Puri; Uwe Brandt; Markus Buehler; Jack DiLullo; Jeremy T. Hopkins; Mozammel Hossain; Michael A. Kazda; Joachim Keinert; Zahi M. Kurzum; Douglass T. Lamb; Alice Lee; Frank J. Musante; Jens Noack; Peter J. Osler; Stephen D. Posluszny; Haifeng Qian; Shyam Ramji; Vasant B. Rao; Lakshmi N. Reddy; Haoxing Ren; Thomas Edward Rosser; Benjamin R. Russell; Cliff C. N. Sze; Gustavo E. Tellez

The IBM POWER7® microprocessor, which is the next-generation IBM POWER® processor, leverages IBMs 45-nm silicon-on-insulator (SOI) process with embedded dynamic random access memory to achieve industry-leading performance. To deliver this complex 567-mm2 die, the IBM design team made significant innovations in chip design methodology. This paper describes the most critical methodology innovations specific to POWER7 design, which were in modularity, timing closure, and design efficiency.


great lakes symposium on vlsi | 2008

Considering possible opens in non-tree topology wire delay calculation

Philipp Panitz; Markus Olbrich; Erich Barke; Markus Buehler; Juergen Koehl

Non-tree routing experiences an increasing interest as technology scales into the nanometer range. Via and wire opens have become the main yield detractors considering random spot defects due to the additive manufacturing process of copper wires. Wiring networks containing loops offer some robustness against open defects which increases functional yield. State-of-the-art delay calculation enables the treatment of loops but does not provide an adequate solution for timing analysis in the presence of an open. If the delay in the presence of an open is not properly analyzed, a functional fail will be masked and replaced by a parametric fail which is only detectable applying delay testing. In this paper we present a new method to rapidly calculate the maximum delay if an open occurs in the net. For topologies consisting of non-adjacent loops we provide proof that the worst delay considering the Elmore delay metric can be found in 2N+1 delay calculations, whereas N is the number of loops in the net.


Archive | 2012

Gate configuration determination and selection from standard cell library

Thomas Buechner; Markus Buehler; Markus Olbrich; Philipp Panitz; Lei Wang


Archive | 2012

GLITCH POWER REDUCTION

Thomas Buechner; Markus Buehler; Markus Olbrich; Philipp Panitz; Lei Wang


Archive | 2009

Method and system for calculating timing delay in a repeater network in an electronic circuit

Markus Buehler; Juergen Kuehl; Markus Olbrich; Philipp Panitz


Archive | 2008

Computer readable medium, system and associated method for designing integrated circuits with loop insertions

Andreas Arp; Jeanne P. Bickford; Markus Buehler; Juergen Koehl; Philipp Salz


Archive | 2007

METHOD, SYSTEM, AND COMPUTER PROGRAM PRODUCT FOR COUPLED NOISE TIMING VIOLATION AVOIDANCE IN DETAILED ROUTING

Markus Buehler; Moussadek Belaidi; James J. Curtin; Adam P. Matheny; Bryan A. Meyer; Douglas S. Search; Dhaval R. Sejpal; Charles Vakirtzis


Archive | 2012

Estimating power consumption of an electronic circuit

Thomas Buechner; Markus Buehler; Philipp Panitz; Lei Wang; Markus Olbrich


Archive | 2010

Write Buffer for Improved DRAM Write Access Patterns

Cagri Balkesen; Markus Buehler; Rainer Dorsch; Guenther Hutzl; Michael Kaufmann; Daniel Pfefferkorn; David Rohr; Stefanie Scherzinger; Thomas Schwarz


Archive | 2008

Routing of wires of an electronic circuit

Markus Buehler; Juergen Koehl; Markus Olbrich; Philipp Panitz

Collaboration


Dive into the Markus Buehler's collaboration.

Researchain Logo
Decentralizing Knowledge