Results 1  10
of
57
Approximate Signal Processing
, 1997
"... It is increasingly important to structure signal processing algorithms and systems to allow for trading off between the accuracy of results and the utilization of resources in their implementation. In any particular context, there are typically a variety of heuristic approaches to managing these tra ..."
Abstract

Cited by 516 (2 self)
 Add to MetaCart
It is increasingly important to structure signal processing algorithms and systems to allow for trading off between the accuracy of results and the utilization of resources in their implementation. In any particular context, there are typically a variety of heuristic approaches to managing these tradeoffs. One of the objectives of this paper is to suggest that there is the potential for developing a more formal approach, including utilizing current research in Computer Science on Approximate Processing and one of its central concepts, Incremental Refinement. Toward this end, we first summarize a number of ideas and approaches to approximate processing as currently being formulated in the computer science community. We then present four examples of signal processing algorithms/systems that are structured with these goals in mind. These examples may be viewed as partial inroads toward the ultimate objective of developing, within the context of signal processing design and implementation,...
Scheduling Algorithms
, 1997
"... Introduction Scheduling theory is concerned with the optimal allocation of scarce resources to activities over time. The practice of this field dates to the first time two humans contended for a shared resource and developed a plan to share it without bloodshed. The theory of the design of algorith ..."
Abstract

Cited by 80 (2 self)
 Add to MetaCart
(Show Context)
Introduction Scheduling theory is concerned with the optimal allocation of scarce resources to activities over time. The practice of this field dates to the first time two humans contended for a shared resource and developed a plan to share it without bloodshed. The theory of the design of algorithms for scheduling is younger, but still has a significant historythe earliest papers in the field were published more than forty years ago. Scheduling problems arise in a variety of settings, as is illustrated by the following examples: Example 1: Consider the central processing unit of a computer that must process a sequence of jobs that arrive over time. In what order should the jobs be processed in order to minimize, on average, the time that a job is in the system from arrival to completion? Example 2: Consider a team of five astronauts preparing for the reentry of their space shuttle into the at
Integrating scheduling with batching and lotsizing: a review of algorithms and complexity
 Journal of the Operational Research Society
, 1992
"... In many practical situations, batching of similar jobs to avoid setups is performed whilst constructing a schedule. On the other hand, each job may consist of many identical items. Splitting a job often results in improved customer service or in reduced throughput time. Thus, implicit in determinin ..."
Abstract

Cited by 58 (1 self)
 Add to MetaCart
In many practical situations, batching of similar jobs to avoid setups is performed whilst constructing a schedule. On the other hand, each job may consist of many identical items. Splitting a job often results in improved customer service or in reduced throughput time. Thus, implicit in determining a schedule is a lotsizing decision which specifies how a job is to be split. This paper proposes a general model which combines batching and lotsizing decisions with scheduling. A review of research on this type of model is given. Some important open problems for which further research is required are also highlighted.
Solving Parallel Machine Scheduling Problems by Column Generation
 INFORMS JOURNAL ON COMPUTING
, 1995
"... We consider a class of problems of scheduling n jobs on m identical, uniform, or unrelated parallel machines with an objective of minimizing an additive criterion. We propose a decomposition approach for solving these problems exactly. The decomposition approach first formulates these problems as an ..."
Abstract

Cited by 39 (8 self)
 Add to MetaCart
We consider a class of problems of scheduling n jobs on m identical, uniform, or unrelated parallel machines with an objective of minimizing an additive criterion. We propose a decomposition approach for solving these problems exactly. The decomposition approach first formulates these problems as an integer program, and then reformulates the integer program, using DantzigWolfe decomposition, as a set partitioning problem. Based on this set partitioning formulation# branch and bound exact solution algorithms can be designed for these problems. In such a branch and bound tree# each node is the linear relaxation problem of a set partitioning problem. This linear relaxation problem is solved by a column generation approach where each column represents a schedule on one machine and is generated by solving a single machine subproblem. Branching is conducted on variables in the original integer programming formulation instead of variables in the set partitioning formulation such that sing...
Reduced energy decoding of MPEG streams
, 2002
"... Long battery life and high performance multimedia decoding are competing design goals for portable appliances. For a target level of QoS, the achievable battery life can be increased by dynamically adjusting the supply voltage throughout execution. In this paper, an efficient offline scheduling algo ..."
Abstract

