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

Ben Ting

dblp:34/4793 · also B. S. Ting · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 1999
—ORCID · none

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

Systems, architecture and hardware · 4 · 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
Reconfigurable computing and FPGAs · 59% Electronic design automation · 41%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

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

TopicWeightPapersLastEvidence papers
Reconfigurable computing and FPGAs
FPGA architecture
0.011999
A New High Density and Very Low Cost Reprogrammable FPGA Architecture · FPGA 1999
Electronic design automation
physical design
0.031984
GALA - an automatic layout system for high density CMOS gate arrays · DAC 1984
Routing Techniques for Gate Array · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1983
Comments on "An Optimal Solution for the Channel-Assignment Problem" · IEEE Trans. Computers 1981
Reconfigurable computing and FPGAs
FPGA design flow
0.011999
A New High Density and Very Low Cost Reprogrammable FPGA Architecture · FPGA 1999
Electronic design automation › physical design › placement and routing
gate array layout
0.011984
GALA - an automatic layout system for high density CMOS gate arrays · DAC 1984
Electronic design automation › physical design
placement and routing
0.011984
GALA - an automatic layout system for high density CMOS gate arrays · DAC 1984
Electronic design automation › physical design › routing › VLSI routing
gate array routing
0.011983
Routing Techniques for Gate Array · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1983
Electronic design automation › physical design
routing
0.011983
Routing Techniques for Gate Array · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1983
Electronic design automation › physical design › routing
channel routing
0.011981
Comments on "An Optimal Solution for the Channel-Assignment Problem" · IEEE Trans. Computers 1981
Electronic design automation › physical design › routing
global routing
0.011983
Routing Techniques for Gate Array · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1983
Graph algorithms and graph theory
graph algorithms
0.011981
Comments on "An Optimal Solution for the Channel-Assignment Problem" · IEEE Trans. Computers 1981

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

order-independent routing · 0.0hierarchical decomposition · 0.0
YearPublicationVenuePosition
1999 A New High Density and Very Low Cost Reprogrammable FPGA Architecture
abstract
A new reprogrammable FPGA architecture is described which is specifically designed to be of very low cost.It covers a range of 35K to a million usable gates.In addition, it delivers high performance and it is synthesis efficient.This architecture is loosely based on an earlier reprogrammable Actel architecture named ES.By changing the structure of the interconnect and by making other improvements, we achieved an average cost reduction by a factor of three per usable gate.The first member of the family based on this architecture is fabricated on a 2.54 standard 0.25~ CMOS technology with a gate count of up to 130K which also includes 36K bits of two port RAM.The gate count of this part is verified in a fully automatic design flow starting from a high level description followed by synthesis, technology mapping, place and route, and timing extraction.
Sinan Kaptanoglu, Greg Bakker, Arun Kundu, Ivan Corneillet, Ben Ting
FPGA5
1984 GALA - an automatic layout system for high density CMOS gate arrays
Bou Nin Tien, Ben Ting, J. Cheam, Kenneth S. K. Chow, Scott C. Evans
DAC2
1983 Routing Techniques for Gate Array
abstract
This paper describes the routing techniques used for a Hughes internally developed high-density silicon-gate bulk CMOS gate array family. This layout software can be easily adapted to different array sizes and/or technologies (e.g., bipolar) through a change of parameters. A routing model and hierarchical decomposition schemes are presented to address the routability issue. More specifically, this paper focuses on the formulation and analysis of global routing and vertical assignment problems and gives a systematic breakdown of the routing task into well-defined subtasks. Instead of performing sequential routing, techniques and formulations are introduced to achieve a high degree of order independency in all subtasks. In routing subtasks where iterations are required, independent selection and interconnection are performed to avoid order dependency in typical routing problems. Implementation results are provided to indicate the efficiency of the system.
Ben Ting, Bou Nin Tien
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
1981 Comments on "An Optimal Solution for the Channel-Assignment Problem"
abstract
The main thrust of the above paper1appears to be a detailed restatement of the "left-edge algorithm" [1], [2] for channel routing. This algorithm is almost a decade old and is now quite familiar to most workers in the field of LSI design automation. That the authors did not reference this earlier work, and devoted much of their paper to a reexposition certainly detracts from its usefulness.
G. Persky, Bou Nin Tien, Ben Ting
IEEE Trans. Computers3