Sciweavers

365 search results - page 4 / 73
» Reconfigurations in Graphs and Grids
Sort
View
DAIS
2010
14 years 11 months ago
A Reconfiguration Language for Virtualized Grid Infrastructures
The growing needs in computational power to answer to the increasing number of on-line services and the complexity of applications makes it mandatory to build corresponding hardwar...
Rémy Pottier, Marc Léger, Jean-Marc ...
IPPS
1997
IEEE
15 years 1 months ago
Optimal Scheduling for UET-UCT Generalized n-Dimensional Grid Task Graphs
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
Theodore Andronikos, Nectarios Koziris, George K. ...
COCOON
2009
Springer
15 years 4 months ago
Edge-Intersection Graphs of k-Bend Paths in Grids
Edge-intersection graphs of paths in grids are graphs that can be represented with vertices as paths in grids and edges between the vertices of the graph exist whenever two grid pa...
Therese C. Biedl, Michal Stern
75
Voted
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Multi-directional Width-Bounded Geometric Separator and Protein Folding
We introduce the concept of multi-directional width-bounded geometric separator and get improved separator for the grid graph, which improves exact algorithm for the protein foldin...
Bin Fu, Sorinel Adrian Oprisan, Lizhe Xu
FPL
2009
Springer
154views Hardware» more  FPL 2009»
15 years 2 months ago
Compiler assisted runtime task scheduling on a reconfigurable computer
Multitasking reconfigurable computers with one or more reconfigurable processors are being used increasingly during the past few years. One of the major challenges in such systems...
Mojtaba Sabeghi, Vlad Mihai Sima, Koen Bertels