Results 1  10
of
2,396
Multiprocessor Scheduling
"... : In this survey, we are interested in a scheduling problem which has been studied for over 30 years. Three classes of the scheduling problem exist. In classical scheduling, each task is executed on at most one processor at a time. The multiprocessor version of the scheduling assigns a task to one ..."
Abstract
 Add to MetaCart
: In this survey, we are interested in a scheduling problem which has been studied for over 30 years. Three classes of the scheduling problem exist. In classical scheduling, each task is executed on at most one processor at a time. The multiprocessor version of the scheduling assigns a task to one
Distributed and Multiprocessor Scheduling
 ACM Computing Surveys
, 1996
"... This chapter discusses CPU scheduling in parallel and distributed systems. CPU scheduling is part of a broader class of resource allocation problems, and is probably the most carefully studied such problem. The main motivation for multiprocessor scheduling is the desire for increased speed in the ex ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
This chapter discusses CPU scheduling in parallel and distributed systems. CPU scheduling is part of a broader class of resource allocation problems, and is probably the most carefully studied such problem. The main motivation for multiprocessor scheduling is the desire for increased speed
Preemptive Multiprocessor Scheduling with Rejection
 Theoretical Computer Science
, 1999
"... The problem of online multiprocessor scheduling with rejection was introduced by Bartal, Leonardi, MarchettiSpaccamela, Sgall and Stougie [4]. They show that for this problem the competitive ratio is 1+ OE ß 2:61803, where OE is the golden ratio. A modified model of multiprocessor scheduling with r ..."
Abstract

Cited by 27 (3 self)
 Add to MetaCart
The problem of online multiprocessor scheduling with rejection was introduced by Bartal, Leonardi, MarchettiSpaccamela, Sgall and Stougie [4]. They show that for this problem the competitive ratio is 1+ OE ß 2:61803, where OE is the golden ratio. A modified model of multiprocessor scheduling
Multiprocessor Scheduling with Rejection
, 1996
"... We consider a version of multiprocessor scheduling with the special feature that jobs may be rejected at a certain penalty. An instance of the problem is given by m identical parallel machines and a set of n jobs, each job characterized by a processing time and a penalty. In the online version t ..."
Abstract

Cited by 46 (3 self)
 Add to MetaCart
We consider a version of multiprocessor scheduling with the special feature that jobs may be rejected at a certain penalty. An instance of the problem is given by m identical parallel machines and a set of n jobs, each job characterized by a processing time and a penalty. In the online version
Contributions to the multiprocessor scheduling problem
 in "The Third IASTED International Conference on Computational Intelligence (CI 2007
"... Abstract. The problem of multiprocessor scheduling consists in finding a schedule for a general task graph to be executed on a multiprocessor system so that the schedule length can be minimized. This scheduling problem is known to be NPhard, and methods based on heuristic search have been proposed ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. The problem of multiprocessor scheduling consists in finding a schedule for a general task graph to be executed on a multiprocessor system so that the schedule length can be minimized. This scheduling problem is known to be NPhard, and methods based on heuristic search have been
Online Randomized Multiprocessor Scheduling
 ALGORITHMICA
, 1998
"... The use of randomization in online multiprocessor scheduling is studied. The problem of scheduling independent jobs on m machines online originates with Graham [17]. While the deterministic case of this problem has been studied extensively, little work has been done on the randomized case. For m = 2 ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
The use of randomization in online multiprocessor scheduling is studied. The problem of scheduling independent jobs on m machines online originates with Graham [17]. While the deterministic case of this problem has been studied extensively, little work has been done on the randomized case. For m
Implementing Multiprocessor Scheduling Disciplines
 In Proceedings of IPPS/SPDP ’97 Workshop. Lecture Notes in Computer Science
"... An important issue in multiprogrammed multiprocessor systems is the scheduling of parallel jobs. Consequently, there has been a considerable amount of analytic research in this area recently. A frequent criticism, however, is that proposed disciplines that are studied analytically are rarely ever ..."
Abstract
 Add to MetaCart
An important issue in multiprogrammed multiprocessor systems is the scheduling of parallel jobs. Consequently, there has been a considerable amount of analytic research in this area recently. A frequent criticism, however, is that proposed disciplines that are studied analytically are rarely ever
Multiprocessor Scheduling with Few Preemptions
 IPP Hurray Research Group, Polytechnic Institute of Porto, Portugal HURRAYTR060811, Available at http://www.hurray.isep.ipp.pt/privfiles/trhurray060811.pdf
, 2006
"... Consider the problem of scheduling a set of periodically arriving tasks on a multiprocessor with the goal of meeting deadlines. Processors are identical and have the same speed. Tasks can be preempted and they can migrate between processors. We propose an algorithm with a utilization bound of 66 % a ..."
Abstract

Cited by 60 (6 self)
 Add to MetaCart
Consider the problem of scheduling a set of periodically arriving tasks on a multiprocessor with the goal of meeting deadlines. Processors are identical and have the same speed. Tasks can be preempted and they can migrate between processors. We propose an algorithm with a utilization bound of 66
Multiprocessor Scheduling (Advanced)
"... This chapter will introduce the basics of multiprocessor scheduling. As this topic is relatively advanced, it may be best to cover it after you have studied the topic of concurrency in some detail (i.e., the second major “easy piece ” of the book). After years of existence only in the highend of th ..."
Abstract
 Add to MetaCart
This chapter will introduce the basics of multiprocessor scheduling. As this topic is relatively advanced, it may be best to cover it after you have studied the topic of concurrency in some detail (i.e., the second major “easy piece ” of the book). After years of existence only in the high
MULTIPROCESSOR SCHEDULING is PLScomplete
"... We consider two natural models of local improvement. We show that the MULTIPROCESSOR SCHEDULING problem, i.e., the problem of scheduling weighted jobs on identical machines with the objective to minimize the makespan, is PLScomplete for a sufficiently large neighborhood. In the first model, in an i ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We consider two natural models of local improvement. We show that the MULTIPROCESSOR SCHEDULING problem, i.e., the problem of scheduling weighted jobs on identical machines with the objective to minimize the makespan, is PLScomplete for a sufficiently large neighborhood. In the first model
Results 1  10
of
2,396