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.

Valavan Manohararajah

dblp:06/3154 · DBLP profile ↗
← Back
8ranked-venue papers
5as first author
0since 2021 · last 2016
—ORCID · none

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

Systems, architecture and hardware · 8 · 5 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
3 papers
Electronic design automation · 59% Reconfigurable computing and FPGAs · 41%

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

TopicWeightPapersLastEvidence papers
Reconfigurable computing and FPGAs
FPGA architecture
0.212016
The Stratix™ 10 Highly Pipelined FPGA Architecture · FPGA 2016
Electronic design automation › physical design › placement and routing
FPGA place-and-route
0.212016
The Stratix™ 10 Highly Pipelined FPGA Architecture · FPGA 2016
Electronic design automation › logic synthesis › technology mapping
FPGA technology mapping
0.112006
Heuristics for Area Minimization in LUT-Based FPGA Technology Mapping · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2006
Electronic design automation
logic synthesis
0.112006
Heuristics for Area Minimization in LUT-Based FPGA Technology Mapping · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2006
Electronic design automation › logic synthesis
technology mapping
0.112006
Heuristics for Area Minimization in LUT-Based FPGA Technology Mapping · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2006
Reconfigurable computing and FPGAs
FPGA physical design
0.112005
Incremental retiming for FPGA physical synthesis · DAC 2005
Electronic design automation
physical design
0.112005
Incremental retiming for FPGA physical synthesis · DAC 2005
Electronic design automation › logic synthesis › sequential circuit optimization
retiming
0.112005
Incremental retiming for FPGA physical synthesis · DAC 2005

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

