365 search results - page 13 / 73 » Reconfigurations in Graphs and Grids |
102
Voted
IPPS
2003
IEEE
15 years 5 months ago
2003
IEEE
Reconfigurable hardware resources are very expensive, and yet can be underutilized. This paper describes a middleware capable of discovering underutilized computing nodes with FPG...
101
click to vote
COCOON
2006
Springer
15 years 3 months ago
2006
Springer
We determine the values of the acyclic chromatic index of a class of graphs referred to as d-dimensional partial tori. These are graphs which can be expressed as the cartesian prod...
DM
2008
14 years 12 months ago
2008
We introduce a new graph for all whose cartesian powers the vertex isoperimetric problem has nested solutions. This is the fourth kind of graphs with this property besides the wel...
FPL
2007
Springer
15 years 1 months ago
2007
Springer
Reconfiguration time in dynamically-reconfigurable modular systems can severely limit application run-time compared to the critical path delay. In this paper we present a novel ...
122
click to vote
RSP
2000
IEEE
15 years 4 months ago
2000
IEEE
Dataflow programming has proven to be popular for representing applications in rapid prototyping tools for digital signal processing (DSP); however, existing dataflow design tools...