1156 search results - page 40 / 232 » Optimal scheduling of task graphs on parallel systems |
IPL
2002
14 years 11 months ago
2002
We study the problem of scheduling unit time tasks of two types on m parallel identical machines. For each type, given numbers of tasks are required to be completed by the specifi...
128
click to vote
IPPS
2003
IEEE
15 years 5 months ago
2003
IEEE
In this paper we investigate protocols for scheduling applications that consist of large numbers of identical, independent tasks on large-scale computing platforms. By imposing a ...
101
click to vote
IWOMP
2007
Springer
15 years 6 months ago
2007
Springer
OpenMP is widely used for shared memory parallel programming and is especially useful for the parallelisation of loops. When it comes to task parallelism, however, OpenMP is less p...
100
click to vote
RTSS
2005
IEEE
15 years 5 months ago
2005
IEEE
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform. Since the partitioning probl...
138
click to vote
RTSS
1992
IEEE
15 years 3 months ago
1992
IEEE
The problem of scheduling a set of sporadic tasks that share a set of serially reusable, single unit software resources on a single processor is considered. The correctness condit...