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

Jayaram Bhasker

dblp:81/6969 · DBLP profile ↗
← Back
8ranked-venue papers
6as first author
0since 2021 · last 2004
—ORCID · none

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

Systems, architecture and hardware · 4 · 2 first-authorSoftware engineering, systems software and programming languages · 2 · 1 first-authorTheory of computation · 2 · 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
Electronic design automation · 97% Interconnection networks and networks-on-chip · 3%
Theoretical computer science
1 paper
Computational geometry · 50% Graph algorithms and graph theory · 50%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › high-level synthesis
data path synthesis
0.011995
Datapath synthesis using a problem-space genetic algorithm · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1995
Electronic design automation
high-level synthesis
0.011995
Datapath synthesis using a problem-space genetic algorithm · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1995
Electronic design automation › high-level synthesis
scheduling and allocation
0.011995
Datapath synthesis using a problem-space genetic algorithm · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1995
Electronic design automation
physical design
0.011989
Via Assignment in Single-Row Routing · IEEE Trans. Computers 1989
Electronic design automation › physical design
routing
0.011989
Via Assignment in Single-Row Routing · IEEE Trans. Computers 1989
Graph algorithms and graph theory
planar graphs
0.011986
A linear algorithm to find a rectangular dual of a planar triangulated graph · DAC 1986
Computational geometry › graph drawing
rectangular dual
0.011986
A linear algorithm to find a rectangular dual of a planar triangulated graph · DAC 1986
Interconnection networks and networks-on-chip › routing algorithms
interconnection routing
0.011989
Via Assignment in Single-Row Routing · IEEE Trans. Computers 1989

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

heuristic search · 0.0genetic algorithm · 0.0heuristic algorithm · 0.0complexity analysis · 0.0linear-time algorithm · 0.0
YearPublicationVenuePosition
2004 Improving Design and Verification Productivity with VHDL-200x
abstract
VHDL is a critical language for RTL design and is a major component of the $200+ million RTL simulation market. Many users prefer to use VHDL for RTL design as the language continues to provide desired characteristics in design safety, flexibility and maintainability. While VHDL has provided significant value for digital designers since 1987, it has had only one significant language revision in 1993. It has taken many years for design state-of-practice to catch-up to and, in some cases, surpass the capabilities that have been available in VHDL for over 15 years. Last year, the VHDL analysis and standardization group (VASG), which is responsible for the VHDL standard, received clear indication from the VHDL community that it was now time to look at enhancing VHDL. In response to the user community, VASG initiated the VHDL-200x project. VHDL-200x will result in at least two revisions of the VHDL standard. The first revision is planned to be completed next year (2004) and will include a C language interface (VHPI); a collection of high user value enhancements to improve designer productivity and modeling capability and potential inclusion of assertion-based verification and testbench modeling enhancements. A second revision is planned to follow about2 years later. This paper focuses on the 1/sup st/ revision enhancements.
Erich Marschner, Jayaram Bhasker, Jim Lewis, Peter J. Ashenden
DATE3
1995 Datapath synthesis using a problem-space genetic algorithm
abstract
This paper presents a new approach to datapath synthesis based on a problem-space genetic algorithm (PSGA). The proposed technique performs concurrent scheduling and allocation of functional units, registers, and multiplexers with the objective of finding both a schedule and an allocation which minimizes the cost function of the hardware resources and the total time of execution. The problem-space genetic algorithm based datapath synthesis system (PSGA-Synth) combines a standard genetic algorithm with a known heuristic to search the large design space in an intelligent manner. PSGA-Synth handles multicycle functional units, structural pipelining, conditional code and loops, and provides a mechanism to specify lower and upper bounds on the number of control steps. The PSGA-Synth was tested on a set of problems selected from the literature, as well as larger problems created by us, with promising results. PSGA-Synth not only finds the best known results for all the test problems examined in a relatively small amount of CPU time, but also has the ability to efficiently handle large problems.>
Muhammad K. Dhodhi, Frank H. Hielscher, Robert H. Storer, Jayaram Bhasker
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.4
1989 Via Assignment in Single-Row Routing
abstract
Examines the via assignment problem that arises when the single-row routing approach to the interconnection problem is used. Some new complexity results and two new heuristics are obtained. Experimental results establish the superiority of the new heuristics over earlier ones.>
Jayaram Bhasker, Sartaj Sahni
IEEE Trans. Computers1
1988 A Linear Algorithm to Find a Rectangular Dual of a Planar Triangulated Graph
Jayaram Bhasker, Sartaj Sahni
Algorithmica1
1988 Process-graph Analyser: A Front-end Tool for VHDL Behavioural Synthesis
abstract
Abstract A front‐end of an electronic CAD synthesis system is described. The synthesis system accepts a behavioural description of a digital system design written in VHSIC Hardware Description Language (VHDL) and produces the physical hardware, at the register transfer level, needed for realizing the specified behaviour. The synthesis system comprises three major subsystems: process‐graph analyser, design representation and the MIMOLA synthesis system. The process‐graph analyser is an optimization and parallelization tool. We show how optimizing techniques used for compilers are adapted to perform a similar optimization function for hardware synthesis. We present techniques that extend the parallelization of the sequential programs concept for doing control state partitioning. The technique is new because of the unique synthesis model that MIMOLA uses. Finally, we show how to integrate these concepts using a suitable intermediate behavioural representation called the process graph.
Jayaram Bhasker
Softw. Pract. Exp.1
1987 A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph
abstract
Abstract We develop a linear time algorithm to determine if a given planar triangulated graph has a rectangular dual.
Jayaram Bhasker, Sartaj Sahni
Networks1
1986 A linear algorithm to find a rectangular dual of a planar triangulated graph
abstract
We develop an Ο(n) algorithm to construct a rectangular dual of an n-vertex planar triangulated graph.
Jayaram Bhasker, Sartaj Sahni
DAC1
1986 Via Assignment in Single Row Routing
Jayaram Bhasker, Sartaj Sahni
FSTTCS1