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

Joep L. W. Kessels

dblp:66/4342 · DBLP profile ↗
← Back
14ranked-venue papers
12as first author
0since 2021 · last 2001
—ORCID · none

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

Systems, architecture and hardware · 6 · 4 first-authorTheory of computation · 4 · 4 first-authorSoftware engineering, systems software and programming languages · 3 · 3 first-authorDatabases, data management, data science and information retrieval · 3 · 3 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 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
4 papers
Integrated circuit design · 67% Energy-efficient computing · 10% Distributed systems · 9%
Computer networks
1 paper
Internet architecture and protocols · 87% Transport protocols and congestion control · 13%

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

TopicWeightPapersLastEvidence papers
Integrated circuit design
asynchronous circuit design
0.011999
Designing asynchronous standby circuits for a low-power pager · Proc. IEEE 1999
Integrated circuit design
low-power circuit design
0.011999
Designing asynchronous standby circuits for a low-power pager · Proc. IEEE 1999
Energy-efficient computing › low-power design
power optimization
0.011999
Designing asynchronous standby circuits for a low-power pager · Proc. IEEE 1999
Internet architecture and protocols
local area network
0.011988
PHILAN: A LAN Providing a Reliable Message Service for Distributed Processing · IEEE Trans. Software Eng. 1988
Internet architecture and protocols › local area network
ring network
0.011988
PHILAN: A LAN Providing a Reliable Message Service for Distributed Processing · IEEE Trans. Software Eng. 1988
Hardware reliability and fault tolerance › fault-tolerant architecture
fault-tolerant clock
0.011984
Two Designs of a Fault-Tolerant Clocking System · IEEE Trans. Computers 1984
Distributed systems › clock synchronization
fault-tolerant clock synchronization
0.011984
Two Designs of a Fault-Tolerant Clocking System · IEEE Trans. Computers 1984
Parallel and multicore computing › parallel programming models
message passing
0.011981
The Soma: A Programming Construct for Distributed Processing · IEEE Trans. Software Eng. 1981
Parallel and multicore computing
parallel programming models
0.011981
The Soma: A Programming Construct for Distributed Processing · IEEE Trans. Software Eng. 1981
Distributed systems › distributed algorithms
distributed routing
0.011980
The DIMOND: A Component for the Modular Construction of Switching Networks · IEEE Trans. Computers 1980
Electronic design automation › physical design
routing
0.011980
The DIMOND: A Component for the Modular Construction of Switching Networks · IEEE Trans. Computers 1980
Interconnection networks and networks-on-chip › switching network
switching network design
0.011980
The DIMOND: A Component for the Modular Construction of Switching Networks · IEEE Trans. Computers 1980
Transport protocols and congestion control › transport protocols
flow and error control
0.011988
PHILAN: A LAN Providing a Reliable Message Service for Distributed Processing · IEEE Trans. Software Eng. 1988
Distributed systems
fault tolerance
0.011984
Two Designs of a Fault-Tolerant Clocking System · IEEE Trans. Computers 1984

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

