Filters








7,465 Hits in 7.3 sec

Scheduling to Minimize Max Flow Time: Offline and Online Algorithms [chapter]

Monaldo Mastrolilli
<span title="">2003</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We investigate the max flow time scheduling problem in the off-line and on-line setting. We prove positive and negative theoretical results.  ...  In the off-line setting, we address the unrelated parallel machines model and present the first known fully polynomial time approximation scheme, when the number of machines is fixed.  ...  Acknowledgements This research was supported by Swiss National Science Foundation project 20-63733.00/1, "Resource Allocation and Scheduling in Flexible Manufacturing Systems", and by the "Metaheuristics  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-45077-1_6">doi:10.1007/978-3-540-45077-1_6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/puoaltsfs5aj5k3oholllwmeym">fatcat:puoaltsfs5aj5k3oholllwmeym</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20150924030820/http://people.idsia.ch/~monaldo/papers/IJFCS-maxFlow-04.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f9/4b/f94befb632addde67ca34804b26d50da3e011446.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-45077-1_6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times [article]

Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers
<span title="2017-09-18">2017</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Consider a problem in which n jobs that are classified into k types arrive over time at their release times and are to be scheduled on a single machine so as to minimize the maximum flow time.  ...  We consider the problem as an online problem where each job is only known to the scheduler as soon as it arrives and where the processing time of a job only becomes known upon its completion (non-clairvoyance  ...  Non-Clairvoyant Greedy-like Online Algorithms We consider our problem in an online setting where jobs arrive over time at their release times and are not known to the scheduler in advance.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1709.05896v1">arXiv:1709.05896v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2nui226vrbarlnfazdehch2j4m">fatcat:2nui226vrbarlnfazdehch2j4m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200907061237/https://arxiv.org/pdf/1709.05896v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7f/9e/7f9ea295be871912a9cae3d953c018b1bdee2eb0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1709.05896v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Scheduling with conflicts: online and offline algorithms

Guy Even, Magnús M. Halldórsson, Lotem Kaplan, Dana Ron
<span title="2008-10-28">2008</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4c2hlkg77vcm7hv6dc4xzgilp4" style="color: black;">Journal of Scheduling</a> </i> &nbsp;
We compare the makespan of the schedule computed by an online algorithm to the makespan of an optimal offline algorithm whose input consists of the whole conflict graph and the release times of all the  ...  (v) Conflict graph: general or belonging to specific classes (e.g., trees, interval graphs, etc.) We consider both the online and offline models, and treat general graphs.  ...  Acknowledgments We thank Boaz Patt-Shamir and Hadas Shachnai for their useful comments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10951-008-0089-1">doi:10.1007/s10951-008-0089-1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ppk5liytnvhzdktihcelb4okpy">fatcat:ppk5liytnvhzdktihcelb4okpy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20080221174109/http://www.eng.tau.ac.il/~guy/Papers/Sched_with_conflicts.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ab/5b/ab5bc267ecebdcc30691f1af24091099867dea2b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10951-008-0089-1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Matchings with Group Fairness Constraints: Online and Offline Algorithms [article]

Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar
<span title="2021-05-20">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We consider the problem in both online and offline settings under natural restrictions on the classes.  ...  Our experiments show that the algorithms work well in practice both in terms of efficiency and the number of items that get assigned to some platform.  ...  We are grateful to the anonymous reviewers for their comments. AL was supported in part by SERB Award ECR/2017/003296 and a Pratiksha Trust Young Investigator Award.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2105.09522v1">arXiv:2105.09522v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fyzpflxyqrc7hdaqfbtfsqbiua">fatcat:fyzpflxyqrc7hdaqfbtfsqbiua</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210525173556/https://arxiv.org/pdf/2105.09522v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/6e/41/6e419ec6c48710882bb578b3baf87fb076c0c01b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2105.09522v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Scheduling Flows on a Switch to Optimize Response Times [article]

Hamidreza Jahanjou and Rajmohan Rajaraman and David Stalfa
<span title="2020-05-27">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We present approximation algorithms for flow scheduling over a switch to optimize response time based metrics.  ...  We study the scheduling of flows on a switch with the goal of optimizing metrics related to the response time of the flows.  ...  We would like to thank Janardhan Kulkarni for the many discussions on online flow scheduling, and for generously allowing us to include his proof of Lemma 5.1.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2005.09724v3">arXiv:2005.09724v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gscakg6i7zcwddmphch3iz7c3y">fatcat:gscakg6i7zcwddmphch3iz7c3y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200529021625/https://arxiv.org/pdf/2005.09724v3.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2005.09724v3" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Competitive non-migratory scheduling for flow time and energy

Tak-Wah Lam, Lap-Kei Lee, Isaac K. K. To, Prudence W. H. Wong
<span title="">2008</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tewj77cuufbzbgbk265bb462ga" style="color: black;">Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures - SPAA &#39;08</a> </i> &nbsp;
As a special case, our work also contributes to the traditional online flow-time scheduling.  ...  In this paper we extend the study of the tradeoff between flow time and energy from the single-processor setting [8, 6] to the multi-processor setting.  ...  Our work on flow time plus energy. We extend the study of online scheduling for minimizing flow time plus energy to the setting of m ≥ 2 processors.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1378533.1378580">doi:10.1145/1378533.1378580</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/spaa/LamLTW08.html">dblp:conf/spaa/LamLTW08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ictz35jamfejvdq2hcqldqdhcm">fatcat:ictz35jamfejvdq2hcqldqdhcm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20081002143517/http://www.csc.liv.ac.uk/~pwong/publications/spaa2008.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/61/0c/610c5252812452006e79916fc9123be92a99ff3e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1378533.1378580"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Single machine batch scheduling with release times

Beat Gfeller, Leon Peeters, Birgitta Weber, Peter Widmayer
<span title="2007-11-22">2007</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tsm6lnbvf5ahzjp7czojbjig5i" style="color: black;">Journal of combinatorial optimization</a> </i> &nbsp;
We investigate the objective of minimizing the total flow time, in both the online and offline setting.  ...  With different processing times and job reordering, our lower bound shows that online algorithms are inevitably bad in the worst case.  ...  Finally, as mentioned above, our objective is to minimize the total job flow time F = n j=1 F j . We refer to this scheduling problem as the BatchFlow problem.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10878-007-9114-0">doi:10.1007/s10878-007-9114-0</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qynv7mdwjnfkzjn3h6bv6ugboa">fatcat:qynv7mdwjnfkzjn3h6bv6ugboa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200309083045/https://www.research-collection.ethz.ch/bitstream/handle/20.500.11850/69570/eth-4826-01.pdf;jsessionid=7FBF2A6AB1B00500FDA51EA97B3C7E94?sequence=1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/92/2d/922df1bb041bbf3b5ee5b7ced8b248ad7a02bb3c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10878-007-9114-0"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Improved multi-processor scheduling for flow time and energy

Tak-Wah Lam, Lap-Kei Lee, Isaac K. K. To, Prudence W. H. Wong
<span title="2009-11-25">2009</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4c2hlkg77vcm7hv6dc4xzgilp4" style="color: black;">Journal of Scheduling</a> </i> &nbsp;
Energy usage has been an important concern in recent research on online scheduling. In this paper we study the tradeoff between flow time and energy [1, 5, 7, 19] in the multi-processor setting.  ...  Our main result is an enhanced analysis of a simple non-migratory online algorithm called CRR (classified round robin) on m ≥ 2 processors, showing that its flow time plus energy is within O(1) times of  ...  When energy is not a concern, the objective of a scheduler is simply to minimize the total flow time of all jobs, and it is well known that the online algorithm SRPT (shortest remaining processing time  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10951-009-0145-5">doi:10.1007/s10951-009-0145-5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ldprkd2f6bembbdltn3uvij6le">fatcat:ldprkd2f6bembbdltn3uvij6le</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170814230811/http://cgi.csc.liv.ac.uk/~pwong/publications/jos2012.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c1/6a/c16a74d27b5251329e87d3fa8db6d854756221cb.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10951-009-0145-5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Query execution timing

Chunyao Song, Zheng Li, Tingjian Ge, Jie Wang
<span title="">2013</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/6g37zvjwwrhv3dizi6ffue642m" style="color: black;">Proceedings of the 22nd ACM international conference on Conference on information &amp; knowledge management - CIKM &#39;13</a> </i> &nbsp;
We devise efficient algorithms for both offline and online cases followed by a competitive analysis to show the power of our online optimization.  ...  Specifically, we propose two query optimization modes: offline periodic optimization and online optimization.  ...  The first three authors were supported by the NSF grants IIS-1149417 and IIS-1239176. Jie Wang was supported by the NSF grants CNS-1018422 and CNS-1247875.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2505515.2505736">doi:10.1145/2505515.2505736</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/cikm/SongLGW13.html">dblp:conf/cikm/SongLGW13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/c4cwu2um3bb5tfk6b3o2hamlyu">fatcat:c4cwu2um3bb5tfk6b3o2hamlyu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160212225444/http://www.cs.uml.edu:80/~zli/download/Timing_CIKM2013.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/77/b9/77b90a5b014f83c5d8a6507a0610ca2d1d202676.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2505515.2505736"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Online Scheduling on a Single Machine with Grouped Processing Times

Qijia Liu, Long Wan, Lijun Wei
<span title="">2015</span> <i title="Hindawi Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3s4wom7forhp3klujcroiocrpi" style="color: black;">Discrete Dynamics in Nature and Society</a> </i> &nbsp;
We consider the online scheduling problem on a single machine with the assumption that all jobs have their processing times in[p,(1+α)p], wherep>0andα=(5-1)/2.  ...  All jobs arrive over time, and each job and its processing time become known at its arrival time.  ...  The online integrated productiondistribution scheduling problems to minimize the sum of the total weighted flow time and the total delivery cost were considered by Averbakh [10] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2015/805294">doi:10.1155/2015/805294</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nma6eshkcvepnaki6ngynby7vu">fatcat:nma6eshkcvepnaki6ngynby7vu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190502061525/http://downloads.hindawi.com/journals/ddns/2015/805294.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fa/65/fa651165a05e90caacc0e85ca56a0c3ca12c100b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2015/805294"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> hindawi.com </button> </a>

Speed Scaling for Weighted Flow Time

Nikhil Bansal, Kirk Pruhs, Cliff Stein
<span title="">2010</span> <i title="Society for Industrial &amp; Applied Mathematics (SIAM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7dys7zoberdktmxyjciuy5bnse" style="color: black;">SIAM journal on computing (Print)</a> </i> &nbsp;
This algorithm also allows us to efficiently construct an O(1)-approximate schedule for minimizing weighted flow time subject to an energy constraint.  ...  We give an online speed scaling algorithm that is O(1)-competitive for the objective of weighted flow time plus energy.  ...  An Online Lower Bound In this section, we show that the problem of minimizing flow time subject to a fixed energy bound online has no constant competitive algorithm.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/08072125x">doi:10.1137/08072125x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6vvqoudqnnea7aueibwbn5ykuy">fatcat:6vvqoudqnnea7aueibwbn5ykuy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809204000/http://people.cs.pitt.edu/~kirk/cs3150spring2010/BPS.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fa/cd/facd7e0edae808d3474ed0d061ba1ae0f503b02d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/08072125x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Non-clairvoyant Speed Scaling for Weighted Flow Time [chapter]

Sze-Hang Chan, Tak-Wah Lam, Lap-Kei Lee
<span title="">2010</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Bansal, Pruhs and Stein [7] were the first to consider jobs with arbitrary weights, and they give an online algorithm BPS that is O(( α ln α ) 2 )-competitive for minimizing weighted flow plus energy.  ...  Assuming jobs are equally important, it is natural to find a schedule that minimizes the total flow time (also known as minimizing the total/average response time).  ...  (online/offline) algorithm into one that scales the speed according to AJW, and the cost (weighted flow plus energy) at most doubles.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-15775-2_3">doi:10.1007/978-3-642-15775-2_3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mhjxgrwgtzf5djgfrag26ruw6u">fatcat:mhjxgrwgtzf5djgfrag26ruw6u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20101129125401/https://mpi-inf.mpg.de/~lklee/research/papers/esa10.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b9/82/b982bf24f8ea51fc3974b40c417e222be7e5caf6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-15775-2_3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Energy-efficient algorithms for flow time minimization

Susanne Albers, Hiroshi Fujiwara
<span title="2007-11-01">2007</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xjsyokeq6nawdowtypazhyoyli" style="color: black;">ACM Transactions on Algorithms</a> </i> &nbsp;
More specifically, our goal is to schedule a sequence of jobs on a variable-speed processor so as to minimize the total cost consisting of the energy consumption and the total flow time of all jobs.  ...  We devise a deterministic constant competitive online algorithm and show that the offline problem can be solved in polynomial time.  ...  For our energy/flow-time minimization problem, we are interested in both online and offline algorithms.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1290672.1290686">doi:10.1145/1290672.1290686</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fkqrnbjb2vhfpgx2gfjd2hx2m4">fatcat:fkqrnbjb2vhfpgx2gfjd2hx2m4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170706035650/http://people.cs.pitt.edu/%7Ekirk/cs3150spring2010/a49-albers.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ae/77/ae771f544ab184b5124609e424a3b486d0aceb31.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1290672.1290686"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Energy-Efficient Algorithms for Flow Time Minimization [chapter]

Susanne Albers, Hiroshi Fujiwara
<span title="">2006</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
More specifically, our goal is to schedule a sequence of jobs on a variable-speed processor so as to minimize the total cost consisting of the energy consumption and the total flow time of all jobs.  ...  We devise a deterministic constant competitive online algorithm and show that the offline problem can be solved in polynomial time.  ...  For our energy/flow-time minimization problem, we are interested in both online and offline algorithms.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11672142_51">doi:10.1007/11672142_51</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xezbz63hwzfrti4hqmlu33ueja">fatcat:xezbz63hwzfrti4hqmlu33ueja</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170706035650/http://people.cs.pitt.edu/%7Ekirk/cs3150spring2010/a49-albers.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ae/77/ae771f544ab184b5124609e424a3b486d0aceb31.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11672142_51"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Energy-efficient multiprocessor scheduling for flow time and makespan

Hongyang Sun, Yuxiong He, Wen-Jing Hsu, Rui Fan
<span title="">2014</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
The objective is to minimize the sum of the total energy consumption and certain performance metric, which in this paper includes total flow time and makespan.  ...  A scheduling algorithm needs to decide at any time both processor allocations and processor speeds for a set of parallel jobs with time-varying parallelism.  ...  The adversary will choose parallelism h to maximize this ratio, i.e., to find max 1≤h≤P G A (J ) G * (J ) , while the online algorithm A chooses (s 1 , · · · , s P ) to minimize max 1≤h≤P G A (J ) G *  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2014.07.007">doi:10.1016/j.tcs.2014.07.007</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/d4fhsva7h5asnf75b45qhpu43m">fatcat:d4fhsva7h5asnf75b45qhpu43m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191021152923/https://arxiv.org/pdf/1010.4110v1.pdf" title="fulltext PDF download [not primary version]" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0e/0e/0e0ed07cf98fcbf9361f5393f68070e22d564caf.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2014.07.007"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 7,465 results