A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Speed Scaling in the Non-clairvoyant Model
2015
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures - SPAA '15
Preserved Fulltext
Unlike in the clairvoyant model, the speed scaling problem in the non-clairvoyant model is non-trivial even for a single job. ...
In recent years, there has been a growing interest in speed scaling algorithms, where a set of jobs need to be scheduled on a machine with variable speed so as to optimize the flow-times of the jobs and ...
Here the speed of the algorithm changes all the way from time r2 to the end. The extra time taken dT is however the same as in the non-clairvoyant case. ...
doi:10.1145/2755573.2755582
dblp:conf/spaa/AzarD0P15
fatcat:mm72bqygrjc5fdyrtjuthimsye
Sleep with Guilt and Work Faster to Minimize Flow Plus Energy
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Non-clairvoyant scheduling in the bounded speed model is left as an open problem. ...
If the processor has a maximum speed, the problem becomes more difficult as the processor, once overslept, cannot rely on unlimited extra speed to catch up the delay. ...
When there is no sleep state and the power function is in the form of s α , [15] and [9] gave respectively a clairvoyant speed scaling algorithm AJC and a non-clairvoyant speed scaling algorithm LAPS ...
doi:10.1007/978-3-642-02927-1_55
fatcat:nzrk3chxzjhormmysjfxayzpfi
Non-clairvoyant Speed Scaling for Weighted Flow Time
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
This is known as the clairvoyant setting. ...
We show an online algorithm WLAPS that is 8α 2 -competitive for weighted flow time plus energy under the traditional power model, which assumes the power P (s) to run the processor at speed s to be s α ...
In the clairvoyant model, p(j) is known at time r(j). In the non-clairvoyant model, p(j) is only known when the job is completed. ...
doi:10.1007/978-3-642-15775-2_3
fatcat:mhjxgrwgtzf5djgfrag26ruw6u
Energy-efficient multiprocessor scheduling for flow time and makespan
2014
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2010 pre-print arXiv:1010.4110v1 fatcat:mzurvh6nr5d65mii2x3654gapuOther Versions
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. ...
, such as remaining parallelism and work. ...
For each processor at a particular time, its power is given by s α if it runs at speed s, where α > 1 is the power parameter. ...
doi:10.1016/j.tcs.2014.07.007
fatcat:d4fhsva7h5asnf75b45qhpu43m
Executed-time Round Robin: EtRR an online non-clairvoyant scheduling on speed bounded processor with energy management
2017
Journal of King Saud University: Computer and Information Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
EtRR is O(1)-competitive, it is using a processor with the maximum speed (1 + s/3)T, where the maximum speed of optimal offline adversary is T and 0 < s 6 ð3aÞ À1 . ...
We adopt the conventional power function P = s a , where s and a > 1 are speed of a processor and a constant, respectively. ...
is (2/t); they concluded that adequately high speed is more powerful than clairvoyance. ...
doi:10.1016/j.jksuci.2016.03.002
fatcat:y223mbih6vccvkakfnrf2n6oze
Release Round Robin: R3 an energy-aware non-clairvoyant scheduling on speed bounded processors
2015
Karbala International Journal of Modern Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We adopt the traditional model of power function P ¼ s a , where s, P and a > 1 are speed of processor, power and a constant, respectively. ...
In the past few years the online scheduling problem has been studied extensively under clairvoyant settings and a relatively less amount of evolution is observed under non-clairvoyant setting. ...
What matters most to the computer designers at Google is not speed, but power, low power, because data centers can consume as much energy as a city [2] . ...
doi:10.1016/j.kijoms.2015.11.008
fatcat:mcillmvbgnhjvjccoxclknchem
Scheduling Heterogeneous Processors Isn't As Easy As You Think
[chapter]
2012
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We then show that a variation of the non-clairvoyant algorithm Late Arrival Processor Sharing coupled with a non-obvious speed scaling algorithm is scalable for the objective of unweighted flow plus energy ...
This is the first provably scalable non-clairvoyant algorithm on heterogeneous multiprocessors, even in the related machines setting, for the objective of total (unweighted) flow time. ...
In theory m processors with speed s/m could potentially handle the same load as one speed-s processor, but with a factor of 1/m 2 less power. ...
doi:10.1137/1.9781611973099.98
dblp:conf/soda/GuptaIKMP12
fatcat:lsyawgruxrcnzgeoync2tl4lma
Energy-Aware Online Non-Clairvoyant Scheduling Using Speed Scaling with Arbitrary Power Function
2019
Applied Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
HSIF is 2-competitive under the arbitrary power function and dynamic speed scaling. The competitive ratio obtained by HSIF is the least to date among non-clairvoyant scheduling. ...
The objective considered is to minimize the scaled importance based flow time plus energy. The processor's speed is proportional to the total scaled importance of all active jobs. ...
As the algorithm HSIF is non-clairvoyant, the executed time assumed is its current size. ...
doi:10.3390/app9071467
fatcat:jmajpzbea5hspij4m73cppn3ja
SELFISHMIGRATE: A Scalable Algorithm for Non-clairvoyantly Scheduling Heterogeneous Processors
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We present the first online algorithm that is scalable ((1+)-speed O(1/ϵ^2)-competitive for any constant > 0) for the total weighted flow-time objective. ...
We consider the classical problem of minimizing the total weighted flow-time for unrelated machines in the online non-clairvoyant setting. ...
For the version with power functions, the best corresponding clairvoyant result is a (1+ǫ)-speed O(1/ǫ)-competitive algorithm [15] . ...
arXiv:1404.1943v1
fatcat:ry5dsewiejfkxlinfwujoxdi2u
Page 9252 of Mathematical Reviews Vol. , Issue 2002M
[page]
2002
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
is as powerful as clairvoyance. ...
To be competitive against an optimal clairvoyant scheduler (termed in this paper OPT) that has p processors the non- clairvoyant schedulers EQUI and BAL must be given some ad- vantage, such as more power ...
Speed scaling for stretch plus energy
2012
Operations Research Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A natural conjecture is that there is an O(1)-competitive algorithm for S on a fixed speed processor if and only if there is an O(1)-competitive algorithm for S + E on a processor with an arbitrary power ...
We consider speed scaling problems where the objective is to minimize a linear combination of arbitrary scheduling objective S, and energy E . ...
One natural question for either clairvoyant or non-clairvoyant schedulers is as follows. ...
doi:10.1016/j.orl.2012.02.003
fatcat:5vqpbppaqvd7pj6jczkaaa6evu
Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We consider the online scheduling problem to minimize total weighted flow-time plus energy where the energy power f (s) is a function of speed s and is given by s α for α ≥ 1. ...
This approach is simple yet powerful and it is seemingly a right tool to study problems with resource augmentation or speed scaling. We illustrate the approach through the following results. 1. ...
We consider the online scheduling problem to minimize total weighted flow-time plus energy where the energy power f (s) is a function of speed s and is given by s α for α ≥ 1. ...
doi:10.1007/978-3-642-40450-4_64
fatcat:jzcu2qrxwnhxvhas7aczdhncni
Clairvoyant
2007
Proceedings of the 5th international conference on Embedded networked sensor systems - SenSys '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
This paper describes Clairvoyant which is a comprehensive source-level debugger for wireless, embedded networks. ...
With Clairvoyant, a developer can wirelessly connect to a sensor network and execute standard debugging commands including break, step, watch, and backtrace, as well as new commands that are specially ...
As explained in Section 4, Clairvoyant runs the target program at native speed directly on the MCU, so execution speed is not affected by Clairvoyant unless a debugging command is executed. ...
doi:10.1145/1322263.1322282
dblp:conf/sensys/YangSSW07
fatcat:quxmeeup6nci3gkw2qwuv6f63a
Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We consider scheduling jobs online to minimize the objective Introduction Scheduling a set of jobs that arrive over time on a single machine is perhaps the most basic setting considered in scheduling theory ...
We know that a single m-speed machine is always as powerful as m unit speed machines, because a m-speed machine can simulate m unit speed machines. ...
We prove this lemma in Section 6 after we show the power of the lemma. Lemma 1. Let σ be a set of jobs on a single machine with speed s . ...
doi:10.1007/978-3-642-40328-6_11
fatcat:6dgu7hq4ejc5fayua4mncslgue
Non-clairvoyant Scheduling for Minimizing Mean Slowdown
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our focus is on minimizing the mean slowdown, where the slowdown of a job (also known as stretch) is defined as the ratio of flow time to the size of the job. ...
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...
This lack of knowledge, known as non-clairvoyance, is a significant impediment in the scheduler's task, as one might expect. ...
doi:10.1007/3-540-36494-3_24
fatcat:f7janbiktzdc5kpuufjopvqpui
« Previous
Showing results 1 — 15 out of 2,134 results