1609 search results - page 84 / 322 » A Microeconomic Scheduler for Parallel Computers |
108
click to vote
PDCAT
2004
Springer
15 years 10 months ago
2004
Springer
DFS has previously been shown to be a simple and efficient strategy for removing cycles in graphs allowing the resulting DAGs to be scheduled using one of the many well-established...
126
click to vote
VLSISP
2010
14 years 11 months ago
2010
We propose a new parallelization scheme for the hmmsearch function of the HMMER software, in order to target FPGA technology. hmmsearch is a very compute intensive software for bio...
142
click to vote
IPPS
1997
IEEE
15 years 8 months ago
1997
IEEE
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 ...
140
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
136
click to vote
TC
2002
15 years 4 months ago
2002
The low cost and wide availability of networks of workstations have made them an attractive solution for high performance computing. However, while a network of workstations may be...