534 search results - page 21 / 107 » On Scheduling Parallel Tasks at Twilight |
108
click to vote
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
Schedulinglarge task graphsis an importantissue in parallel computingsince it allowsthe treatment of big size problems. In this paper we tackle the following problem: how to sched...
DATE
2005
IEEE
15 years 3 months ago
2005
IEEE
In this paper we present a new technique which exploits timing-correlation between tasks for scheduling analysis in multiprocessor and distributed systems with tree-shaped task-de...
106
click to vote
CLUSTER
2007
IEEE
15 years 4 months ago
2007
IEEE
— In this article we tackle the problem of scheduling a dynamically generated DAG of multi-processor tasks (M-tasks). At first, we outline the need of such a scheduling approach...
IPPS
2003
IEEE
15 years 2 months ago
2003
IEEE
Load balancing is a key concern when developing parallel and distributed computing applications. The emergence of computational grids extends this problem, where issues of cross-d...
IPPS
2003
IEEE
15 years 2 months ago
2003
IEEE
In this paper we present an adaptation of the Dual Priority Scheduling Algorithm to schedule both hard realtime periodic tasks and soft-aperiodic tasks in shared memory multiproce...