83 search results - page 8 / 17 » Matrix scheduler reloaded |
102
click to vote
ICPP
1993
IEEE
15 years 3 months ago
1993
IEEE
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. If the execution of the program is known ahead of time, then the tasks can be st...
77
Voted
COMCOM
2010
14 years 12 months ago
2010
Offline scheduling is attractive when the traffic profile is known a priori since the complexity of online scheduling is largely removed. Given any admissible rate matrix = (ij),...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
In Grids scheduling decisions are often made on the basis of jobs being either data or computation intensive: in data intensive situations jobs may be pushed to the data and in co...
HPCA
2006
IEEE
16 years 3 days ago
2006
IEEE
Allowing loads to issue out-of-order with respect to earlier unresolved store addresses is very important for extracting parallelism in large-window superscalar processors. Blindl...
IPPS
1996
IEEE
15 years 3 months ago
1996
IEEE
We introduce dag consistency, a relaxed consistency model for distributed shared memory which is suitable for multithreaded programming. We have implemented dag consistency in sof...