Results 1 - 10
of
227
Dual Voltage Design for Minimum Energy Using
"... Abstract—This paper presents a new slack-time based algorithm for dual Vdd design to achieve maximum energy saving. Although a global optimum is sought computation time is kept low. The slack of a gate is defined as the difference between the critical path delay for the circuit and the delay of the ..."
Abstract
- Add to MetaCart
Abstract—This paper presents a new slack-time based algorithm for dual Vdd design to achieve maximum energy saving. Although a global optimum is sought computation time is kept low. The slack of a gate is defined as the difference between the critical path delay for the circuit and the delay
Scheduling Slack Time in Fixed Priority Pre-emptive Systems
- PROCEEDINGS OF THE 14TH IEEE INTERNATIONAL REAL-TIME SYSTEMS SYMPOSIUM (RTSS '93)
, 1993
"... This paper addresses the problem of jointly scheduling tasks with both hard and soft time constraints. We present a new analysis which builds upon previous research into slack stealing algorithms. Our analysis determines the maximum processing time which may be stolen from hard deadline periodic or ..."
Abstract
-
Cited by 84 (13 self)
- Add to MetaCart
This paper addresses the problem of jointly scheduling tasks with both hard and soft time constraints. We present a new analysis which builds upon previous research into slack stealing algorithms. Our analysis determines the maximum processing time which may be stolen from hard deadline periodic
Scheduling with dynamic voltage/speed adjustment using slack reclamation in multi-processor real-time systems
- IEEE TRANS. ON PARALLEL AND DISTRIBUTED SYSTEMS
, 2003
"... The high power consumption of modern processors becomes a major concern because it leads to decreased mission duration (for battery-operated systems), increased heat dissipation, and decreased reliability. While many techniques have been proposed to reduce power consumption for uniprocessor systems ..."
Abstract
-
Cited by 116 (10 self)
- Add to MetaCart
. These scheduling techniques reclaim the time unused by a task to reduce the execution speed of future tasks and, thus, reduce the total energy consumption of the system. We also study the effect of discrete voltage/speed levels on the energy savings for multiprocessor systems and propose a new scheme of slack
Cycle Time and Slack Optimization for VLSI-Chips
- In Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
, 1999
"... We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes all previously considered models. Then we show how to optimize the cycle time and optimally balance slacks on data paths ..."
Abstract
-
Cited by 34 (5 self)
- Add to MetaCart
, Tarjan and Orlin solves this problem optimally. Incidentally, this yields a new efficient method for timing analysis with transparent latches. Then we extend this algorithm to the slack balancing problem: To make the chip less sensitive to routing detours, process variations and manufacturing skew
New Slack-Monotonic Schedulability Analysis of Real-Time Tasks on Multiprocessors
"... Abstract—In this paper, multiprocessor scheduling of a set of real-time periodic tasks with implicit deadlines is addressed. We propose two static priority-assignment policies, called policy Pbound and policy Psearch. Common for both policies is that a subset of a given task set is assigned the slac ..."
Abstract
- Add to MetaCart
Abstract—In this paper, multiprocessor scheduling of a set of real-time periodic tasks with implicit deadlines is addressed. We propose two static priority-assignment policies, called policy Pbound and policy Psearch. Common for both policies is that a subset of a given task set is assigned
On real-time capacity of event-driven data-gathering sensor networks
- in Proc. of ACM MobiQuitous
, 2009
"... Abstract—Network capacity is a critical feature of wireless ad hoc and sensor networks. It is particularly challenging to determine network capacity when combined with other perfor-mance objectives such as timeliness. This paper investigates real-time capacity for event-driven data-gathering sensor ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
networks with unbalanced many-to-one traffic patterns. First, we compute the average allowable throughputs of nodes for a given event distribution, based on which we then leverage results of queuing theory to estimate the per-hop delays. We develop a new slack time distribution scheme for unbalanced many
Scheduling Slack Time in Fixed Priority Pre-emptive Systems
"... This paper addresses the problem of jointly scheduling tasks with both hard and soft time constraints. We present a new analysis which builds upon previous research into slack stealing algorithms. Our analysis determines the maximum processing time which may be stolen from hard deadline periodic or ..."
Abstract
- Add to MetaCart
This paper addresses the problem of jointly scheduling tasks with both hard and soft time constraints. We present a new analysis which builds upon previous research into slack stealing algorithms. Our analysis determines the maximum processing time which may be stolen from hard deadline periodic
Power-Aware Scheduling under Timing Constraints and Slack Analysis for Mission-Critical Embedded Systems
- In Proc. Design Automation Conference
, 2001
"... Power-aware systems are those that must make the best use of available power. They subsume traditional low-power systems in that they must not only minimize power when the budget is low, but also deliver higher performance when required. This paper presents a new scheduling technique for supporting ..."
Abstract
-
Cited by 42 (5 self)
- Add to MetaCart
Power-aware systems are those that must make the best use of available power. They subsume traditional low-power systems in that they must not only minimize power when the budget is low, but also deliver higher performance when required. This paper presents a new scheduling technique for supporting
The Slack Method: A New Method for Static Allocation of Hard Real-Time Tasks
- Real-Time Systems
, 1997
"... This article presents and evaluates the Slack Method, a new constructive heuristic for the allocation (mapping) of periodic hard real-time tasks to multiprocessor or distributed systems. The Slack Method is based on task deadlines, in contrast with other constructive heuristics, such as List Proc ..."
Abstract
-
Cited by 9 (1 self)
- Add to MetaCart
This article presents and evaluates the Slack Method, a new constructive heuristic for the allocation (mapping) of periodic hard real-time tasks to multiprocessor or distributed systems. The Slack Method is based on task deadlines, in contrast with other constructive heuristics, such as List
An Energy-Efficient Slack Distribution Technique for Multimode Distributed Real-time Embedded Systems
- IEEE Transactions on Parallel and Distributed Systems
"... Abstract—In multimode distributed systems, active task sets are assigned to their distributed components for realizing one or more functions. Many of these systems encounter runtime task variations at the input and across the system while processing their tasks in real time. Very few efforts have be ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
been made to address energy efficient scheduling in these types of distributed systems. In this paper, we propose an analytical model for energy efficient scheduling in distributed real-time embedded systems to handle time-varying task inputs. A new slack distribution scheme is introduced and adopted
Results 1 - 10
of
227