Results 1 
5 of
5
Scheduling multiprocessor tasks  An overview
 EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
, 1996
"... Multiprocessor tasks require more than one processor at the same moment of time. This relatively new concept in scheduling theory emerged with the advent of parallel computing systems. In this work we present the state of the art for multiprocessor task scheduling. We show the rationale behind the c ..."
Abstract

Cited by 49 (3 self)
 Add to MetaCart
Multiprocessor tasks require more than one processor at the same moment of time. This relatively new concept in scheduling theory emerged with the advent of parallel computing systems. In this work we present the state of the art for multiprocessor task scheduling. We show the rationale behind the concept of multiprocessor tasks. The standard threefield notation is extended to accommodate multiprocessor tasks. The main part of the work is presentation of the results in multiprocessor tasks scheduling both for parallel and for dedicated processors.
Scheduling workflow applications on processors with different capabilities
, 2006
"... Efficient scheduling of workflow applications represented by weighted directed acyclic graphs (DAG) on a set of heterogeneous processors is essential for achieving high performance. The optimization problem is NPcomplete in general. A few heuristics for scheduling on heterogeneous systems have been ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
Efficient scheduling of workflow applications represented by weighted directed acyclic graphs (DAG) on a set of heterogeneous processors is essential for achieving high performance. The optimization problem is NPcomplete in general. A few heuristics for scheduling on heterogeneous systems have been proposed recently. However, few of them consider the case where processors have different capabilities. In this paper, we present a novel list scheduling based algorithm to deal with this situation. The algorithm (SDC) has two distinctive features. First, the algorithm takes into account the effect of Percentage of Capable Processors (PCP) when assigning the task node weights. For two task nodes with same average computation cost, our weight assignment policy tends to give higher weight to the task with small PCP. Secondly, during the processor selection phase, the algorithm adjusts the effective Earliest Finish Time strategy by incorporating the average communication cost between the current scheduling node and its children. Comparison study shows that our algorithm performs better than related work overall.
Scheduling With Constrained Processor Allocation for Interval Orders
 Computers in Operations Research 20
, 1993
"... We consider a generalization of the precedence constrained scheduling problem of a set of unit execution time (UET) jobs on a set of processors or machines. Each job is associated a subset P (j) of the processors, and a job can only be executed on one of the processors in P (j). First, we show that ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We consider a generalization of the precedence constrained scheduling problem of a set of unit execution time (UET) jobs on a set of processors or machines. Each job is associated a subset P (j) of the processors, and a job can only be executed on one of the processors in P (j). First, we show that this problem is NPcomplete for interval orders. Next, the problem can be solved in polynomial time for interval orders, if the deadline is constant. Last, we give a heuristic for the scheduling problem restricted to interval orders with approximation ratio O(log(jP j)).
MinimumHotSpot Query Trees for Wireless Sensor Networks
"... Weproposeadistributedalgorithmtoconstructabalancedcommunication tree that serves in gathering data from the network nodes toasink. Ouralgorithmconstructsanearoptimallybalancedcommunication tree with minimum overhead. The balancing of the nodedegreesresultsintheminimizationofpacketcollisionsduring q ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
Weproposeadistributedalgorithmtoconstructabalancedcommunication tree that serves in gathering data from the network nodes toasink. Ouralgorithmconstructsanearoptimallybalancedcommunication tree with minimum overhead. The balancing of the nodedegreesresultsintheminimizationofpacketcollisionsduring query execution, that would otherwise require numerous retransmissions and reduce the lifetime of the network. We compare our simple distributed algorithm against previous work and a centralizedsolutionandshowthatformostnetworklayoutsitoutperforms competition and achieves tree balance very close to the centralized algorithm. Italsohasthesmallestenergyoverheadpossibletoconstructthe tree, increasing the lifetime of the network even more.