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.

Barry Shackleford

dblp:39/2524 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
0since 2021 · last 2002
—ORCID · none

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

Systems, architecture and hardware · 5 · 3 first-authorArtificial intelligence and machine learning · 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
4 papers
Reconfigurable computing and FPGAs · 60% Electronic design automation · 23% Embedded and real-time systems · 13%
Software engineering, system software, and programming languages
2 papers
Compilers and program optimization · 66% Programming languages and type systems · 34%
Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%

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

TopicWeightPapersLastEvidence papers
Reconfigurable computing and FPGAs › FPGA-based hardware security
FPGA-based random number generation
0.012002
FPGA implementation of neighborhood-of-four cellular automata random number generators · FPGA 2002
Electronic design automation
high-level synthesis
0.012001
Attacking the semantic gap between application programming languages and configurable hardware · FPGA 2001
Reconfigurable computing and FPGAs › FPGA accelerator
FPGA-based genetic algorithm
0.012000
An FPGA-based genetic algorithm machine (poster abstract) · FPGA 2000
Compilers and program optimization › compiler construction
compiler generation
0.011997
Memory-CPU Size Optimization for Embedded System Designs · DAC 1997
Embedded and real-time systems
embedded system design
0.011997
Memory-CPU Size Optimization for Embedded System Designs · DAC 1997
Cryptographic primitives and cryptanalysis
random number generation
0.012002
FPGA implementation of neighborhood-of-four cellular automata random number generators · FPGA 2002
Reconfigurable computing and FPGAs
FPGA implementation
0.012002
FPGA implementation of neighborhood-of-four cellular automata random number generators · FPGA 2002
Reconfigurable computing and FPGAs › FPGA accelerator
FPGA coprocessor
0.012000
An FPGA-based genetic algorithm machine (poster abstract) · FPGA 2000

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

diehard testing · 0.1cellular automata · 0.1compiler construction · 0.1system cost minimization · 0.0genetic algorithm · 0.0
YearPublicationVenuePosition
2002 FPGA implementation of neighborhood-of-four cellular automata random number generators
abstract
Random number generators (RNGs) based upon neighborhood-of-four cellular automata (CA) with asymmetrical, non-local connections are explored. A number of RNGs that pass Marsaglia's rigorous Diehard suite of random number tests have been discovered. A neighborhood size of four allows a single CA cell to be implemented with a four-input lookup table and a one-bit register which are common building blocks in popular field programmable gate arrays (FPGAs). The investigated networks all had periodic (wrap around) boundary conditions with either 1-d, 2-d, or 3-d interconnection topologies. Trial designs of 64-bit networks using a Xilinx XCV1000-6 FPGA predict a maximum clock rate of 214 MHz to 230 MHz depending upon interconnection topology.
Barry Shackleford, Motoo Tanaka, Richard J. Carter, Greg Snider
FPGA1
2001 Attacking the semantic gap between application programming languages and configurable hardware
abstract
It is difficult to exploit the massive, fine-grained parallelism of configurable hardware with a conventional application program?ming language such as C, Pascal or Java. The difficulty arises from the mismatch between the synchronous, concurrent processing capability of the hardware and the expressiveness of the lan?guage-the so-called semantic gap. We attack this problem by using a programming model matched to the hardware's capabilities that can be implemented in any (unmodified) object-oriented lan?guage, and building a corresponding compiler. The result is appli?cation code that can be developed, compiled, debugged and executed on a personal computer using conventional tools (such as Visual C++ or Visual Cafe), and then recompiled without modifi?cation to the configurable hardware target. A straightforward C++ implementation of the Serpent encryption algorithm compiled with our compiler onto a Virtex XCV1000 FPGA yielded an implemen?tation that was smaller (3200 vs. 4502 CLBs) and faster (77 MHz vs. 38 MHz) than an independent VHDL implementation with the same degree of pipelining. A tuned version of the source yielded an implementation that ran at 95 MHz.
Greg Snider, Barry Shackleford, Richard J. Carter
FPGA2
2000 An FPGA-based genetic algorithm machine (poster abstract)
abstract
No abstract available.
Barry Shackleford, Etsuko Okushi, Mitsuhiro Yasuda, Hisao Koizumi, Katsuhiko Seo, Takashi Iwamoto, Hiroto Yasuura
FPGA1
1998 A Top-down Hardware/Software Co-Simulation Method for Embedded Systems Based Upon a Component Logical Bus Architecture
abstract
We propose a top-down hardware/software co-simulation method for embedded systems and introduce a component logical bus architecture as an interface between software components and hardware components. Co-simulation using a component logical bus architecture is possible in the same environment from the stage at which the processor is not yet determined to the stage at which the processor is modeled in register transfer language. A model whose design is based on a component logical bus architecture is replaceable and reusable. By combining such replaceable models, it is possible to quickly realize seamless co-simulation. We further describe experimental results of our approach.
Mitsuhiro Yasuda, Katsuhiko Seo, Hisao Koizumi, Barry Shackleford, Fumio Suzuki
ASP-DAC4
1997 Memory-CPU Size Optimization for Embedded System Designs
abstract
Entire systems embedded in a chip and consistingof a processor, memory, and system-specific peripheral hardwareare now commonly contained in commodity electronicdevices. Cost minimization of these systems is of paramounteconomic importance to manufactures of these devices. Byemploying a variable configuration processor in conjunctionwith a multi-precision compiler generator there are situationsin which considerable system cost reduction can be obtainedby synthesizing a CPU that is narrower than the largest variablein the application program.
Barry Shackleford, Mitsuhiro Yasuda, Etsuko Okushi, Hisao Koizumi, Hiroyuki Tomiyama, Hiroto Yasuura
DAC1
1997 A High-Performance Hardware Implementation of a Survival-Based Genetic Algorithm
Barry Shackleford, Etsuko Okushi, Mitsuhiro Yasuda, Hisao Koizumi, Katsuhiko Seo, Takashi Iwamoto, Hiroto Yasuura
ICONIP (1)1