Demo Data from VLDB 2026 / reviewers in the wild / expert
Greg Snider
dblp:45/3092
· DBLP profile ↗
12ranked-venue papers
2as first author
0since 2021 · last 2011
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 9 · 2 first-authorArtificial intelligence and machine learning · 2Graphics, computer vision, multimedia, augmented reality and games · 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
4 papers |
Electronic design automation · 54% Reconfigurable computing and FPGAs · 46% | |
| Software engineering, system software, and programming languages
2 papers |
Compilers and program optimization · 54% Programming languages and type systems · 46% | |
| Network and information security
1 paper |
Cryptographic primitives and cryptanalysis · 100% |
Topics — the 7 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Electronic design automation
high-level synthesis |
0.1 | 2 | 2002 | Performance-constrained pipelining of software loops onto reconfigurable hardware · FPGA 2002 Attacking the semantic gap between application programming languages and configurable hardware · FPGA 2001 |
Reconfigurable computing and FPGAs › FPGA-based hardware security
FPGA-based random number generation |
0.0 | 1 | 2002 | FPGA implementation of neighborhood-of-four cellular automata random number generators · FPGA 2002 |
Reconfigurable computing and FPGAs
FPGA architecture |
0.0 | 1 | 1996 | Plasma: An FPGA for Million Gate Systems · FPGA 1996 |
Cryptographic primitives and cryptanalysis
random number generation |
0.0 | 1 | 2002 | FPGA implementation of neighborhood-of-four cellular automata random number generators · FPGA 2002 |
Compilers and program optimization › instruction scheduling › software pipelining
modulo scheduling |
0.0 | 1 | 2002 | Performance-constrained pipelining of software loops onto reconfigurable hardware · FPGA 2002 |
Reconfigurable computing and FPGAs
FPGA implementation |
0.0 | 1 | 2002 | FPGA implementation of neighborhood-of-four cellular automata random number generators · FPGA 2002 |
Electronic design automation
physical design |
0.0 | 1 | 1996 | Plasma: An FPGA for Million Gate Systems · FPGA 1996 |
Methods — techniques the papers use, named apart from their topics
retimed modulo scheduling · 0.1iterative modulo scheduling · 0.1diehard testing · 0.1cellular automata · 0.1compiler construction · 0.1FPGA architecture design · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2011 | Review and unification of learning framework in Cog Ex Machina platform for memristive neuromorphic hardwareabstractRealizing adaptive brain functions subserving perception, cognition, and motor behavior on biological temporal and spatial scales remains out of reach for even the fastest computers. Newly introduced memristive hardware approaches open the opportunity to implement dense, low-power synaptic memories of up to 1015bits per square centimeter. Memristors have the unique property of “remembering” the past history of their stimulation in their resistive state and do not require power to maintain their memory, making them ideal candidates to implement large arrays of plastic synapses supporting learning in neural models. Over the past decades, many learning rules have been proposed in the literature to explain how neural activity shapes synaptic connections to support adaptive behavior. To ensure an optimal implementation of a large variety of learning rules in hardware, some general and easily parameterized form of learning rule must be designed. This general form learning equation would allow instantiation of multiple learning rules through different parameterizations, without rewiring the hardware. This paper characterizes a subset of local learning rules amenable to implementation in memristive hardware. The analyzed rules belong to four broad classes: Hebb rule derivatives with various methods for gating learning and decay, Threshold rule variations including the covariance and BCM families, Input reconstruction-based learning rules, and Explicit temporal trace-based rules. Anatoli Gorchetchnikov, Massimiliano Versace, Heather Ames, Ben Chandler, Jasmin Léveillé, Gennady Livitz, Ennio Mingolla, Greg Snider, Rick Amerson, Dick Carter, Hisham Abdalla, Muhammad Shakeel Qureshi |
IJCNN | 8 |
| 2011 | Visually-guided adaptive robot (ViGuAR)abstractA neural modeling platform known as Cog ex Machina1(Cog) developed in the context of the DARPA SyNAPSE2program offers a computational environment that promises, in a foreseeable future, the creation of adaptive whole-brain systems subserving complex behavioral functions in virtual and robotic agents. Cog is designed to operate on low-powered, extremely storage-dense memristive hardware3that would support massively-parallel, scalable computations. We report an adaptive robotic agent, ViGuAR4, that we developed as a neural model implemented on the Cog platform. The neuromorphic architecture of the ViGuAR brain is designed to support visually-guided navigation and learning, which in combination with the path-planning, memory-driven navigation agent - MoNETA5- also developed at the Neuromorphics Lab at Boston University, should effectively account for a wide range of key features in rodents' navigational behavior. Gennady Livitz, Heather Ames, Ben Chandler, Anatoli Gorchetchnikov, Jasmin Léveillé, Zlatko Vasilkoski, Massimiliano Versace, Ennio Mingolla, Greg Snider, Rick Amerson, Dick Carter, Hisham Abdalla, Muhammad Shakeel Qureshi |
IJCNN | 9 |
| 2007 | Defect-tolerant Logic with Nanoscale Crossbar Circuits
Tad Hogg, Greg Snider |
J. Electron. Test. | 2 |
| 2002 | FPGA implementation of neighborhood-of-four cellular automata random number generatorsabstractRandom 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 |
FPGA | 4 |
| 2002 | Performance-constrained pipelining of software loops onto reconfigurable hardwareabstractRetiming and slowdown are algorithms that can be used to pipeline synchronous circuits. Iterative modulo scheduling is an algorithm for software pipelining in the presence of resource constraints. Integrating the best features of both yields a pipelining algorithm, retimed modulo scheduling, that can more effectively exploit the idiosyncrasies of reconfigurable hardware. It also fits naturally into a design space exploration process to trade-off speed for power, energy or area. Greg Snider |
FPGA | 1 |
| 2001 | Attacking the semantic gap between application programming languages and configurable hardwareabstractIt 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 |
FPGA | 1 |
| 2000 | High-Level Synthesis of Nonprogrammable Hardware AcceleratorsabstractThe PICO-N system automatically synthesizes embedded nonprogrammable accelerators to be used as co-processors for functions expressed as loop nests in C. The output is synthesizable VHDL that defines the accelerator at the register transfer level (RTL). The system generates a synchronous array of customized VLIW (very-long instruction word) processors, their controller local memory, and interfaces. The system also modifies the user's application software to make use of the generated accelerator. The user indicates the throughput to be achieved by specifying the number of processors and their initiation interval. In experimental comparisons, PICO-N designs are slightly more costly than hand-designed accelerators with the same performance. Robert Schreiber, Shail Aditya, Bob Rau, Vinod Kathail, Scott A. Mahlke, Santosh G. Abraham, Greg Snider |
ASAP | 7 |
| 1997 | Defect tolerance on the Teramac custom computerabstractTeramac is a large custom computer which works correctly despite the fact that three quarters of its FPGAs contain defects. This is accomplished through unprecedented use of defect tolerance, which substantially reduces Teramac's cost and permits it to have an unusually complex interconnection network. Teramac tolerates defective resources, like gates and wires, that are introduced during the manufacture of its FPGAs and other components, and during assembly of the system. We have developed methods to precisely locate defects. User designs are mapped onto the system by a completely automated process that avoids the defects and hides the defect tolerance from the user. Defective components are not physically removed from the system. W. Bruce Culbertson, Rick Amerson, Richard J. Carter, Philip Kuekes, Greg Snider |
FCCM | 5 |
| 1997 | Implementations of cube-4 on the teramac custom computing machine
Urs Kanus, Michael Meißner, Wolfgang Straßer, Hanspeter Pfister, Arie E. Kaufman, Rick Amerson, Richard J. Carter, W. Bruce Culbertson, Philip Kuekes, Greg Snider |
Comput. Graph. | 10 |
| 1996 | Exploring architectures for volume visualization on the Teramac custom computerabstractIn the past year we have gained experience in custom computing by porting a number of large applications to Teramac. Teramac is a custom computer capable of executing million-gate user designs at speeds approaching one megahertz. Teramac includes software that fully automates the conversion of high-level user designs to configurations that are ready to run on Teramac. Two applications, both in excess of a quarter million gates, are described here: an artery-extraction filter that locates and highlights arteries in medical MRI datasets; and Cube, a volume-rendering engine. We have discovered the importance of scalable, parameterized designs. We have been successful in parameterizing some aspects of our designs and we have identified improvements to our tools which would facilitate further parameterization. Our users have benefitted from the speed at which their applications run on Teramac and have gained confidence in their designs after seeing them run on actual hardware. W. Bruce Culbertson, Rick Amerson, Richard J. Carter, Philip Kuekes, Greg Snider |
FCCM | 5 |
| 1996 | Plasma: An FPGA for Million Gate SystemsabstractNo abstract available. Rick Amerson, Richard J. Carter, W. Bruce Culbertson, Philip Kuekes, Greg Snider, Lyle Albertson |
FPGA | 5 |
| 1995 | Teramac-configurable custom computingabstractThe Teramac configurable hardware system can execute synchronous logic designs of up to one million gates at rates up to 1 megahertz. A fully configured Teramac includes half a gigabyte of RAM and hardware support for large multiported register files. The system has been built from custom FPGA's packaged in large multichip modules (MCMs). A large custom circuit (/spl sim/1,000,000 gates) may be compiled onto the hardware in approximately 2 hours, without user intervention. The system is being used to explore the potential of custom computing machinery (CCM). Rick Amerson, Richard J. Carter, W. Bruce Culbertson, Philip Kuekes, Greg Snider |
FCCM | 5 |