331 search results - page 8 / 67 » A Parallel Algorithm for Compile-Time Scheduling of Parallel... |
ISPAN
2002
IEEE
14 years 14 days ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
CCGRID
2008
IEEE
14 years 2 months ago
2008
IEEE
Understanding the potential and implications of asymmetric multi-core processors for cluster computing is necessary, as these processors are rapidly becoming mainstream components...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
Consider the problem of scheduling a set of sporadically arriving tasks on a uniform multiprocessor with the goal of meeting deadlines. A processor p has the speed Sp. Tasks can b...
JISE
2007
13 years 7 months ago
2007
CCGRID
2008
IEEE
13 years 9 months ago
2008
IEEE
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...