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

Martin S. Schmookler

dblp:02/4072 · DBLP profile ↗
← Back
12ranked-venue papers
6as first author
0since 2021 · last 2007
—ORCID · none

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

Systems, architecture and hardware · 6 · 3 first-authorTheory of computation · 6 · 3 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
5 papers
Integrated circuit design · 50% Processor architecture and microarchitecture · 49% Electronic design automation · 1%

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

TopicWeightPapersLastEvidence papers
Processor architecture and microarchitecture › computer arithmetic
floating-point arithmetic
0.112005
FPU Implementations with Denormalized Numbers · IEEE Trans. Computers 2005
Integrated circuit design › digital arithmetic circuits
floating-point unit design
0.112005
FPU Implementations with Denormalized Numbers · IEEE Trans. Computers 2005
Integrated circuit design › digital circuit design
arithmetic circuit design
0.021971
High Speed Decimal Addition · IEEE Trans. Computers 1971
High-Speed Binary-to-Decimal Conversion · IEEE Trans. Computers 1968
Integrated circuit design
digital circuit design
0.021971
High Speed Decimal Addition · IEEE Trans. Computers 1971
High-Speed Binary-to-Decimal Conversion · IEEE Trans. Computers 1968
Electronic design automation › logic synthesis
boolean function representation
0.011969
On Mod-2 Sums of Products · IEEE Trans. Computers 1969
Electronic design automation
logic synthesis
0.011969
On Mod-2 Sums of Products · IEEE Trans. Computers 1969
Integrated circuit design › digital circuit design › arithmetic circuit design
binary-to-decimal conversion
0.011968
High-Speed Binary-to-Decimal Conversion · IEEE Trans. Computers 1968
Storage systems › storage management › storage allocation
queue storage allocation
0.011968
A Random-Walk Model of a Queue Storage Problem · IEEE Trans. Computers 1968
Processor architecture and microarchitecture › arithmetic unit
arithmetic logic unit
0.011971
High Speed Decimal Addition · IEEE Trans. Computers 1971
Integrated circuit design › digital arithmetic circuits
decimal arithmetic
0.011968
High-Speed Binary-to-Decimal Conversion · IEEE Trans. Computers 1968
Processor architecture and microarchitecture
instruction set architecture
0.011968
High-Speed Binary-to-Decimal Conversion · IEEE Trans. Computers 1968

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

