Results 1  10
of
396
Minimizing Total Busy Time in Parallel Scheduling with Application to Optical Networks
"... We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1,...,Jn}. Each job, Jj, is associated with an interval [sj,cj] along which it should be processed. Also given is the parallelism parameter g ≥ 1 ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
such that the total busy time of the machines is minimized. The problem is known to be NPhard already for g = 2. We present a 4approximation algorithm for general instances, and approximation algorithms with improved ratios for instances with bounded lengths, for instances where any two intervals intersect
Optimizing Busy Time on Parallel Machines
"... We consider the following fundamental scheduling problem in which the input consists of n jobs to be scheduled on a set of identical machines of bounded capacity g (which is the maximal number of jobs that can be processed simultaneously by a single machine). Each job is associated with a start tim ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
. In the scheduling minimization version the goal is to minimize the total busy time of machines used to schedule all jobs. In the resource allocation maximization version the goal is to maximize the number of jobs that are scheduled for processing under a budget constraint given in terms of busy time
Minimizing Busy Time in Multiple Machine Realtime Scheduling
"... We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a release time, a due date, a processing time and demand for machine capacity. The goal is to schedule all of the jobs nonpr ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
preemptively in their releasetimedeadline windows, subject to machine capacity constraints, such that the total busy time of the machines is minimized. Our problem has important applications in poweraware scheduling, optical network design and customer service systems. Scheduling to minimize busy times is APXhard already
Online Optimization of Busy Time on Parallel Machines (Extended Abstract)
"... We consider the following online scheduling problem in which the input consists of n jobs to be scheduled on identical machines of bounded capacity g (the maximum number of jobs that can be processed simultaneously on a single machine). Each job is associated with a release time and a completion tim ..."
Abstract
 Add to MetaCart
time between which it is supposed to be processed. When a job is released, the online algorithm has to make decision without changing it afterwards. We consider two versions of the problem. In the minimization version, the goal is to minimize the total busy time of machines used to schedule all jobs
Realtime Scheduling to Minimize Machine Busy Times
"... We consider poweraware scheduling problems where the power consumption of a machine is assumed to be proportional to the time it is in on state, also called its busytime. In our model, the jobs have release times, deadlines and processing times. Assuming that each machine can process multiple jo ..."
Abstract
 Add to MetaCart
jobs simultaneously, the goal is to schedule all jobs nonpreemptively in their releasetimedeadline windows, so that the total demand of jobs scheduled on a single machine at any given time is at most its capacity. We present a constant factor approximation for minimizing the total busytime of a
Static Communication Scheduling for Minimizing Collisions in Application Specific Parallel Systems
 in International Conference on ApplicationSpecific Systems, Architectures, and Processors
, 1996
"... In applications requiring very high throughput or which have realtime deadlines, the use of parallel processing techniques has become widespread. Although there exists potential for vast performance gains, the communication overhead inherent in such systems can significantly lessen these gains. In ..."
Abstract
 Add to MetaCart
. In this paper, with tightlycoupled architectures as the platform, the static communication scheduling of messages in the network is addressed. The compile time determination of when nodes should send their messages to other nodes is what is termed static communication scheduling. In parallel systems the static
Bicriteria scheduling for parallel jobs
 IN MULTIDISCIPLINARY INT’L CONF. SCHEDULING: THEORY & APPS. (MISTA
, 2003
"... We study offline and online algorithms for parallel settings which simultaneously yield constant approximation factors for both minimizing total weighted completion time and makespan objectives. Introducing preemptions, the list scheduling algorithm introduced by Garey and Graham is extended in a ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We study offline and online algorithms for parallel settings which simultaneously yield constant approximation factors for both minimizing total weighted completion time and makespan objectives. Introducing preemptions, the list scheduling algorithm introduced by Garey and Graham is extended in a
Bicriteria Scheduling for Parallel Jobs
, 1999
"... We study offline and online algorithms for parallel settings which simultaneously yield constant approximation factors for both minimizing total weighted completion time and makespan objectives. Introducing preemptions, one of our contribution is extending the classical parallel list scheduling al ..."
Abstract
 Add to MetaCart
We study offline and online algorithms for parallel settings which simultaneously yield constant approximation factors for both minimizing total weighted completion time and makespan objectives. Introducing preemptions, one of our contribution is extending the classical parallel list scheduling
Minimizing Buffer Requirements under RateOptimal Schedule in Regular Dataflow Networks
 Journal of VLSI Signal Processing
, 1994
"... Largegrain synchronous dataflow graphs or multirate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multirate largegrain dataflow graphs have been widely regarded as a powerful programming model for DSP applications. In this paper we propose a ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
method to minimize buffer storage requirement in constructing rateoptimal compiletime (MBRO) schedules for multirate dataflow graphs. We demonstrate that the constraints to minimize buffer storage while executing at the optimal computation rate (i.e. the maximum possible computation rate without
A Survey of EnergyEfficient Scheduling Mechanisms in Sensor Networks
 ACM/Springer Mobile Networks and Applications (MONET
, 2006
"... Abstract Sensor networks have a wide range of potential, practical and useful applications. However, there are issues that need to be addressed for efficient operation of sensor network systems in real applications. Energy saving is one critical issue for sensor networks since most sensors are equ ..."
Abstract

Cited by 66 (7 self)
 Add to MetaCart
are equipped with nonrechargeable batteries that have limited lifetime. To extend the lifetime of a sensor network, one common approach is to dynamically schedule sensors ’ work/ sleep cycles (or duty cycles). Moreover, in clusterbased networks, cluster heads are usually selected in a way that minimizes
Results 1  10
of
396