synchronization scheme · 0.0scan-test · 0.0asynchronous design · 0.0voltage-controlled oscillators · 0.0autonomous oscillators · 0.0building block design · 0.0
YearPublicationVenuePosition
2001 The tangram framework (embedded tutorial): asynchronous circuits for low power
abstract
Asynchronous CMOS circuits have the potential for very low power consumption, because they only dissipate when and where active. In addition they have favorable EMC properties, since they emit less energy, which in addition is evenly distributed over the spectrum. The Tangram framework supports the design of asynchronous circuits in a high-level programming language. Using this framework we have designed several chips, such as for instance for pagers and smart cards, which are clearly superior to synchronous designs.
Joep L. W. Kessels, Ad M. G. Peeters
ASP-DAC1
1999 Designing asynchronous standby circuits for a low-power pager
abstract
We have designed asynchronous standby circuits for a pager decoder which dissipate four times less power and are 40% larger in size than synchronous designs. For the total pager unit this means a 37% reduction in power dissipation for nearly no additional area. The decoded chip, which apart from the standby circuits is completely synchronous, has been fabricated and was first-time-right. Two problems had to be solved to incorporate asynchronous subcircuits in a synchronous environment: synchronization and testing. A synchronization scheme is described that allows a free intermixing of asynchronous and synchronous modules and a test strategy is proposed in which the scan test facilities in the synchronous environment are used to test the asynchronous modules. One function is prevalent in the standby circuits, namely counting. In an appendix we present the asynchronous design of a so-called loadable counter whose power consumption does not depend on its size.
Joep L. W. Kessels, Paul Marston
Proc. IEEE1
1998 Comparison of the VLSI cost/performance properties of two Reed-Solomon decoding algorithms1
Sylvia M. Jennings, Joep L. W. Kessels
Integr.2
1995 Calculational Derivation of aCounter with Bounded Response Time and Bounded Power Dissipation
Joep L. W. Kessels
Distributed Comput.1
1990 Designing Systolic, Distributed Buffers with Bounded Response Time
Joep L. W. Kessels, Martin Rem
Distributed Comput.1
1990 VLSI Programming for the Compact Disc Player
Joep L. W. Kessels, Frits D. Schalij
Sci. Comput. Program.1
1988 An Exercise in Proving Self-Stabilization with a Variant Function
Joep L. W. Kessels
Inf. Process. Lett.1
1988 PHILAN: A LAN Providing a Reliable Message Service for Distributed Processing
abstract
A local area network (LAN) design based on a ring topology is presented which can support both packet-switched and circuit-switched traffic. The packet-switching service is reliable in that the LAN controllers deal with all protocol problems, i.e., medium arbitrations as well as flow and error control. The service can meet real-time constraints, since the performance is stable under high load conditions and the arbitration delays are bounded. Moreover, the processing speed of the LAN controller is independent of the transmission speed, and the speed requirements are such that they can be met by a microprocessor (no need for dedicated hardware to process the information on the fly). Before the design of PHILAN is presented, an analysis is given of the protocol problems that have to be dealt with when establishing a reliable packet-switching service on a LAN.>
Joep L. W. Kessels
IEEE Trans. Software Eng.1
1984 Two Designs of a Fault-Tolerant Clocking System
abstract
Two designs of a fault-tolerant clocking system are described: a time-discrete design based on autonomous oscillators and a time-continuous design based on voltage-controlled oscillators. In both designs the system consists of a number of identical modules producing as many mutually synchronous binary clock signals. The system is fault-tolerant in that if at most f modules fail, the remaining modules continue to produce synchronous clock signals. The minimum configuration, i.e., the minimum number of modules that guarantees a fault-tolerant operation, is either 3f + 1 or 2f + 1, depending on both the design chosen (time-discrete or time-continuous) and the assumed fault model.
Joep L. W. Kessels
IEEE Trans. Computers1
1982 Arbitration Without Common Modifiable Variables
Joep L. W. Kessels
Acta Informatica1
1981 The Soma: A Programming Construct for Distributed Processing
abstract
A construct is proposed for parallel programming, called soma (software machine). A soma is a sequential process that can communicate with other somas by exchanging messages via mailboxes. The soma construct is well suited for implementation on conventional as well as on distributed computer architectures, the main characteristic of the latter being the absence of a common store.
Joep L. W. Kessels
IEEE Trans. Software Eng.1
1980 The Readers and Writers Problem Avoided
Joep L. W. Kessels
Inf. Process. Lett.1
1980 The DIMOND: A Component for the Modular Construction of Switching Networks
abstract
The DIMOND is a building block for communication networks in which throughput is more important than transmission delay. Its main attraction stems from the fact that it allows the routing of messages through a network to be completely distributed over the individual building blocks.
Pierre G. Jansen, Joep L. W. Kessels
IEEE Trans. Computers2
1979 Two Implementations of the Conditional Critical Region Using a Split Binary Semaphore
Joep L. W. Kessels, Alain J. Martin
Inf. Process. Lett.1