A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Filters
Uniform Bounds for Scheduling with Job Size Estimates
[article]
2021
arXiv
pre-print
Preserved Fulltext
Other Versions
We consider the problem of scheduling to minimize mean response time in M/G/1 queues where only estimated job sizes (processing times) are known to the scheduler, where a job of true size s has estimated ...
This is the first result showing this type of convergence for M/G/1 scheduling. We also study the Preemptive Shortest Job First (PSJF) policy, a cousin of SRPT. ...
Instead, it may be that the scheduler has only an estimated size for each job. ...
arXiv:2110.00633v1
fatcat:lmnct5rhhneo3deqbimafna4qi
Uniform Bounds for Scheduling with Job Size Estimates
2022
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 2022; you can also visit the original URL.
The file type is application/pdf.
We consider the problem of scheduling to minimize mean response time in M/G/1 queues where only estimated job sizes (processing times) are known to the scheduler, where a job of true size s has estimated ...
This is the first result showing this type of convergence for M/G/1 scheduling. We also study the Preemptive Shortest Job First (PSJF) policy, a cousin of SRPT. ...
Instead, it may be that the scheduler has only an estimated size for each job.
114:2 Uniform Bounds for Scheduling with Job Size Estimates In settings where the scheduler knows only job size estimates ...
doi:10.4230/lipics.itcs.2022.114
fatcat:2k2eu25rznghdplojz7xhtzqp4
Identifying Quick Starters: Towards an Integrated Framework for Efficient Predictions of Queue Waiting Times of Batch Parallel Jobs
[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 2012; you can also visit the original URL.
The file type is application/pdf.
Existing strategies provide high overestimates of upper bounds of queue waiting times rendering the bounds less useful for jobs with short queue waiting times. ...
Prediction of these queue waiting times is important to provide overall estimates to the users and can also help metaschedulers make scheduling decisions. ...
jobs in the queue in terms of request size and estimated run time. ...
doi:10.1007/978-3-642-35867-8_11
fatcat:scz7fkbd7jaqxclrr4jxzx2iuy
PSBS: Practical Size-Based Scheduling
[article]
2015
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.
Other Versions
job size estimations. ...
We take the goal of designing scheduling policies that are explicitly designed to deal with inexact job sizes: first, we show that existing size-based schedulers can have bad performance with inexact job ...
EVALUATION METHODOLOGY Understanding size-based scheduling when there are estimation errors is not a simple task; analytical studies have been performed only with strong assumptions such as bounded error ...
arXiv:1410.6122v4
fatcat:jtkfczcsmbe4le2ft2o2k4ayty
PSBS: Practical Size-Based Scheduling
2016
IEEE transactions on computers
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.
It is definitely more likely to inform the system with an estimate of the job sizes, but existing studies point to somewhat pessimistic results if size-based policies use imprecise job size estimations ...
We take the goal of designing scheduling policies that explicitly deal with inexact job sizes. ...
EVALUATION METHODOLOGY Understanding size-based scheduling when there are estimation errors is not a simple task; analytical studies have been performed only with strong assumptions such as bounded error ...
doi:10.1109/tc.2015.2468225
fatcat:eqsxc322lrdl7ncvg6pvwapgum
An experimental analysis of local minima to improve neighbourhood search
2003
Computers & Operations Research
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.
The paper reports a number of experiments with local search algorithms applied to job shop scheduling. The main aim was to get insights into the structure of the underlying conguration space. ...
For example, we obtain the new upper bound 886 on the 20 20 benchmark problem YN1. ...
A direct comparison with other heuristics for the job shop problem provides an additional justi cation for our non-uniform neighbourhood relation. ...
doi:10.1016/s0305-0548(02)00128-4
fatcat:rtk5nmgbqjgotmqtwmzlwur43e
Cache-Aware Real-Time Scheduling on Multicore Platforms: Heuristics and a Case Study
2008
2008 Euromicro Conference on Real-Time Systems
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 2008; you can also visit the original URL.
The file type is application/pdf.
Such heuristics are applicable when multiple multithreaded applications exist with large working sets. ...
To effectively use the available processing resources on such platforms, scheduling methods must be aware of these caches. ...
Acknowledgement: We would like to thank Ketan Mayer-Patel for discussions regarding MPEG-2 encoding. ...
doi:10.1109/ecrts.2008.10
dblp:conf/ecrts/CalandrinoA08
fatcat:eculxpiuebdihplu6xhvgnde2e
Randomization, Speculation, and Adaptation in Batch Schedulers
2000
ACM/IEEE SC 2000 Conference (SC'00)
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 2003; you can also visit the original URL.
The file type is application/pdf.
The cumulative improvements of these techniques decrease the bounded slowdown, our primary metric, to less then 15% of conservative backfilling. ...
Our study differs from many similar studies in using traces that contain user estimates. We find that actual overestimates are large and significantly different from simple models. ...
Overall best greedy algorithm (one with quarter-size instead of double-size alternative and with restrictions for long jobs) only matches the bounded slowdowns of halfsize alternative applied always, and ...
doi:10.1109/sc.2000.10041
dblp:conf/sc/PerkovicK00
fatcat:kwjrgliegvaa3ds4etwyk25cta
Explorable Uncertainty in Scheduling with Non-Uniform Testing Times
[article]
2020
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.
Other Versions
For the preemptive setting, we additionally give a first lower bound. We also present a randomized algorithm with improved competitive ratio. ...
Recently, D\"urr et al. [5] have studied the setting where all testing times are of unit size and have given lower and upper bounds for the objectives of minimizing the sum of completion times and the ...
As we show in Appendix A, the idea of scheduling untested jobs with small upper bounds in the beginning of the schedule, which works well in the uniform case, fails to generalize to non-uniform tests. ...
arXiv:2009.13316v1
fatcat:xhnjlsodx5azdcih7dx2z6iasm
Scheduling with Testing on Multiple Identical Parallel Machines
[article]
2021
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 2021; 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:
2021 accepted arXiv:2105.02052v2 fatcat:a3xmqs766nbktkudcx3o2ylrju
We compare this result with a simple greedy strategy and a lower bound which approaches 2. In the case of uniform testing times, we can improve the SBS algorithm to be 3-competitive. ...
Jobs have an unknown processing time that can be explored by running a test. Alternatively, jobs can be executed for the duration of a given upper limit. ...
A critical step lies in the estimation of p A l for l ∈ S 2 , where we are able to lower bound τ l using the size of the m-th and (m+1)-th largest job because the algorithm already ran m jobs from S 1 ...
arXiv:2105.02052v1
fatcat:xggcssykxbbylfy3hjtm2ny3mm
Approximation Algorithms for Scheduling under Non-Uniform Machine-Dependent Delays
[article]
2022
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 2022; you can also visit the original URL.
The file type is application/pdf.
These results represent the first polylogarithmic approximation algorithms for scheduling with non-uniform communication delays. ...
We are given as input a set of n unit size precedence-constrained jobs, and a set of m related machines each with size m_i (machine i can execute at most m_i jobs at any time). ...
We bound K by O(log 3 n) in the general case when the speeds, sizes, and delays of machines are non-uniform. ...
arXiv:2207.13121v1
fatcat:5nsp3vfxondjfejamypoqdq6ua
LOMARC — Lookahead Matchmaking for Multi-resource Coscheduling
[chapter]
2005
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 2021; you can also visit the original URL.
The file type is application/pdf.
This is a standard policy in most schedulers for dealing with the wrong estimation of job runtime. ...
A two-phase-uniform distribution is used to generate the logarithmic sizes, which are the logarithms of job sizes, with the base of two. ...
doi:10.1007/11407522_16
fatcat:pkfccks2dnbutb2o73xodkucgy
Page 7474 of Mathematical Reviews Vol. , Issue 2004i
[page]
2004
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.
“We give lower bounds on the competitive ratio and present algorithms for jobs with varying sizes, for jobs with uniform size, and for jobs that can be run for an arbitrary length of time or for some fixed ...
Summary: “We deal with the following scheduling problem: a
finite set of jobs is given and each job consists in the execution of
an infinite number of tasks. ...
Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach
2004
Journal of the Operational Research Society
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.
The GA is tested against a lower bound from the literature as well as against heuristic rules on a test bed comprising 400 problems with up to 100 jobs, 10 stages, and with up to five processors on each ...
For larger problems, optimum solutions are estimated by a statistical prediction technique. Computational results show that the GA is both effective and efficient for the current problem. ...
From the rest of the jobs, jobs with size[i,j] ¼ m i /2 (ie, jobs jAB i ) can best be scheduled such that their work content is distributed evenly on the processors. ...
doi:10.1057/palgrave.jors.2601716
fatcat:wdetukyhyvewvlbmg6ji6r46by
Optimizing Service Level Agreements for Autonomic Cloud Bursting Schedulers
2010
2010 39th International Conference on Parallel Processing Workshops
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.
In particular, these opportunistic schedulers use a quadratic response surface model for processing time in concert with a time-of-day dependent bandwidth predictor to increase the throughput and utilization ...
Further, the problem is exacerbated by data intensive computing -we encounter huge file sizes atypical of intercloud parallel processing. ...
: s bound , m bound : size-interval bounds for small and medium queues L ←− ∅ 1 rload ←− 0 2 for i ← 1 to |B| do 3 job ←− B.get(i) 4 // Completion time in EC under no load tec ←− job.tup + job.eec + job.Ls ...
doi:10.1109/icppw.2010.54
dblp:conf/icppw/KailasamGDS10
fatcat:qskxjvlkm5ce3byklazagpdvam
« Previous
Showing results 1 — 15 out of 31,849 results