pipelining · 0.2circuit retiming · 0.2iterative mapping · 0.1depth-bounded heuristics · 0.1linear-time retiming · 0.1
YearPublicationVenuePosition
2016 The Stratix™ 10 Highly Pipelined FPGA Architecture
abstract
This paper describes architectural enhancements in the Altera Stratix? 10 HyperFlex? FPGA architecture, fabricated in the Intel 14nm FinFET process. Stratix 10 includes ubiquitous flip-flops in the routing to enable a high degree of pipelining. In contrast to the earlier architectural exploration of pipelining in pass-transistor based architectures, the direct drive routing fabric in Stratix-style FPGAs enables an extremely low-cost pipeline register. The presence of ubiquitous flip-flops simplifies circuit retiming and improves performance. The availability of predictable retiming affects all stages of the cluster, place and route flow. Ubiquitous flip-flops require a low-cost clock network with sufficient flexibility to enable pipelining of dozens of clock domains. Different cost/performance tradeoffs in a pipelined fabric and use of a 14nm process, lead to other modifications to the routing fabric and the logic element. User modification of the design enables even higher performance, averaging 2.3X faster in a small set of designs.
David M. Lewis, Gordon R. Chiu, Jeffrey Chromczak, David R. Galloway, Ben Gamsa, Valavan Manohararajah, Ian Milton, Tim Vanderhoek, John Van Dyken
FPGA6
2007 Predicting Interconnect Delay for Physical Synthesis in a FPGA CAD Flow
abstract
This paper studies the prediction of interconnect delay in an industrial setting. Industrial circuits and two industrial field-programmable gate-array (FPGA) architectures were used in this paper. We show that there is a large amount of inherent randomness in a state-of-the-art FPGA placement algorithm. Thus, it is impossible to predict interconnect delay with a high degree of accuracy. Furthermore, we show that a simple timing model can be used to predict some aspects of interconnect timing with just as much accuracy as predictions obtained by running the placement tool itself. Using this simple timing model in a two-phase timing driven physical synthesis flow can both improve quality of results and decrease runtime. Next, we present a metric for predicting the accuracy of our interconnect delay model and show how this metric can be used to reduce the runtime of a timing driven physical synthesis flow. Finally, we examine the benefits of using the simple timing model in a timing driven physical synthesis flow, and attempt to establish an upper bound on these possible gains, given the difficulty of interconnect delay prediction.
Valavan Manohararajah, Gordon R. Chiu, Deshanand P. Singh, Stephen Brown 0003
IEEE Trans. Very Large Scale Integr. Syst.1
2006 Adaptive FPGAs: High-Level Architecture and a Synthesis Method
abstract
This paper presents preliminary work exploring adaptive field programmable gate arrays (AFPGAs). An AFPGA is adaptive in the sense that the functionality of subcircuits placed on the chip can change in response to changes observed on certain control signals. We describe the high-level architecture which adds additional control logic and SRAM bits to a traditional FPGA to produce an AFPGA. We also describe a synthesis method that identifies and resynthesizes mutually exclusive pieces of logic so that they may share the resources available in an AFPGA. The architectural feature and its associated synthesis method helps reduce circuit size by 28% on average and up to 40% on select circuits
Valavan Manohararajah, Stephen Brown 0003, Zvonko G. Vranesic
FPL1
2006 Mapping arbitrary logic functions into synchronous embedded memories for area reduction on FPGAs
abstract
This work describes a new mapping technique, RAM-MAP, that identifies parts of circuits that can be efficiently mapped into the synchronous embedded memories found on field programmable gate arrays (FPGAs). Previous techniques developed for mapping into asynchronous embedded memories cannot be used because modern FPGAs do not have asynchronous embedded memories. After technology mapping, an area-prediction cost function is used to guide the selection of logic cones to be placed in embedded memories. Extra logic is added to compensate for missing asynchronous functionality on the synchronous memories. Experiments conducted on Altera's Stratix device family indicate that this embedded memory mapping technique can provide an average area reduction of 6.2% and up to 32.5% on a large set of industrial designs. A small architecture change that increases the size of the FPGA fabric by 0.05% can increase the average area reduction to 14.1% and up to 59.1% on the same design set.
Gordon R. Chiu, Deshanand P. Singh, Valavan Manohararajah, Stephen Brown 0003
ICCAD3
2006 Heuristics for Area Minimization in LUT-Based FPGA Technology Mapping
abstract
In this paper, an iterative technology-mapping tool called IMap is presented. It supports depth-oriented (area is a secondary objective), area-oriented (depth is a secondary objective), and duplication-free mapping modes. The edge-delay model (as opposed to the more commonly used unit-delay model) is used throughout. Two new heuristics are used to obtain area reductions over previously published methods. The first heuristic predicts the effects of various mapping decisions on the area of the final solution, and the second heuristic bounds the depth of the mapping solution at each node. In depth-oriented mode, when targeting five lookup tables (LUTs), IMap obtains depth optimal solutions that are 44.4%, 19.4%, and 5% smaller than those produced by FlowMap, CutMap, and DAOMap, respectively. Targeting the same LUT size in area-oriented mode, IMap obtains solutions that are 17.5% and 9.4% smaller than those produced by duplication-free mapping and ZMap, respectively. IMap is also shown to be highly efficient. Runtime improvements of between 2.3times and 82times are obtained over existing algorithms when targeting five LUTs. Area and runtime results comparing IMap to the other mappers when targeting four and six LUTs are also presented
Valavan Manohararajah, Stephen Brown 0003, Zvonko G. Vranesic
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
2005 Incremental retiming for FPGA physical synthesis
abstract
In this paper, we present a new linear-time retiming algorithm that produces near-optimal results. Our implementation is specically targeted at Altera's Stratix [1] FPGA-based designs, although the techniques described are general enough for any implementation medium. The algorithm is able to handle the architectural constraints of the target device, multiple timing constraints assigned by the user and implicit legality constraints. It ensures that register moves do not create asynchonous problems such as creating a glitch on a clock/reset signal.
Deshanand P. Singh, Valavan Manohararajah, Stephen Brown 0003
DAC2
2005 Post-Placement BDD-Based Decomposition for FPGAs
abstract
This work explores the effect of adding a timing driven functional decomposition step to the traditional field programmable gate array (FPGA) CAD flow. Once placement has completed, alternative decompositions of the logic on the critical path are examined for potential delay improvements. The placed circuit is then modified to use the best decompositions found. Any placement illegalities introduced by the new decompositions are resolved by an incremental placement step. Experiments conducted on Altera's Stratix and Stratix II device families indicate that this functional decomposition technique can provide average performance improvements of 6.1% and 5.6% on a large set of industrial designs, respectively.
Valavan Manohararajah, Deshanand P. Singh, Stephen Brown 0003
FPL1
2002 Automatic Partitioning for Improved Placement and Routing in Complex Programmable Logic Devices
Valavan Manohararajah, Terry P. Borer, Stephen Brown 0003, Zvonko G. Vranesic
FPL1