Cited by 30 (0 self)
 Add to MetaCart
(Show Context)
Long battery life and high performance multimedia decoding are competing design goals for portable appliances. For a target level of QoS, the achievable battery life can be increased by dynamically adjusting the supply voltage throughout execution. In this paper, an efficient offline scheduling algorithm is proposed for preprocessing stored MPEG audio and video streams. It computes the order and voltage settings at which the appliance's CPU decodes the frames, reducing energy consumption without violating timing or buffering constraints. Our experimental results elucidate the tradeoff of QoS and energy consumption. They demonstrate that the scheduler reduces CPU energy consumption by 19%, without any sacrifice of quality, and by nearly 50%, with only slightly reduced quality. The results also explore how the QoS/energy tradeoff is affected by buffering and processor speed.
Utility Accrual RealTime Scheduling: Models and Algorithms
 PH.D. DISSERTATION, VIRGINIA TECH
, 2004
"... ..."
Techniques for Scheduling with Rejection
 in Algorithms—ESA ’98, Lecture Notes in Comput. Sci. 1461
, 1998
"... We consider the general problem of scheduling a set of jobs where we may choose not to schedule certain jobs, and thereby incur a penalty for each rejected job. More specifically, we focus on choosing a set of jobs to reject and constructing a schedule for the remaining jobs so as to optimize the su ..."
Abstract

Cited by 28 (2 self)
 Add to MetaCart
(Show Context)
We consider the general problem of scheduling a set of jobs where we may choose not to schedule certain jobs, and thereby incur a penalty for each rejected job. More specifically, we focus on choosing a set of jobs to reject and constructing a schedule for the remaining jobs so as to optimize the sum of the weighted completion times of the jobs scheduled plus the sum of the penalties of the jobs rejected.
A survey of results for sequencing problems with controllable processing times
 Discrete Appl. Math
, 1990
"... The paper deals with the sequencing problems in which job processing times, along with a processing order, are decision variables having their own associated linearly varying costs. The existing results in this area are surveyed and some new results are provided. In the paper, an attention is focuss ..."
Abstract

Cited by 22 (1 self)
 Add to MetaCart
The paper deals with the sequencing problems in which job processing times, along with a processing order, are decision variables having their own associated linearly varying costs. The existing results in this area are surveyed and some new results are provided. In the paper, an attention is focussed on the computational complexity aspects, polynomial algorithms and the worstcase analysis of approximation algorithms. 1.
Efficient Methods of Validating Timing Constraints
, 1995
"... Introduction In a realtime system, many jobs are timecritical. Here, by job, we mean a unit of work to be scheduled and executed. A job may be the computation of a control law, the transmission of an operator command, the retrieval of a file, and so on. To execute, it requires a computer, a data ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
(Show Context)
Introduction In a realtime system, many jobs are timecritical. Here, by job, we mean a unit of work to be scheduled and executed. A job may be the computation of a control law, the transmission of an operator command, the retrieval of a file, and so on. To execute, it requires a computer, a data link, a console, and a disk; we refer to them all as processors. The processors are identical if they can be used interchangeably. Otherwise they are functionally dedicated, as exemplified by the processors listed above. The length of time a job requires to complete if it were to execute alone is called its execution time. The execution of a timecritical job cannot begin until its release time and must complete by its deadline. To validate a realtime system, its builder must demonstrate convincingly that all timecritical jobs will always complete by their deadlines, after making sure that the scheduler