Results 1 - 10
of
950
Real-Time Dynamic Voltage Scaling for Low-Power Embedded Operating Systems
, 2001
"... In recent years, there has been a rapid and wide spread of nontraditional computing platforms, especially mobile and portable computing devices. As applications become increasingly sophisticated and processing power increases, the most serious limitation on these devices is the available battery lif ..."
Abstract
-
Cited by 501 (4 self)
- Add to MetaCart
the necessary peak computation power in general-purpose systems. However, for a large class of applications in embedded real-time systems like cellular phones and camcorders, the variable operating frequency interferes with their deadline guarantee mechanisms, and DVS in this context, despite its growing
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
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
Deadlines
"... Abstract-The problem of scheduling multiple streams of real-time customers. is addressed in this paper. The paper first intro-duces the notion of (m, k)-firm deadlines to better characterize the timing constraints of real-time streams. More specifically, a stream is said to have (m, k)-firm deadline ..."
Abstract
- Add to MetaCart
reductions in the probability of dynamic failure are achieved when the proposed policy is used. Index Terms-Real-time systems, deadline-constrained schedul-ing, dynamic failure, priority queues, soft deadlines.
Algorithms for scheduling imprecise computations
- IEEE Computer
, 1991
"... n a hard real-time cyctem, every time-T critical task must meet its timing con-1 straint, typically specified as its deadline. (A task is a granule of computa-tion treated by the scheduler as a unit of work to be allocated processor time, or scheduled.) If any time-critical task fails to complete an ..."
Abstract
-
Cited by 256 (17 self)
- Add to MetaCart
n a hard real-time cyctem, every time-T critical task must meet its timing con-1 straint, typically specified as its deadline. (A task is a granule of computa-tion treated by the scheduler as a unit of work to be allocated processor time, or scheduled.) If any time-critical task fails to complete
High Performance Parametric Modeling with Nimrod/G: Killer Application for the Global Grid?
, 2000
"... This paper examines the role of parametric modeling as an application for the global computing grid, and explores some heuristics which make it possible to specify soft real time deadlines for larger computational experiments. We demonstrate the scheme with a case study utilizing the Globus toolkit ..."
Abstract
-
Cited by 283 (54 self)
- Add to MetaCart
This paper examines the role of parametric modeling as an application for the global computing grid, and explores some heuristics which make it possible to specify soft real time deadlines for larger computational experiments. We demonstrate the scheme with a case study utilizing the Globus toolkit
Distributed scheduling of tasks with deadlines and resource requirements
- IEEE Trans. Comput
, 1989
"... Abstract-In the design of distributed computer systems, the scheduling problem is considered to be an important one and has been addressed by many researchers. However, most approaches have not dealt with tasks ’ timing and resource requirements. In this paper, we describe a set of heuristic algorit ..."
Abstract
-
Cited by 144 (12 self)
- Add to MetaCart
Abstract-In the design of distributed computer systems, the scheduling problem is considered to be an important one and has been addressed by many researchers. However, most approaches have not dealt with tasks ’ timing and resource requirements. In this paper, we describe a set of heuristic
Remote Agent: To Boldly Go Where No AI System Has Gone Before
, 1998
"... Renewed motives for space exploration have inspired NASA to work toward the goal of establishing a virtual presence in space, through heterogeneous effets of robotic explorers. Information technology, and Artificial Intelligence in particular, will play a central role in this endeavor by endowing th ..."
Abstract
-
Cited by 231 (16 self)
- Add to MetaCart
these explorers with a form of computational intelligence that we call remote agents. In this paper we describe the Remote Agent, a specific autonomous agent architecture based on the principles of model-based programming, on-board deduction and search, and goal-directed closed-loop commanding, that takes a
Analysis of Deadline Scheduled Real-Time Systems
, 1996
"... A uniform, flexible approach is proposed for analysing the feasibility of deadline scheduled real-time systems. In its most general formulation, the analysis assumes sporadically periodic tasks with arbitrary deadlines, release jitter, and shared resources. System overheads of a tick driven schedule ..."
Abstract
-
Cited by 96 (0 self)
- Add to MetaCart
A uniform, flexible approach is proposed for analysing the feasibility of deadline scheduled real-time systems. In its most general formulation, the analysis assumes sporadically periodic tasks with arbitrary deadlines, release jitter, and shared resources. System overheads of a tick driven
Dynamic and Aggressive Scheduling Techniques for Power-Aware Real-Time Systems
, 2001
"... In this paper, we address power-aware scheduling of periodic hard real-time tasks using dynamic voltage scaling. Our solution includes three parts: (a) a static (off-line) solution to compute the optimal speed, assuming worst-case workload for each arrival, (b) an on-line speed reduction mechanism t ..."
Abstract
-
Cited by 204 (24 self)
- Add to MetaCart
In this paper, we address power-aware scheduling of periodic hard real-time tasks using dynamic voltage scaling. Our solution includes three parts: (a) a static (off-line) solution to compute the optimal speed, assuming worst-case workload for each arrival, (b) an on-line speed reduction mechanism
CPU Reservations and Time Constraints: Efficient, Predictable Scheduling of Independent Activities
, 1997
"... Workstations and personal computers are increasingly being used for applications with real-time characteristics such as speech understanding and synthesis, media computations and I/O, and animation, often concurrently executed with traditional non-real-time workloads. This paper presents a system th ..."
Abstract
-
Cited by 216 (8 self)
- Add to MetaCart
Workstations and personal computers are increasingly being used for applications with real-time characteristics such as speech understanding and synthesis, media computations and I/O, and animation, often concurrently executed with traditional non-real-time workloads. This paper presents a system
Results 1 - 10
of
950