331 search results - page 18 / 67 » A Parallel Algorithm for Compile-Time Scheduling of Parallel... |
96
Voted
IPPS
2005
IEEE
15 years 8 months ago
2005
IEEE
Pfair scheduling, currently the only known way of optimally scheduling recurrent real-time tasks on multiprocessors, imposes certain requirements that may limit its practical impl...
118
click to vote
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
Partitioning and global scheduling are two approaches for scheduling real-time tasks on multiprocessors. Though partitioning is sub-optimal, it has traditionally been preferred; t...
128
click to vote
ICSM
2005
IEEE
15 years 8 months ago
2005
IEEE
Large-scale legacy programs take long time to compile, thereby hampering productivity. This paper presents algorithms that reduce compilation time by analyzing syntactic dependenc...
240
click to vote
CISIS
2010
IEEE
14 years 6 months ago
2010
IEEE
Work-stealing is the todays algorithm of choice for dynamic load-balancing of irregular parallel applications on multiprocessor systems. We have evaluated the algorithm’s effic...
155
click to vote
CLUSTER
2007
IEEE
15 years 8 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...