Results 1  10
of
2,016
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
Scheduling Independent Multiprocessor Tasks
, 1997
"... . We study the problem of scheduling a set of n independent multiprocessor tasks with prespecified processor allocations on a fixed number of processors. We propose a linear time algorithm that finds a schedule of minimum makespan in the preemptive model, and a linear time approximation algorithm th ..."
Abstract

Cited by 28 (3 self)
 Add to MetaCart
. We study the problem of scheduling a set of n independent multiprocessor tasks with prespecified processor allocations on a fixed number of processors. We propose a linear time algorithm that finds a schedule of minimum makespan in the preemptive model, and a linear time approximation algorithm
On Maximizing the Throughput of Multiprocessor Tasks
 THEORETICAL COMPUTER SCIENCE 302
, 2003
"... We consider the problem of scheduling n independent multiprocessor tasks with due dates and unit processing times, where the objective is to compute a schedule maximizing the throughput. We derive the complexity results and present several approximation algorithms. For the parallel variant of the ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We consider the problem of scheduling n independent multiprocessor tasks with due dates and unit processing times, where the objective is to compute a schedule maximizing the throughput. We derive the complexity results and present several approximation algorithms. For the parallel variant
General multiprocessor task scheduling.
 Naval Research Logistics
, 1999
"... Abstract: Most papers in the scheduling field assume that a job can be processed by only one machine at a time. Namely, they use a onejobononemachine model. In many industry settings, this may not be an adequate model. Motivated by human resource planning, diagnosable microprocessor systems, be ..."
Abstract

Cited by 18 (5 self)
 Add to MetaCart
and Karmarker [13]). In all the above examples, one job may need to be processed by several machines simultaneously. In literature we call this multiprocessor task scheduling (Drozdowski [15]) or a onejobonmultiplemachine problem (Lee and Cai [24]). We are interested in the problem with a one
Multiprocessor Task Scheduling
, 1999
"... Scheduling problems are concerned with how to optimally allocate the limited resources to tasks over time. Since classical models become inadequate in most of the practical areas, such as semiconductor circuit design team workforce planning where a team of people are working on semiconductor cir ..."
Abstract
 Add to MetaCart
machine at a given time, whereas the models constructed assuming this 1jobon1 machine assumption may become inadequate in practice. That is, one job can be processed simultaneously by several machines. Such problems are called 1jobonmultiple machine pattern (multiprocessor task scheduling
GENETIC ALGORITHM FOR MULTIPROCESSOR TASK SCHEDULING
"... Multiprocessor task scheduling (MPTS) is an important and computationally difficult problem. Multiprocessors have emerged as a powerful computing means for running realtime applications especially due to limitation of uniprocessor system for not having sufficient enough capability to execute all t ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Multiprocessor task scheduling (MPTS) is an important and computationally difficult problem. Multiprocessors have emerged as a powerful computing means for running realtime applications especially due to limitation of uniprocessor system for not having sufficient enough capability to execute all
Scheduling of Independent Dedicated Multiprocessor Tasks
, 2002
"... We study the o and online versions of the well known problem of scheduling a set of n independent multiprocessor tasks with prespeci ed processor allocations on a set of identical processors in order to minimize the makespan. Recently, in [12], it has been proven that in the case when all task ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
We study the o and online versions of the well known problem of scheduling a set of n independent multiprocessor tasks with prespeci ed processor allocations on a set of identical processors in order to minimize the makespan. Recently, in [12], it has been proven that in the case when all
Hybrid Algorithm for Multiprocessor Task Scheduling
"... Multiprocessors have become powerful computing means for running realtime applications and their high performance depends greatly on parallel and distributed network environment system. Consequently, several methods have been developed to optimally tackle the multiprocessor task scheduling problem ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Multiprocessors have become powerful computing means for running realtime applications and their high performance depends greatly on parallel and distributed network environment system. Consequently, several methods have been developed to optimally tackle the multiprocessor task scheduling problem
Scheduling multiprocessor tasks on dedicated processors
 Fachbereich Mathematik /Informatik, Universitat Osnabruck, Osnabruck
, 1995
"... this paper for a detailed description. 7.3.2 An algorithm based on the calculation of partially directed comparability graphs ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
this paper for a detailed description. 7.3.2 An algorithm based on the calculation of partially directed comparability graphs
Results 1  10
of
2,016