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

Kenneth J. Schultz

dblp:69/4586 · DBLP profile ↗
← Back
7ranked-venue papers
7as first author
0since 2021 · last 1997
—ORCID · none

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

Systems, architecture and hardware · 5 · 5 first-authorComputer networks · 2 · 2 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
2 papers
Performance modeling and evaluation · 32% Integrated circuit design · 25% Interconnection networks and networks-on-chip · 22%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation › network performance analysis
switch performance
0.011997
Physical performance limits for shared buffer ATM switches · IEEE Trans. Commun. 1997
Integrated circuit design
technology scaling
0.011997
Physical performance limits for shared buffer ATM switches · IEEE Trans. Commun. 1997
Distributed systems
contention resolution
0.011996
Multicast contention resolution with single-cycle windowing using content addressable FIFO's · IEEE/ACM Trans. Netw. 1996
Interconnection networks and networks-on-chip
switch architecture
0.011996
Multicast contention resolution with single-cycle windowing using content addressable FIFO's · IEEE/ACM Trans. Netw. 1996

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

performance projection · 0.0simulation · 0.0
YearPublicationVenuePosition
1997 Content-addressable memory core cells A survey
Kenneth J. Schultz
Integr.1
1997 Authors' reply to "A note on architectures for large-capacity CAMs"
Kenneth J. Schultz, P. Glenn Gulak
Integr.1
1997 Physical performance limits for shared buffer ATM switches
abstract
Performance studies, linking ATM switch capabilities to physical limitations imposed by integrated circuit technology, have been scarce. This paper explores trends in circuit capabilities, and makes projections toward the 0.25-/spl mu/m technologies that will be available to all switch designers in the year 2000. The limits imposed by circuit technology are applied to shared buffer ATM switches. We determine requirements and physical limits for buffer capacity, buffer throughput, chip I/O throughput, and power dissipation. As a result, we are able to project chip counts, aggregate switch throughputs, and switch dimensions. As well, performance capabilities of single-chip shared buffer switches are estimated. A single-chip shared buffer switch implemented in 0.25-/spl mu/m technology will be capable of an aggregate throughput of 1.3 Tb/s, will accomplish almost arbitrarily low cell loss rates for bursty traffic, and may be integrated together with translation tables supporting hundreds of connections per port.
Kenneth J. Schultz, P. Glenn Gulak
IEEE Trans. Commun.1
1996 Multicast contention resolution with single-cycle windowing using content addressable FIFO's
abstract
Asynchronous transfer mode (ATM) has been designated as the switching environment for future broadband integrated services digital networks (BISDN) networks and services. Although input-buffered space switches are more economical and simpler to implement than output-buffered space switches, they suffer from external blocking because of destination port contention. We review contention resolution methods used to avoid external blocking, and choose a solution based on ring reservation, resulting in an elegant and efficient mechanism requiring only nearest-neighbor communications. In addition to external blocking, space switches suffer from head-of-line (HOL) blocking, and our technique alleviates HOL blocking without arbitration time overhead. This method makes use of a novel content addressable first in/first out (CAFIFO) to achieve single-cycle windowing, and the CAFIFO design and operation are described in detail. High multicast throughput is achieved by employing call-splitting. Multiple latency priorities can also be supported. Simulation results, for both unicast and multicast switching, and both random and bursty traffic, highlight the versatility and excellent performance of the CAFIFO-based switch.
Kenneth J. Schultz, P. Glenn Gulak
IEEE/ACM Trans. Netw.1
1995 Architectures for large-capacity CAMs
Kenneth J. Schultz, P. Glenn Gulak
Integr.1
1993 A Logic-enhanced Memory for Digital Data Recovery Circuits
Kenneth J. Schultz, P. Glenn Gulak
ISCAS1
1989 A microprogrammable processor using single poly EPROM
Kenneth J. Schultz, David H. K. Hoe, C. André T. Salama
Integr.1