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

Egbert Molenkamp

dblp:78/4060 · also Bert Molenkamp · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · none

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

Systems, architecture and hardware · 5Security and privacy · 1Software engineering, systems software and programming languages · 1

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
Integrated circuit design · 87% Processor architecture and microarchitecture · 13%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Integrated circuit design
low-power circuit design
0.112012
Sabrewing: A lightweight architecture for combined floating-point and integer arithmetic · ACM Trans. Archit. Code Optim. 2012
Processor architecture and microarchitecture › special-purpose processor
digital signal processor
0.012012
Sabrewing: A lightweight architecture for combined floating-point and integer arithmetic · ACM Trans. Archit. Code Optim. 2012

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

VHDL · 0.1IEEE-754 compliance testing · 0.1
YearPublicationVenuePosition
2012 Sabrewing: A lightweight architecture for combined floating-point and integer arithmetic
abstract
In spite of the fact that floating-point arithmetic is costly in terms of silicon area, the joint design of hardware for floating-point and integer arithmetic is seldom considered. While components like multipliers and adders can potentially be shared, floating-point and integer units in contemporary processors are practically disjoint. This work presents a new architecture which tightly integrates floating-point and integer arithmetic in a single datapath. It is mainly intended for use in low-power embedded digital signal processors and therefore the following design constraints were important: limited use of pipelining for the convenience of the compiler; maintaining compatibility with existing technology; minimal area and power consumption for applicability in embedded systems. The architecture is tailored to digital signal processing by combining floating-point fused multiply-add and integer multiply-accumulate . It could be deployed in a multi-core system-on-chip designed to support applications with and without dominance of floating-point calculations. The VHDL structural description of this architecture is available for download under BSD license. Besides being configurable at design time, it has been thoroughly checked for IEEE-754 compliance by means of a floating-point test suite originating from the IBM Research Labs. A proof-of-concept has also been implemented using STMicroelectronics 65nm technology. This prototype supports 32-bit signed two's complement integers and 41-bit (8-bit exponent and 32-bit significand) floating-point numbers. Our evaluations show that over 67% energy and 19% area can be saved compared to a reference design in which floating-point and integer arithmetic are implemented separately. The area overhead caused by combining floating-point and integer is less than 5%. Implemented in ST's general-purpose CMOS technology, the design can operate at a frequency of 1.35GHz, while 667MHz can be achieved in low-power CMOS. Considering that the entire datapath is partitioned in just three pipeline stages, and the fact that the design is intended for use in the low-power domain, these frequencies are adequate. They are in fact competitive with current technology low-power floating-point units. Post-layout estimates indicate that the required area of a low-power implementation can be as small as 0.04mm 2 . Power consumption is on the order of several milliwatts. Strengthened by the fact that clock gating could reduce power consumption even further, we think that a shared floating-point and integer architecture is a good choice for signal processing in low-power embedded systems.
Tom M. Bruintjes, Karel H. G. Walters, Sabih H. Gerez, Egbert Molenkamp, Gerard J. M. Smit
ACM Trans. Archit. Code Optim.4
2009 Streaming Reduction Circuit
abstract
Reduction circuits are used to reduce rows of floating point values to single values. Binary floating point operators often have deep pipelines, which may cause hazards when many consecutive rows have to be reduced. We present an algorithm by which any number of consecutive rows of arbitrary lengths can be reduced by a pipelined commutative and associative binary operator in an efficient manner. The algorithm is simple to implement, has a low latency, produces results in-order, and requires only small buffers. Besides, it uses only a single pipeline for the involved operation. The complexity of the algorithm depends on the depth of the pipeline, not on the length of the input rows. In this paper we discuss an implementation of this algorithm and we prove its correctness.
Marco Gerards, Jan Kuper, André B. J. Kokkeler, Egbert Molenkamp
DSD4
2009 Tool DemonstrationCLasHFrom Haskell to Hardware
abstract
No abstract available.
Christiaan Baaij, Matthijs Kooijman, Jan Kuper, Marco Gerards, Egbert Molenkamp
Haskell5
2003 A Flexible and Energy-Efficient Coarse-Grained Reconfigurable Architecture for Mobile Systems
Paul M. Heysters, Gerard J. M. Smit, Egbert Molenkamp
J. Supercomput.3
2002 The Synthesis of a Hardware Scheduler for Non-Manifest Loops
abstract
This paper addresses the hardware implementation of a dynamic scheduler for non-manifest data dependent periodic loops. Static scheduling techniques which are known to give near optimal scheduling-solutions for manifest loops, fail at scheduling non-manifest loops, since they lack the run time information needed which makes a static schedule feasible. In this paper a dynamic scheduling approach was chosen to circumvent this problem. We present a case study using VHDL where the focus lies on implementations with minimal memory usage and low communication overhead between various components of the architecture. This has resulted in an efficient and synthesisable system.
Omar Mansour, Egbert Molenkamp, Thijs Krol
DSD2
1997 Distributed cryptographic function application protocols
André Postma, Thijs Krol, Egbert Molenkamp
ICICS3
1991 On hardware for generating routes in Kautz digraphs
Gerard J. M. Smit, Paul J. M. Havinga, Pierre G. Jansen, Fokke de Boer, Egbert Molenkamp
Microprocessing and Microprogramming5