hardware trap handling · 0.1uniqueness proof · 0.0random walk theory · 0.0probability model · 0.0parallel decimal addition · 0.0high-speed conversion circuitry · 0.0decimal correction · 0.0boolean algebra · 0.0
YearPublicationVenuePosition
2007 P6 Binary Floating-Point Unit
abstract
The floating point unit of the next generation PowerPC is detailed. It has been tested at over 5 GHz. The design supports an extremely aggressive cycle time of 13 FO4 using a technology independent measure. For most dependent instructions, its fused multiply-add dataflow has only 6 effective pipeline stages. This is nearly equivalent to its predecessor, the Power 5, even though its technology independent frequency has increased over 70%. Overall the frequency has improved over 100%. It achieves this high performance through aggressive feedback paths, circuit design and layout. The pipeline has 7 stages but data may be fed back to dependent operations prior to rounding and complete normalization. Division and square root algorithms are also described which take advantage of high-precision linear approximation hardware for obtaining a reciprocal or reciprocal square root approximation.
Son Dao Trong, Martin S. Schmookler, Eric M. Schwarz, Michael Kroener
IEEE Symposium on Computer Arithmetic2
2005 Pain versus Gain in the Hardware Design of FPUs and Supercomputers
Roger A. Golliver, Silvia M. Müller, Stuart F. Oberman, Martin S. Schmookler, Debjit Das Sarma, Andrew Beaumont-Smith
IEEE Symposium on Computer Arithmetic4
2005 FPU Implementations with Denormalized Numbers
abstract
Denormalized numbers are the most difficult type of numbers to implement in floating-point units. They are so complex that certain designs have elected to handle them in software rather than in hardware. Traps to software can result in long execution times, which renders denormalized numbers useless to programmers. This does not have to happen. With a small amount of additional hardware, denormalized numbers and underflows can be handled close to the speed of normalized numbers. This paper summarizes the little known techniques for handling denormalized numbers. Most of the techniques described here only appear in filed or pending patent applications.
Eric M. Schwarz, Martin S. Schmookler, Son Dao Trong
IEEE Trans. Computers2
2003 Hardware Implementations of Denormalized Numbers
abstract
Denormalized numbers are the most difficult type of numbers to implement in floating-point units. They are so complex that some designs have elected to handle them in software rather than hardware. This has resulted in execution times in the tens of thousands of cycles, which has made denormalized numbers useless to programmers. This does not have to happen. With a small amount of additional hardware, denormalized numbers and underflows can be handled close to the speed of normalized numbers. We will summarize the little known techniques for handling denormalized numbers. Most of the techniques discussed have only been discussed in filed or pending patent applications.
Eric M. Schwarz, Martin S. Schmookler, Son Dao Trong
IEEE Symposium on Computer Arithmetic2
2001 Leading Zero Anticipation and Detection-A Comparison of Methods
abstract
Design of the leading zero anticipator (LZA) or detector (LZD) is pivotal to the normalization of results for addition and fused multiplication-addition in high-performance floating point processors. This paper formalizes the analysis and describes some alternative organizations and implementations from the known art. It shows how choices made in the design are often dependent on the overall design of the addition unit, on how subtraction is handled when the exponents are the same, and on how it detects and corrects for the possible one-bit error of the LZA.
Martin S. Schmookler, Kevin J. Nowka
IEEE Symposium on Computer Arithmetic1
1999 Series Approximation Methods for Divide and Square Root in the Power3(TM) Processor
abstract
The Power3 processor is a 64-bit implementation of the PowerPC/sup TM/ architecture and is the successor to the Power2/sup TM/ processor for workstations and servers which require high performance floating point capability. The previous processors used Newton-Raphson algorithms for their implementations of divide and square root. The Power3 processor has a longer pipeline latency, which would substantially increase the latency for these instructions. Instead, new algorithms based on power series approximations were developed which provide significantly better performance than the Newton-Raphson algorithm for this processor. This paper describes the algorithms, and then shows how both the series based algorithms and the Newton-Raphson algorithms are affected by pipeline length. For the Power3, the power series algorithms reduce the divide latency by over 20% and the square root latency by 35%.
Martin S. Schmookler, Ramesh C. Agarwal, Fred G. Gustavson
IEEE Symposium on Computer Arithmetic1
1999 A Low-Power, High-Speed Implementation of a PowerPC(tm) Microprocessor Vector Extension
abstract
The AltiVec/sup TM/ technology is an extension to the PowerPC architecture/sup TM/ which provides new computational and storage operations for handling vectors of various data lengths and data types. The first implementation using this technology is a low-cost, low-power processor based on the acclaimed PowerPC 750/sup TM/ microprocessor. This paper describes the microarchitecture and design of the vector arithmetic unit of this implementation.
Martin S. Schmookler, Michael Putrino, Anh Mather, Jon Tyler, Huy Van Nguyen, Charles Roth, Mukesh Sharma, Mydung N. Pham, Jeff Lent
IEEE Symposium on Computer Arithmetic1
1995 Avoiding Unknown States When Scanning Mutually Exclusive Latches
abstract
Many modern circuits contain logic which must be controlled with mutually exclusive (one-out-of-n) control signals. Common examples include controls to 3-state buses and pass-gate multiplexers. If these control signals are allowed to attain any value combination other than one-out-of-n, the controlled logic may produce an unknown (X) state. In a scan based design, these mutually exclusive signals become problematic if they must be stored in latches. Mutually exclusive values will typically not be maintained on the outputs of these latches during scanning, nor as final values if random test patterns are scanned in. This paper describes a hardware technique that places logic in the scan path to ensure that a given set of latches always maintains mutually exclusive values during scanning.
Stephen Pateras, Martin S. Schmookler
ITC2
1971 High Speed Decimal Addition
abstract
Parallel decimal arithmetic capability is becoming increasingly attractive with new applications of computers in a multi-programming environment. The direct production of decimal sums offers a significant improvement in addition over methods requiring decimal correction. These techniques are illustrated in the eight-digit adder which appears in the System/360 Model 195.
Martin S. Schmookler, Arnold Weinberger
IEEE Trans. Computers1
1969 On Mod-2 Sums of Products
abstract
An algorithm is provided for obtaining any Boolean function as a modulo-2 sum of products containing only uncomplemented variables. The proofs, which verify the algorithm and show the uniqueness of the results, are simple and free of special mathematical notation.
Martin S. Schmookler
IEEE Trans. Computers1
1968 A Random-Walk Model of a Queue Storage Problem
abstract
Abstract—A probability model of queue storage allocation problems is devised and an analysis is provided based on the theory of random walks. Two types of queue storage allocation are discussed and analyzed, after which examples are given to illustrate their relative advantages and disadvantages.
Edward G. Coffman Jr., Martin S. Schmookler
IEEE Trans. Computers2
1968 High-Speed Binary-to-Decimal Conversion
abstract
Abstract—This note describes several methods of performing fast, efficient, binary-to-decimal conversion. With a modest amount of circuitry, an order of magnitude speed improvement is obtained. This achievement offers a unique advantage to general-purpose computers requiring special hardware to translate between binary and decimal numbering systems.
Martin S. Schmookler
IEEE Trans. Computers1