Results 1  10
of
6,370
Online Interval Scheduling
 In Proceedings of the Fifth Annual ACMSIAM Symposium on Discrete Algorithms
, 1994
"... We introduce the online interval scheduling problem, in which a set of intervals of the positive real line is presented to a scheduling algorithm in order of start time. Upon seeing each interval, the algorithm must decide whether or not to "schedule " it. Overlapping intervals may not be ..."
Abstract

Cited by 89 (1 self)
 Add to MetaCart
We introduce the online interval scheduling problem, in which a set of intervals of the positive real line is presented to a scheduling algorithm in order of start time. Upon seeing each interval, the algorithm must decide whether or not to "schedule " it. Overlapping intervals may
Online Interval Scheduling: Randomized and Multiprocessor Cases
"... Abstract. We consider the problem of scheduling a set of equallength intervals arriving online, where each interval is associated with a weight and the objective is to maximize the total weight of completed intervals. An optimal 4competitive algorithm has long been known in the deterministic case, ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. We consider the problem of scheduling a set of equallength intervals arriving online, where each interval is associated with a weight and the objective is to maximize the total weight of completed intervals. An optimal 4competitive algorithm has long been known in the deterministic case
Online interval scheduling on uniformly related machines
, 2012
"... We consider online preemptive throughput scheduling of jobs with fixed starting times on m uniformly related machines, with the goal of maximizing the profit of the completed jobs. In this problem, jobs are released over time. Every job has a size and a weight associated with it. A newly released jo ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We consider online preemptive throughput scheduling of jobs with fixed starting times on m uniformly related machines, with the goal of maximizing the profit of the completed jobs. In this problem, jobs are released over time. Every job has a size and a weight associated with it. A newly released
Software pipelining: An effective scheduling technique for VLIW machines
, 1988
"... This paper shows that software pipelining is an effective and viable scheduling technique for VLIW processors. In software pipelining, iterations of a loop in the source program are continuously initiated at constant intervals, before the preceding iterations complete. The advantage of software pipe ..."
Abstract

Cited by 581 (3 self)
 Add to MetaCart
This paper shows that software pipelining is an effective and viable scheduling technique for VLIW processors. In software pipelining, iterations of a loop in the source program are continuously initiated at constant intervals, before the preceding iterations complete. The advantage of software
A scheduling model for reduced CPU energy
 ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE
, 1995
"... The energy usage of computer systems is becoming an important consideration, especially for batteryoperated systems. Various methods for reducing energy consumption have been investigated, both at the circuit level and at the operating systems level. In this paper, we propose a simple model of job s ..."
Abstract

Cited by 558 (3 self)
 Add to MetaCart
an offline algorithm that computes, for any set of jobs, a minimumenergy schedule. We then consider some online algorithms and their competitive performance for the power function P(s) = sp where p 3 2. It is shown that one natural heuristic, called the Average Rate heuristic, uses at most a constant
Online Aggregation
, 1997
"... Aggregation in traditional database systems is performed in batch mode: a query is submitted, the system processes a large volume of data over a long period of time, and, eventually, the final answer is returned. This archaic approach is frustrating to users and has been abandoned in most other area ..."
Abstract

Cited by 381 (44 self)
 Add to MetaCart
areas of computing. In this paper we propose a new online aggregation interface that permits users to both observe the progress of their aggregation queries and control execution on the fly. After outlining usability and performance requirements for a system supporting online aggregation, we present a
The impact of imperfect scheduling on crosslayer congestion control in wireless networks
, 2005
"... In this paper, we study crosslayer design for congestion control in multihop wireless networks. In previous work, we have developed an optimal crosslayer congestion control scheme that jointly computes both the rate allocation and the stabilizing schedule that controls the resources at the under ..."
Abstract

Cited by 349 (32 self)
 Add to MetaCart
at the underlying layers. However, the scheduling component in this optimal crosslayer congestion control scheme has to solve a complex global optimization problem at each time, and is hence too computationally expensive for online implementation. In this paper, we study how the performance of cross
Proportionate progress: A notion of fairness in resource allocation
 Algorithmica
, 1996
"... Given a set of n tasks and m resources, where each task x has a rational weight x:w = x:e=x:p; 0 < x:w < 1, a periodic schedule is one that allocates a resource to a task x for exactly x:e time units in each interval [x:p k; x:p (k + 1)) for all k 2 N. We de ne a notion of proportionate progre ..."
Abstract

Cited by 322 (25 self)
 Add to MetaCart
Given a set of n tasks and m resources, where each task x has a rational weight x:w = x:e=x:p; 0 < x:w < 1, a periodic schedule is one that allocates a resource to a task x for exactly x:e time units in each interval [x:p k; x:p (k + 1)) for all k 2 N. We de ne a notion of proportionate
Online Scheduling Intervals and tIntervals
"... A tinterval is a union of at most t halfopen intervals on the real line. The special case where t = 1 is an interval. Often, the requests for contiguous allocation of a linear resource can be modeled by a sequence of tintervals. We consider the problems of online scheduling intervals and tinterv ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A tinterval is a union of at most t halfopen intervals on the real line. The special case where t = 1 is an interval. Often, the requests for contiguous allocation of a linear resource can be modeled by a sequence of tintervals. We consider the problems of online scheduling intervals and tintervals
Integrated coverage and connectivity configuration in wireless sensor networks
 In SenSys ’03: Proceedings of the 1st international
, 2003
"... An effective approach for energy conservation in wireless sensor networks is scheduling sleep intervals for extraneous nodes, while the remaining nodes stay active to provide continuous service. For the sensor network to operate successfully, the active nodes must maintain both sensing coverage and ..."
Abstract

Cited by 314 (16 self)
 Add to MetaCart
An effective approach for energy conservation in wireless sensor networks is scheduling sleep intervals for extraneous nodes, while the remaining nodes stay active to provide continuous service. For the sensor network to operate successfully, the active nodes must maintain both sensing coverage
Results 1  10
of
6,370