331 search results - page 9 / 67 » A Parallel Algorithm for Compile-Time Scheduling of Parallel... |
PDCAT
2004
Springer
15 years 7 months ago
2004
Springer
DFS has previously been shown to be a simple and efficient strategy for removing cycles in graphs allowing the resulting DAGs to be scheduled using one of the many well-established...
102
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
Abstract. The nano-threads programming model was proposed to effectively integrate multiprogramming on shared-memory multiprocessors, with the exploitation of fine-grain parallelis...
148
click to vote
IPPS
2003
IEEE
15 years 7 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...
109
click to vote
IC3
2009
15 years 2 days ago
2009
Abstract. This paper describes a hybrid grouping genetic algorithm for a multiprocessor scheduling problem, where a list of tasks has to be scheduled on identical parallel processo...
124
Voted
IJFCS
2006
15 years 2 months ago
2006
In this paper we present an efficient algorithm for compile-time scheduling and clustering of parallel programs onto parallel processing systems with distributed memory, which is ...