42 search results - page 6 / 9 » Comparing Static and Dynamic Code Scheduling for Multiple-In... |
PARELEC
2002
IEEE
13 years 10 months ago
2002
IEEE
Many practical applications generate irregular, nonbalanced divide-and-conquer trees which have different depths, possibly also different numbers of successors at different levels...
ICS
2005
Tsinghua U.
13 years 11 months ago
2005
Tsinghua U.
In an out-of-order issue processor, instructions are dynamically reordered and issued to function units in their dataready order rather than their original program order to achiev...
HCW
2000
IEEE
13 years 10 months ago
2000
IEEE
Recently, we presented two very low-cost approaches to compile-time list scheduling where the tasks’ priorities are computed statically or dynamically, respectively. For homogen...
IPPS
1996
IEEE
13 years 10 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...
IPPS
2003
IEEE
13 years 11 months ago
2003
IEEE
OpenMP has emerged as a widely accepted standard for writing shared memory programs. Hardware-specific extensions such as data placement are usually needed to improve the scalabi...