Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
68
A.: The bell is ringing in speed-scaled multiprocessor scheduling
- In: Proceedings of ACM Symposium on Parallelism in Algorithms and Architectures (SPAA
, 2009
"... This paper investigates the problem of scheduling jobs on multiple speedscaled processors without migration, i.e., we have constant α> 1 such that running a processor at speed s results in energy consumption s α per time unit. We consider the general case where each job has a monotonously increas ..."
Abstract
-
Cited by 20 (0 self)
- Add to MetaCart
This paper investigates the problem of scheduling jobs on multiple speedscaled processors without migration, i.e., we have constant α> 1 such that running a processor at speed s results in energy consumption s α per time unit. We consider the general case where each job has a monotonously
Energy-efficient algorithms for non-preemptive speed-scaling
"... Abstract. We improve complexity bounds for energy-efficient speed scheduling problems for both the single processor and multi-processor cases. Energy conservation has become a major concern, so revisiting traditional scheduling problems to take into account the energy consumption has been part of th ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Abstract. We improve complexity bounds for energy-efficient speed scheduling problems for both the single processor and multi-processor cases. Energy conservation has become a major concern, so revisiting traditional scheduling problems to take into account the energy consumption has been part
Energy Efficient Multiprocessor Scheduling via Configuration LP
"... Energy minimization is an important issue in our days [8]. One of the main mechanisms for reducing the energy consumption in modern computer systems is the use of speed scalable processors. Starting from the seminal paper of Yao et al. [16], many papers adopted the speed-scaling model in which if a ..."
Abstract
- Add to MetaCart
Energy minimization is an important issue in our days [8]. One of the main mechanisms for reducing the energy consumption in modern computer systems is the use of speed scalable processors. Starting from the seminal paper of Yao et al. [16], many papers adopted the speed-scaling model in which if a
Heat-and-run: leveraging SMT and CMP to manage power density through the operating system
- In Proceedings of the 11th International Conference on Architectural Support for Programming Languages and Operating Systems
, 2004
"... Power density in high-performance processors continues to increase with technology generations as scaling of current, clock speed, and device density outpaces the downscaling of supply voltage and thermal ability of packages to dissipate heat. Power density is characterized by localized chip hot spo ..."
Abstract
-
Cited by 154 (0 self)
- Add to MetaCart
Power density in high-performance processors continues to increase with technology generations as scaling of current, clock speed, and device density outpaces the downscaling of supply voltage and thermal ability of packages to dissipate heat. Power density is characterized by localized chip hot
Speed scaling on parallel processors
- In Proc. 19th Annual Symp. on Parallelism in Algorithms and Architectures (SPAA’07
, 2007
"... In this paper we investigate algorithmic instruments leading to low power consumption in computing devices. While previous work on energy-efficient algorithms has mostly focused on single processor environments, in this paper we investigate multi-processor settings. We study the basic problem of sch ..."
Abstract
-
Cited by 40 (3 self)
- Add to MetaCart
of scheduling a set of jobs, each specified by a release time, a deadline and a processing volume, on variable speed processors so as to minimize the total energy consumption. We first settle the complexity of speed scaling with unit size jobs. More specifically, we devise a polynomial time algorithm
Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor
"... We consider the setting of a multiprocessor where the speeds of the m processors can be individually scaled. Jobs arrive over time and have varying degrees of parallelizability. A nonclairvoyant scheduler must assign the processes to processors, and scale the speeds of the processors. We consider th ..."
Abstract
-
Cited by 24 (8 self)
- Add to MetaCart
We consider the setting of a multiprocessor where the speeds of the m processors can be individually scaled. Jobs arrive over time and have varying degrees of parallelizability. A nonclairvoyant scheduler must assign the processes to processors, and scale the speeds of the processors. We consider
Energy-aware scheduling for streaming applications on chip multiprocessors
- In the 28th IEEE Real-Time System Symposium (RTSS’07
, 2007
"... Streaming applications have become increasingly important and widespread, and they will be running on soon-to-be-prevalent chip multiprocessors (CMPs). We address the problem of energy-aware scheduling of streaming applications, which are represented by task graphs, on CMPs using on/off and dynamic ..."
Abstract
-
Cited by 18 (1 self)
- Add to MetaCart
Streaming applications have become increasingly important and widespread, and they will be running on soon-to-be-prevalent chip multiprocessors (CMPs). We address the problem of energy-aware scheduling of streaming applications, which are represented by task graphs, on CMPs using on/off and dynamic
Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor
"... “With multi-core it’s like we are throwing this Hail Mary pass down the field and now we have to run down there as fast as we can to see if we can catch it.” — David Patterson, UC Berkeley computer science professor We consider the setting of a multiprocessor where the speeds of the m processors can ..."
Abstract
- Add to MetaCart
can be individually scaled. Jobs arrive over time and have varying degrees of parallelizability. A nonclairvoyant scheduler must assign the jobs to processors, and scale the speeds of the processors. We consider the objective of energy plus flow time. For jobs that my have side effects
Scheduling Parallel Networking On Shared-Memory Multiprocessors
"... Introduction In this proposal, we explore scheduling issues in parallelized network protocol processing on shared-memory multiprocessors. The use of parallelism in network processing has recently become an area of active research [6, 20, 31, 34, 39, 42, 49, 64, 65, 66, 80] and significant applied/c ..."
Abstract
- Add to MetaCart
Introduction In this proposal, we explore scheduling issues in parallelized network protocol processing on shared-memory multiprocessors. The use of parallelism in network processing has recently become an area of active research [6, 20, 31, 34, 39, 42, 49, 64, 65, 66, 80] and significant applied
Energy-Efficient Multiprocessor Scheduling for Flow Time and Makespan
- CoRR
"... Abstract: We consider energy-efficient scheduling on multiprocessors, where the speed of each processor can be individually scaled, and a processor consumes power sα when running at speed s, for α> 1. A scheduling algorithm needs to decide at any time both processor allocations and processor spee ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
Abstract: We consider energy-efficient scheduling on multiprocessors, where the speed of each processor can be individually scaled, and a processor consumes power sα when running at speed s, for α> 1. A scheduling algorithm needs to decide at any time both processor allocations and processor
Results 1 - 10
of
68
