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

Paul Wielage

dblp:28/4670 · DBLP profile ↗
← Back
7ranked-venue papers
2as 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 · 7 · 2 first-authorSoftware engineering, systems software and programming languages · 5 · 1 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
1 paper
Cloud and datacenter computing · 61% Interconnection networks and networks-on-chip · 30% Parallel and multicore computing · 9%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › quality of service
guaranteed service
0.112005
An efficient on-chip NI offering guaranteed services, shared-memory abstraction, and flexible network configuration · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2005
Interconnection networks and networks-on-chip
network interface
0.112005
An efficient on-chip NI offering guaranteed services, shared-memory abstraction, and flexible network configuration · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2005
Cloud and datacenter computing
quality of service
0.112005
An efficient on-chip NI offering guaranteed services, shared-memory abstraction, and flexible network configuration · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2005
Parallel and multicore computing › parallel programming models
shared-memory abstraction
0.012005
An efficient on-chip NI offering guaranteed services, shared-memory abstraction, and flexible network configuration · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2005

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

transaction-based protocol · 0.1
YearPublicationVenuePosition
2007 Test quality analysis and improvement for an embedded asynchronous FIFO
abstract
Embedded first-in first-out (FIFO) memories are increasingly used in many IC designs. We have created a new full-custom embedded FIFO module with asynchronous read and write clocks, which is at least a factor two smaller and also faster than SRAM-based and standard-cell-based counterparts. The detection qualities of the FIFO test for both hard and weak resistive shorts and opens have been analyzed by an IFA-like method based on analog simulation. The defect coverage of the initial FIFO test for shorts in the bit-cell matrix has been improved by inclusion of an additional data background and low-voltage testing; for low-resistant shorts, 100% defect coverage is obtained. The defect coverage for opens has been improved by a new test procedure which includes waiting periods
Tobias Dubois, Erik Jan Marinissen, Mohamed Azimane, Paul Wielage, Erik Larsson, Clemens Wouters
DATE4
2007 Design and DfT of a high-speed area-efficient embedded asynchronous FIFO
abstract
Embedded first-in first-out (FIFO) memories are increasingly used in many IC designs. We have created a new full-custom embedded ripple-through FIFO module with asynchronous read and write clocks. The implementation is based on a micropipeline architecture and is at least a factor two smaller than SRAM-based and standard-cell-based counterparts. This paper gives an overview of the most important design features of the new FIFO module and describes its test and design-for-test approach
Paul Wielage, Erik Jan Marinissen, Michel Altheimer, Clemens Wouters
DATE1
2005 An efficient on-chip NI offering guaranteed services, shared-memory abstraction, and flexible network configuration
abstract
We present a network interface (NI) for an on-chip network. Our NI decouples computation from communication by offering a shared-memory abstraction, which is independent of the network implementation. We use a transaction-based protocol to achieve backward compatibility with existing bus protocols such as AXI, OCP, and DTL. Our NI has a modular architecture, which allows flexible instantiation. It provides both guaranteed and best-effort services via connections. These are configured via NI ports using the network itself, instead of a separate control interconnect. An example instance of this NI with four ports has an area of 0.25 mm/sup 2/ after layout in 0.13-/spl mu/m technology, and runs at 500 MHz.
Andrei Radulescu, John Dielissen, Santiago González Pestana, Om Prakash Gangwal, Edwin Rijpkema, Paul Wielage, Kees Goossens
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.6
2004 An Efficient On-Chip Network Interface Offering Guaranteed Services, Shared-Memory Abstraction, and Flexible Network Configuration
abstract
In this paper we present a network interface for an on-chip network. Our network interface decouples computation from communication by offering a shared-memory abstraction, which is independent of the network implementation. We use a transaction-based protocol to achieve backward compatibility with existing bus protocols such as AXI, OCP and DTL. Our network interface has a modular architecture, which allows flexible instantiation. It provides both guaranteed and best-effort services via connections. These are configured via network interface ports using the network itself, instead of a separate control interconnect. An example instance of this network interface with 4 ports has an area of 0.143 mm/sup 2/ in a 0.13 /spl mu/m technology, and runs at 500 MHz.
Andrei Radulescu, John Dielissen, Kees Goossens, Edwin Rijpkema, Paul Wielage
DATE5
2003 Trade Offs in the Design of a Router with Both Guaranteed and Best-Effort Services for Networks on Chip
Edwin Rijpkema, Kees Goossens, Andrei Radulescu, John Dielissen, Jef L. van Meerbergen, Paul Wielage, Erwin Waterlander
DATE6
2002 Networks on Silicon: Combining Best-Effort and Guaranteed Services
abstract
We advocate a network on silicon (NOS) as a hardware architecture to implement communication between IP cores in future technologies, and as a software model in the form of a protocol stack to structure the programming of NOSs. We claim guaranteed services are essential. In the ETHEREAL NOS they pervade the NOS as a requirement for hardware design, and as foundation for software programming.
Kees Goossens, Paul Wielage, Ad M. G. Peeters, Jef L. van Meerbergen
DATE2
2002 Networks on Silicon: Blessing or Nightmare?
abstract
Continuing VLSI technology scaling raises several deep submicron (DSM) problems like relatively slow interconnect, power dissipation and distribution, and signal integrity. Those problems are encountered particularly on long wires for global interconnect. As clock frequencies increase, scaled wires become relatively slower and on-chip communication will be the limiting performance factor of future chips. We explain why efficiently sharing of the wires for long distance communication is the solution to this problem. We introduce networks on silicon (NoS), that route packets over shared (semi)-global wires. NoS performance is expected to be high, but comes at a cost. Balancing the performance and cost of a NoS is a major challenge, and we believe busses still have a role to play.
Paul Wielage, Kees Goossens
DSD1