Sciweavers

48 search results - page 7 / 10
» Reconfigurable Universal Adder
Sort
View
CORR
2004
Springer
137views Education» more  CORR 2004»
13 years 7 months ago
Implementation of Logical Functions in the Game of Life
: The Game of Life cellular automaton is a classical example of a massively parallel collision-based computing device. The automaton exhibits mobile patterns, gliders, and generato...
Jean-Philippe Rennard
VLSID
1996
IEEE
106views VLSI» more  VLSID 1996»
13 years 11 months ago
VLSI/WSI Designs for Folded Cube-Connected Cycles Architectures
This paper presents VLSI/WSI designs for a recently introduced parallel architecture known as the folded cube-connected cycles (FCCC). We first discuss two layouts for the FCCC, i...
M. P. Sebastian, P. S. Nagendra Rao, Lawrence Jenk...
AHS
2006
IEEE
125views Hardware» more  AHS 2006»
14 years 1 months ago
Evolving Hardware with Self-reconfigurable connectivity in Xilinx FPGAs
Randomly connecting networks have proven to be universal computing machines. By interconnecting a set of nodes in a random way one can model very complicated non-linear dynamic sy...
Andres Upegui, Eduardo Sanchez
SPAA
2009
ACM
14 years 8 months ago
Buffer management for colored packets with deadlines
We consider buffer management of unit packets with deadlines for a multi-port device with reconfiguration overhead. The goal is to maximize the throughput of the device, i.e., the...
Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Mosci...
TPDS
1998
92views more  TPDS 1998»
13 years 7 months ago
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes
—A matrix A of size m œ n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 ‹ i < j ‹ m, the minimum value in row j lies below or to...
Koji Nakano, Stephan Olariu