1531 search results - page 22 / 307 » A performance study of multiprocessor task scheduling algori... |
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
IPPS
2002
IEEE
14 years 9 days ago
2002
IEEE
This paper examines the issue of dynamically scheduling applications on a wide-area network computing system. We construct a simulation model for wide-area task allocation problem...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...
ICPPW
2005
IEEE
14 years 29 days ago
2005
IEEE
Abstract— In the sporadic task model, a task is characterized by three parameters — an execution requirement, a relative deadline, and a period parameter — and has the interp...
EUROPAR
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We consider approaches that allow task migration for scheduling recurrent directed-acyclic-graph (DAG) tasks on symmetric, shared-memory multiprocessors (SMPs) in order t...