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

John R. Feehrer

dblp:55/3798 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 1996
—ORCID · none

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

Systems, architecture and hardware · 3 · 2 first-authorComputer networks · 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
2 papers
Interconnection networks and networks-on-chip · 100%
Computer networks
1 paper
Optical networks · 50% Routing and switching · 50%

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

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip
optical interconnection networks
0.011996
Packet Synchronization for Synchronous Optical Deflection-Routed Interconnection Networks · IEEE Trans. Parallel Distributed Syst. 1996
Routing and switching › adaptive routing
deflection routing
0.011994
Design and Implementation of a Prototype Optical Deflection Network · SIGCOMM 1994
Optical networks › optical switching
optical packet switching
0.011994
Design and Implementation of a Prototype Optical Deflection Network · SIGCOMM 1994
Interconnection networks and networks-on-chip
network topology
0.011996
Packet Synchronization for Synchronous Optical Deflection-Routed Interconnection Networks · IEEE Trans. Parallel Distributed Syst. 1996
Interconnection networks and networks-on-chip › switching network › multistage interconnection network
shufflenet
0.011996
Packet Synchronization for Synchronous Optical Deflection-Routed Interconnection Networks · IEEE Trans. Parallel Distributed Syst. 1996

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

prototype implementation · 0.0link delay balancing · 0.0directed graph network modeling · 0.0constrained minimization · 0.0
YearPublicationVenuePosition
1996 Packet Synchronization for Synchronous Optical Deflection-Routed Interconnection Networks
abstract
Deflection routing resolves output port contention in packet switched multiprocessor interconnection networks by granting the preferred port to the highest priority packet and directing contending packets out other ports. When combined with optical links and switches, deflection routing yields simple bufferless nodes, high bit rates, scalable throughput, and low latency. We discuss the problem of packet synchronization in synchronous optical deflection networks with nodes distributed across boards, racks, and cabinets. Synchronous operation is feasible due to very predictable optical propagation delays. A routing control processor at each node examines arriving packets and assigns them to output ports. Packets arriving on different input ports must be bit wise aligned; there are no elastic buffers to correct for mismatched arrivals. "Time of flight" packet synchronization is done by balancing link delays during network design. Using a directed graph network model, we formulate a constrained minimization problem for minimizing link delays subject to synchronization and packaging constraints. We demonstrate our method on a ShuffleNet graph, and show modifications to handle multiple packet sizes and latency critical paths.
John R. Feehrer, Lars H. Ramfelt
IEEE Trans. Parallel Distributed Syst.1
1994 Timing uncertainty analysis for time-of-flight systems
John R. Feehrer, Harry F. Jordan
ICCAD1
1994 Design and Implementation of a Prototype Optical Deflection Network
abstract
We describe the design and implementation of a packet-switched fiber optic interconnect prototype with a ShuffleNet topology, intended for use in shared-memory multiprocessors. Coupled with existing latency-hiding mechanisms, it can reduce latency to remote memory locations. Nodes use deflection routing to resolve contention. Each node contains a processor, memory, photonic switch, and packet routing processor. Payload remains in optical form from source to final destination. Each host processor is a commercial workstation with FIFO interfaces between its bus and the photonic switch. A global clock is distributed optically to each node to minimize skew. Component costs and network performance figures are presented for various node configurations including bit-per-wavelength and fiber-parallel packet formats. Our efforts to implement and test a practical interconnect including real host computers distinguishes our work from previous theoretical and experimental work. We summarize obstacles we encountered and discuss future work.
John R. Feehrer, Jon Sauer, Lars H. Ramfelt
SIGCOMM1
1991 Memory System for a Statically Scheduled Supercomputer
Chandra S. Joshi, Brad A. Reger, John R. Feehrer
ICPP (1)3