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

J. Robert Heath

dblp:48/3598 · DBLP profile ↗
← Back
11ranked-venue papers
4as first author
1since 2021 · last 2025
—ORCID · none

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

Systems, architecture and hardware · 8 · 3 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-authorComputer networks · 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
4 papers
Electronic design automation · 64% Embedded and real-time systems · 11% Distributed systems · 10%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
physical design
0.011994
PARALLEX: a parallel approach to switchbox routing · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1994
Electronic design automation › physical design › routing › detailed routing
switchbox routing
0.011994
PARALLEX: a parallel approach to switchbox routing · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1994
Distributed systems › distributed coordination
conflict resolution
0.011994
PARALLEX: a parallel approach to switchbox routing · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1994
Parallel and multicore computing
parallel algorithms
0.011994
PARALLEX: a parallel approach to switchbox routing · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1994
Embedded and real-time systems › real-time scheduling
hardware task scheduling
0.011982
A Hardware Task Scheduling Mechanism for a Real-Time Multi-Microprocessor Architecture · RTSS 1982
Embedded and real-time systems
real-time scheduling
0.011982
A Hardware Task Scheduling Mechanism for a Real-Time Multi-Microprocessor Architecture · RTSS 1982
Interconnection networks and networks-on-chip › switching network
multistage interconnection network
0.011980
The Complexity and Use of a Multistage Interconnection Network for Distributed Processing Systems · RTSS 1980
Electronic design automation
hardware/software co-design
0.011977
CDL - A tool for concurrent hardware and software development · DAC 1977
Processor architecture and microarchitecture
multiprocessor architecture
0.011982
A Hardware Task Scheduling Mechanism for a Real-Time Multi-Microprocessor Architecture · RTSS 1982
Electronic design automation › design methodology
design flows and tools
0.011977
CDL - A tool for concurrent hardware and software development · DAC 1977

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

parallel process generation · 0.0conflict resolving · 0.0complexity analysis · 0.0
YearPublicationVenuePosition
2025 FPGA-Based Hardware Implementation of Blue-Noise Stacked Error Diffusion Multitoning
abstract
Blue-noise stacked error diffusion (BSED) is a high-quality multi-level halftoning (multitoning) algorithm based on the blue-noise dithering model. This algorithm transforms a multitoning task into multiple error diffusion halftoning tasks, each producing a sub-halftone with inter-layer dependencies. These sub-halftones are stacked together to form the final visually pleasing multitone with blue-noise characteristics. In this research, the significant potential for parallelizing this multitoning algorithm inspires the design of a novel parallel raster image processor (NPRIP) for highly efficient execution, capable of producing an output pixel every six clock cycles at a clock frequency of 200 MHz. A hardware prototype based on the Xilinx Zynq SoC implements our raster image processor design on the FPGA within the SoC. The prototype is also capable of a conventional software implementation of the BSED algorithm running on the ARM CPU within the SoC. Output images from the prototype are successfully validated in both the spatial and frequency domains. Benchmark results demonstrate a consistent speedup exceeding$30\times $with FPGA co-processing compared to conventional sequential execution on the ARM CPU, reaching a maximum processing speed of 3.963 megapixels per second.
Qishi Hu, Daniel L. Lau, Rishvanth Kora Venugopal, J. Robert Heath
IEEE Trans. Circuits Syst. I Regul. Pap.4
2004 ESP: a flexible, high-performance, PLD-based network service
abstract
Emerging network-level services, such as ephemeral state processing (ESP), provide end systems with the ability to control the way in which their packets are processed at routers in the network. Supporting user-defined per-packet processing at today's wire-speeds requires significant computational power. Special-purpose application specific integrated circuit (ASIC) chips offer the performance, but not the extensibility needed to support these, evolving services. In our previous work, we explored the use of programmable (general-purpose) network processors as a potential solution. Although network processors are easily extensible, they pay a performance penalty for that flexibility. In this paper, we explore a third approach; the use of programmable logic devices (PLD) that combine the flexibility of a network processor with the performance of an ASIC. We describe a PLD implementation of the ESP service, discuss the challenges involved, and present performance numbers showing significant speedups over our previous network processor implementation.
M. Muthulakshmi, J. Robert Heath, Kenneth L. Calvert, Jim Griffioen
ICC2
1994 PARALLEX: a parallel approach to switchbox routing
abstract
A parallel algorithm, called PARALLEX, which uses a conflict resolving method, has been developed for the switchbox routing problem in a parallel processing environment. PARALLEX can achieve a very high degree of parallelism by generating as many processes as nets. Each process is assigned to route a net, which bears the same identification number as the process. If conflicts are found for the current route of a net, then that process classifies the set(s) of conflict segments into groups that are identified by the various types of conflict(s) within each group. Each process with conflicts finds partial solutions by resolving every conflict of a group in the path-finding procedure and merges them with the solutions from other processes, which may or may not have conflicts, to make a conflict-free switchbox. The speed-up for 7and 19-net problems were 4.7 and 10, respectively.>
Tae Won Cho, Sam S. Pyo, J. Robert Heath
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.3
1992 A new conflict resolving switchbox router
abstract
A parallel algorithm, called PARALLEX, which uses a conflict resolving method, has been developed for the switchbox routing problem in the parallel processing environment. PARALLEX can achieve a very high degree of parallelism by generating as many processes as nets. Each process is assigned to route a net, which bears the same identification number as the process. If any conflict is found for the current route of a net, then each process classifies the conflict segments with groups by their relations. Each process finds partial solutions, and merges them with the partial solutions from other processes to make a conflict-free switchbox. The speed-ups for 7-nets and 19-nets problem were 4.7 and 10 respectively.>
Tae Won Cho, Sam S. Pyo, J. Robert Heath
Great Lakes Symposium on VLSI3
1988 A methodology for the control and custom VLSI implementation of large-scale Clos networks
abstract
A control algorithm is developed and implemented for a three-stage Clos network which results in using a multiple-chip approach. The system will be nonblocking in the strict sense and completely self-routing, i.e. the controller for the network will reside in the network and not in a separate computer that runs a program that controls switches to the interconnect array. Intermodule communication required for network operation is described followed by a discussion of how the number of network inputs/outputs may be varied. A delay model of the network is developed.>
J. Robert Heath, Eric Allen Disch
ICCD1
1984 An Integrated-Circuit Crossbar Switching System Design
George Broomell, J. Robert Heath
ICDCS2
1982 A distributed computer architecture for real-time, data driven applications
J. Robert Heath, George Broomell, Andrew D. Hurt
ICDCS1
1982 The Design of a Fault-Tolerant Computing Element for Distributed Data Processors
Andrew D. Hurt, J. Robert Heath
ICDCS2
1982 A Hardware Task Scheduling Mechanism for a Real-Time Multi-Microprocessor Architecture
Andrew D. Hurt, J. Robert Heath
RTSS2
1980 The Complexity and Use of a Multistage Interconnection Network for Distributed Processing Systems
J. Robert Heath, James Cline
RTSS1
1977 CDL - A tool for concurrent hardware and software development
J. Robert Heath, Bill D. Carroll, Terry T. Cwik
DAC1