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

Richard R. Gassner

dblp:74/4473 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1998
—ORCID · none

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

Systems, architecture and hardware · 1Human-computer interaction and ubiquitous computing · 1Applied, interdisciplinary, general and emerging computing · 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
1 paper
Parallel and multicore computing · 100%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › parallelization strategies
distributed-memory parallelization
0.011996
Multitarget Tracking Algorithm Parallelization for Distributed-Memory Computing Systems · HPDC 1996
Parallel and multicore computing
load balancing
0.011996
Multitarget Tracking Algorithm Parallelization for Distributed-Memory Computing Systems · HPDC 1996
Parallel and multicore computing › parallel algorithms
parallel algorithm design
0.011996
Multitarget Tracking Algorithm Parallelization for Distributed-Memory Computing Systems · HPDC 1996
Parallel and multicore computing
task allocation
0.011996
Multitarget Tracking Algorithm Parallelization for Distributed-Memory Computing Systems · HPDC 1996
Parallel and multicore computing
task scheduling
0.011996
Multitarget Tracking Algorithm Parallelization for Distributed-Memory Computing Systems · HPDC 1996

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

optimization-based assignment · 0.0interacting multiple model · 0.0SPMD · 0.0
YearPublicationVenuePosition
1998 Automated hardware design using genetic programming, VHDL, and FPGAs
abstract
We have developed a completely automated approach to hardware design based on integrating three core technologies into one comprehensive system, namely genetic programming (GP), the VHSIC Hardware Description Language (VHDL) and field programmable gate arrays (FPGAs). Our system uses an automated GP engine, as opposed to a human designer, to evolve a hardware design composed of one or more FPGAs that will maximally achieve an application's software requirements. Several variants of our system exist; other variants are currently under development. The focus of this paper is to describe our original system design and its most recent revision to date.
Robert L. Popp, David J. Montana, Richard R. Gassner, Gordon Vidaver, Suraj Iyer
SMC3
1996 Multitarget Tracking Algorithm Parallelization for Distributed-Memory Computing Systems
abstract
We present a robust scalable parallelization of a multitarget tracking algorithm developed for air traffic surveillance. We couple the state estimation and data association problems by embedding an interacting multiple model (IMM) state estimator into an optimization-based assignment framework. A SPMD distributed-memory parallelization is described wherein the interface to the optimization problem, namely computing the rather numerous gating and IMM state estimates, covariance calculations, and likelihood function evaluations (used as cost coefficients in the assignment problem), is parallelized. We describe several heuristic algorithms developed for the inherent task allocation problem wherein the problem is one of assigning track tasks, having uncertain processing costs and negligible communication costs, across a set of homogeneous processors to minimize workload imbalances. Using a measurement database based on two FAA air traffic central radars, courtesy of Rome Laboratory, we show that near linear speedups are obtainable on a 32-node Intel Paragon supercomputer using simple task allocation algorithms.
Robert L. Popp, Krishna R. Pattipati, Yaakov Bar-Shalom, Richard R. Gassner
HPDC4