365 search results - page 20 / 73 » Reconfigurations in Graphs and Grids |
ISAAC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
114
click to vote
FCCM
2009
IEEE
15 years 3 months ago
2009
IEEE
Scheduling and partitioning of task graphs on reconfigurable hardware needs to be carefully carried out in order to achieve the best possible performance. In this paper, we demons...
SC
2003
ACM
15 years 5 months ago
2003
ACM
Realistic workloads are essential in evaluating middleware for computational grids. One important component is the raw grid itself: a network topology graph annotated with the har...
111
click to vote
DAC
2003
ACM
16 years 24 days ago
2003
ACM
Widespread adoption of reconfigurable devices requires system level synthesis techniques to take an application written in a high level language and map it to the reconfigurable d...
104
click to vote
ARC
2010
Springer
15 years 3 months ago
2010
Springer
Coarse Grained Reconfigurable Array (CGRA) architectures give high throughput and data reuse for regular algorithms while providing flexibility to execute multiple algorithms on th...