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

Ganesh Krishnamoorthy

dblp:17/5261 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2007
0000-0002-0388-7378ORCID · corroborated

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

Systems, architecture and hardware · 4 · 1 first-authorArtificial intelligence and machine learning · 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
2 papers
Electronic design automation · 83% Embedded and real-time systems · 17%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
high-level synthesis
0.021993
SALSA: a new approach to scheduling with timing constraints · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993
Data Path Allocation using an Extended Binding Model · DAC 1992
Electronic design automation › high-level synthesis › scheduling
resource-constrained scheduling
0.011993
SALSA: a new approach to scheduling with timing constraints · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993
Electronic design automation › high-level synthesis
scheduling
0.011993
SALSA: a new approach to scheduling with timing constraints · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993
Embedded and real-time systems › real-time scheduling
timing-constrained scheduling
0.011993
SALSA: a new approach to scheduling with timing constraints · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993
Electronic design automation › high-level synthesis › data path synthesis
data path allocation
0.011992
Data Path Allocation using an Extended Binding Model · DAC 1992

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

simulated annealing · 0.0control data flow graph · 0.0constraint solution · 0.0
YearPublicationVenuePosition
2007 Electric field imaging pretouch for robotic graspers
abstract
This paper proposes the use of electric field sensors to implement "pretouch" for robotic grasping. Weakly electric fish use this perceptual channel, but it has not received much attention in robotics. This paper describes a series of manipulators each of which incorporates electric field sensors in a different fashion. In each case, the paper presents techniques for using the sensors, and experimental data collected. First, a simple dynamic-object avoidance technique is presented. Next, a 1-D alignment task for grasping is described. Then linear and rotary electrode scanning techniques are presented. It is shown that these techniques can distinguish a small object at close range from a large object farther away, a capability that may be important for grasping.
Joshua R. Smith 0001, Ryan Wistort, Ganesh Krishnamoorthy
IROS4
1993 SALSA: a new approach to scheduling with timing constraints
abstract
An approach to scheduling in high-level synthesis that meets timing constraints while attempting to minimize hardware resource costs is described. The approach is based on a modified control/data-flow graph (CDFG) representation called SALSA. SALSA provides a simple move set that allows alternative schedules to be quickly explored while maintaining timing constraints. It is shown that this move set is complete in that any legal schedule can be reached using some sequence of move applications. In addition, SALSA provides support for scheduling with conditionals, loops, and subroutines. Scheduling with SALSA is performed in two steps. First, an initial schedule that meets timing constraints is generated using a constraint solution algorithm adapted from layout compaction. Second, the schedule is improved using the SALSA move set under control of a simulated annealing algorithm. Results show the scheduler's ability to find good schedules which meet timing constraints in reasonable execution times.>
John A. Nestor, Ganesh Krishnamoorthy
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.2
1992 Data Path Allocation using an Extended Binding Model
Ganesh Krishnamoorthy, John A. Nestor
DAC1
1990 SALSA: A New Approach to Scheduling with Timing Constraints
abstract
First, an initial schedule that satisfies all timing constraints is generated using algorithms adapted from layout compaction. This schedule is then improved with respect to resource usage using simulated annealing. SALSA provides for efficient exploration of alternative schedules while supporting timing constraints, conditionals, loops, and subroutines. The SALSA scheduling procedure is described in detail. An implementation of the approach shows promising results.>
John A. Nestor, Ganesh Krishnamoorthy
ICCAD2