Filters








1,929 Hits in 6.8 sec

Extra processors versus future information in optimal deadline scheduling

Chiu-Yuen Koo, Tak-Wah Lam, Tsuen-Wan Ngan, Kar-Keung To
<span title="">2002</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tewj77cuufbzbgbk265bb462ga" style="color: black;">Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures - SPAA &#39;02</a> </i> &nbsp;
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/564870.564890">doi:10.1145/564870.564890</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/spaa/KooLNT02.html">dblp:conf/spaa/KooLNT02</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/u2h6vzzmgfemteqcywe3y76i2m">fatcat:u2h6vzzmgfemteqcywe3y76i2m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811200940/http://hub.hku.hk/bitstream/10722/48427/1/91567.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/74/7b/747b968e527143a84ccd048e00a47de54943d430.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/564870.564890"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Extra processors versus future information in optimal deadline scheduling

Chiu-Yuen Koo, Tak-Wah Lam, Tsuen-Wan Ngan, Kar-Keung To
<span title="">2002</span> <i title="ACM Press"> Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures - SPAA &#39;02 </i> &nbsp;
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/564887.564890">doi:10.1145/564887.564890</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cds4cmw6bvfxro4bvexjfxpcw4">fatcat:cds4cmw6bvfxro4bvexjfxpcw4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811200940/http://hub.hku.hk/bitstream/10722/48427/1/91567.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/74/7b/747b968e527143a84ccd048e00a47de54943d430.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/564887.564890"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Extra Processors versus Future Information in Optimal Deadline Scheduling

Chiu-Yuen Koo, Tak-Wah Lam, Tsuen-Wan "Johnny" Ngan, Kar-Keung To
<span title="2004-03-15">2004</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qj6jzeossfhihfshwf7nb7lbcq" style="color: black;">Theory of Computing Systems</a> </i> &nbsp;
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00224-004-1116-z">doi:10.1007/s00224-004-1116-z</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/olap6accbfdjrh6vw7jffnn36q">fatcat:olap6accbfdjrh6vw7jffnn36q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811200940/http://hub.hku.hk/bitstream/10722/48427/1/91567.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/74/7b/747b968e527143a84ccd048e00a47de54943d430.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00224-004-1116-z"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Minimum-Energy Semi-Static Scheduling of a Periodic Real-Time Task on DVFS-Enabled Multi-Core Processors

Wan Yeon LEE, Hyogon KIM, Heejo LEE
<span title="">2011</span> <i title="Institute of Electronics, Information and Communications Engineers (IEICE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xosmgvetnbf4zpplikelekmdqe" style="color: black;">IEICE transactions on information and systems</a> </i> &nbsp;
The proposed scheduling scheme minimizes the energy consumption of a real-time task on the multi-core processor with the dynamic voltage and frequency scaling capability.  ...  The scheme allocates a pertinent number of cores to the task execution, inactivates unused cores, and assigns the lowest frequency meeting the deadline.  ...  for current and future mobile devices.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1587/transinf.e94.d.2389">doi:10.1587/transinf.e94.d.2389</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4kihe5xyejd5bcjfmj66t23mdu">fatcat:4kihe5xyejd5bcjfmj66t23mdu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180725113739/https://www.jstage.jst.go.jp/article/transinf/E94.D/12/E94.D_12_2389/_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/c7/6b/c76baaf5ea62ef2fc50d7a0214da87c9ddc324dd.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1587/transinf.e94.d.2389"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Application-directed voltage scaling

J. Pouwelse, K. Langendoen, H.J. Sips
<span title="">2003</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/uqbr2omxsbdgtaxslmblka2nnu" style="color: black;">IEEE Transactions on Very Large Scale Integration (vlsi) Systems</a> </i> &nbsp;
We take the approach that such applications must be made power-aware and specify their average execution time (AET) and the deadline to the scheduler controlling the clock speed and processor voltage.  ...  The EPS algorithm does not always yield the optimal schedule, but has a low complexity. We have implemented EPS on a StrongARM-based variable-voltage platform.  ...  The frame length can optionally be added to the header by using the H.263 PEI (extra insertion information) header field.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tvlsi.2003.814324">doi:10.1109/tvlsi.2003.814324</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2s3tmlznwrcf3euyu4mmherzem">fatcat:2s3tmlznwrcf3euyu4mmherzem</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808112120/http://www.ds.ewi.tudelft.nl/pubs/papers/tvlsi03.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/2e/cf/2ecf34247fc25a11afb55762ce405f7fa48f0776.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tvlsi.2003.814324"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Operating System Modifications for Task-Based Speed and Voltage

Jacob R. Lorch, Alan Jay Smith
<span title="">2003</span> <i title="ACM Press"> Proceedings of the 1st international conference on Mobile systems, applications and services - MobiSys &#39;03 </i> &nbsp;
It even performs PACE calculation, which is quite complicated, in only 4.4 µs on average due to our extensive optimizations.  ...  Although the PACE calculator does not save energy for the current generation of processors due to their limited range of worthwhile speed and voltage settings, we expect future processors to have greater  ...  The three processors differ only in their maximum speeds: 600 MHz, 800 MHz, Table 5 : Comparison of using built-in LongRun TM scheduling versus doing this scheduling with RightSpeed and 1 GHz.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1066116.1189044">doi:10.1145/1066116.1189044</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/horx4zocord7nepi52s5zo3ymq">fatcat:horx4zocord7nepi52s5zo3ymq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170813075845/https://www.usenix.org/legacy/publications/library/proceedings/mobisys03/tech/full_papers/lorch/lorch.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/69/14/6914d1c7cd15f0cb3df33a1d9b1ccb49393be40e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1066116.1189044"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Deterministic preemptive scheduling of real-time tasks

L.E. Jackson, G.N. Rouskas
<span title="">2002</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dsrvu6bllzai7oj3hktnc5yf4q" style="color: black;">Computer</a> </i> &nbsp;
Employing an extra processor or two beyond the optimal number can be a small price to pay when it significantly reduces the complexity.  ...  In some scheduling problems, the goal is to find the optimal schedule from among all feasible schedules, according to a desired optimality principle.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/mc.2002.999778">doi:10.1109/mc.2002.999778</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2zdsbigy2bakrkc4nd65fz2eqe">fatcat:2zdsbigy2bakrkc4nd65fz2eqe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811035145/https://www.csc2.ncsu.edu/faculty/rouskas/Publications/Journals/Computer-Jackson-2002.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/e1/24/e1241989ac9d83dc45a52fcb98b33431cd05527e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/mc.2002.999778"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Optimum Buffer Size for Dynamic Voltage Processors [chapter]

Ali Manzak, Chaitali Chakrabarti
<span title="">2004</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;
The calculations are based on information about data size (maximum, minimum), execution time (best case, worst case), and deadlines.  ...  This paper addresses the problem of calculating optimum buffer size for a dynamic voltage scaling processor.  ...  Simulation parameters are chosen as following: period = p = 50, maxdata = 50 and deadline = 3 * p. Task voltages optimally assigned using the optimal offline scheduling algorithm in [8] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-30205-6_73">doi:10.1007/978-3-540-30205-6_73</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hiuskt4u35acnae3ccfldvft4a">fatcat:hiuskt4u35acnae3ccfldvft4a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060903052425/http://enws155.eas.asu.edu:8001/confpapers/patmos04.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/b2/45/b24555f23e1a5036fedbcf20795a0aeff31148cf.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-30205-6_73"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Implications of classical scheduling results for real-time systems

J.A. Stankovic, M. Spuri, M. Di Natale, G.C. Buttazzo
<span title="">1995</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dsrvu6bllzai7oj3hktnc5yf4q" style="color: black;">Computer</a> </i> &nbsp;
Uni-processor and multiprocessor results are addressed as well as important issues such a s future release times, precedence constraints, shared resources, task value, overloads, static versus dynamic  ...  scheduling, preemption versus non-preemption, multiprocessing anomalies, and metrics.  ...  First, consider that under certain conditions in a uni-processor, dynamic earliest deadline scheduling is optimal. Is this algorithm optimal in a multiprocessor? The answer is no.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/2.386982">doi:10.1109/2.386982</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pgdsgkk5mbhzra4bud4w5fxerq">fatcat:pgdsgkk5mbhzra4bud4w5fxerq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20050816110439/http://cs.cnu.ac.kr:80/~ykim/courses/grad-rts2004/refs/mmimpli.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/7e/33/7e33e4b651f03f16b37080d188e831918fa492b2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/2.386982"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Dynamic resource allocation of computer clusters with probabilistic workloads

M. Sleiman, L. Lipsky, R. Sheahan
<span title="">2006</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/t3x4vqewrncrfgn2wu7cafsbsq" style="color: black;">Proceedings 20th IEEE International Parallel &amp; Distributed Processing Symposium</a> </i> &nbsp;
schedule and taking resources from jobs that are ahead of schedule.  ...  In many distributed and parallel processing systems, particularly real-time systems, it is desirable and more efficient for jobs to finish as close to a target time as possible.  ...  The EDF algorithm was adopted as an optimal algorithm for meeting deadlines. However, this algorithm has its drawbacks in detecting deadline violations, as shown in [5] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ipdps.2006.1639673">doi:10.1109/ipdps.2006.1639673</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/ipps/SleimanLS06.html">dblp:conf/ipps/SleimanLS06</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6gbi72nrkjcp3eb6wt2npifzti">fatcat:6gbi72nrkjcp3eb6wt2npifzti</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170814155610/http://www.cecs.uci.edu/~papers/ipdps06/pdfs/23-DPDNS-paper-1.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/b8/56/b8562c4ba0bba67c8a47549f3a8e62a42cc2179b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ipdps.2006.1639673"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Intraprogram dynamic voltage scaling

Fen Xie, Margaret Martonosi, Sharad Malik
<span title="2004-09-01">2004</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jfrn2kjyarhe7npmgvoxdp4cxu" style="color: black;">ACM Transactions on Architecture and Code Optimization (TACO)</a> </i> &nbsp;
by considering multiple data categories in the optimization.  ...  In this paper, we explore the opportunities and limits of intraprogram DVS scheduling.  ...  While using WCET guarantees the deadline requirements, the static scheduling is not optimal in terms of reducing energy by utilizing the slacks produced by early completion.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1022969.1022973">doi:10.1145/1022969.1022973</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/uvymr3zl4rer7izgzlayjwhstm">fatcat:uvymr3zl4rer7izgzlayjwhstm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060916053238/http://www.princeton.edu/~fxie/publication/taco_xie.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/a6/f5/a6f5b005c5eeffd909046adcd30a93ccf57c2496.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1022969.1022973"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Accurate modeling and prediction of energy availability in energy harvesting real-time embedded systems

Jun, Shaobo Liu, Qing Wu, Qinru Qiu
<span title="">2010</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dfy63obam5apllpm77zjnlh5em" style="color: black;">International Conference on Green Computing</a> </i> &nbsp;
This work also addresses the techniques in runtime prediction of future harvested energy.  ...  Experimental results show the improvements achieved by the MAP-DVFS algorithm in deadline miss rate.  ...  Create Initial Schedule All tasks in the ready task queue Q are sorted in the ascending order of the task deadline. In this step, all tasks are assumed to be executed at full speed of the processor.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/greencomp.2010.5598280">doi:10.1109/greencomp.2010.5598280</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/green/LuLWQ10.html">dblp:conf/green/LuLWQ10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/csklkgphh5bdvinoa4sjfeudze">fatcat:csklkgphh5bdvinoa4sjfeudze</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20121114192445/http://hydrogen.syr.edu/~qqiu/papers/IGCC2010-harvesting.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/45/d6/45d6bf19642f46ab9e1433f7ebfed7eda39f978a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/greencomp.2010.5598280"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

A Proposed Off-Line DVS Approach for Minimizing Energy Consumption

Suaiman MAbbas, Yarub Y Abbas
<span title="2014-04-18">2014</span> <i title="Foundation of Computer Science"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/b637noqf3vhmhjevdfk3h5pdsu" style="color: black;">International Journal of Computer Applications</a> </i> &nbsp;
This paper concerns with the issue of minimizing of ever increasing energy consumption in computer systems .The minimization of energy consumption can be achieved by help of hardware feature in the processors  ...  called Dynamic Voltage Scaling (DVS).When the applied voltage on processor decreased then the energy consumption of processor will decrease ,but at the same time the speed of the processor will also decrease  ...  , then scheduling in increasing deadline order will always satisfy all deadlines .If the tasks passed the schedulable conditions ,then any available slack has to be found when executing all the tasks at  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5120/15947-4980">doi:10.5120/15947-4980</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/37zovpnmdjg3vbvnkvnjd4bhja">fatcat:37zovpnmdjg3vbvnkvnjd4bhja</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170706142821/http://research.ijcaonline.org/volume91/number14/pxc3894980.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/37/8f/378fe54c64124e55ccc13f970b37cddc4aaf2d2c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5120/15947-4980"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

A Unified Approach to Variable Voltage Scheduling for Nonideal DVS Processors

B.C. Mochocki, X.S. Hu, G. Quan
<span title="">2004</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/rl7xk4fwazdrred2difr6v3lii" style="color: black;">IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems</a> </i> &nbsp;
Voltage scheduling is an essential technique used to exploit the benefit of dynamic voltage-scaling processors.  ...  Though extensive research exists in this area, current processor limitations such as time and energy transition overhead and voltage-level discretization are often dismissed as insignificant.  ...  The optimal voltage schedule by LPEDF, assuming both 1t and 1E are zero, is given in Fig. 1(b) . Suppose the same set of jobs is scheduled on a DVS processor with 1t = 100.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tcad.2004.833602">doi:10.1109/tcad.2004.833602</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kxvujwb7mzgn3hcqtxu27hizva">fatcat:kxvujwb7mzgn3hcqtxu27hizva</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170705212814/http://www.cse.nd.edu/~shu/research/papers/tcad04.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/f2/7b/f27b462f0752f9aebb9999606084c9c38988e948.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tcad.2004.833602"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Controlled Duplication Scheduling of Real-Time Precedence Tasks on Heterogeneous Multiprocessors [chapter]

Jagpreet Singh, Nitin Auluck
<span title="">2017</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Duplicating the predecessor of a task on the processor to which the task is assigned can result in the minimization of the communication cost. This helps in reducing the schedule length.  ...  We observe that whether to duplicate tasks or not is decided by the task deadlines. In the case that the deadline can be met without duplication, more schedule holes are created.  ...  Since the information of all the tasks is available in advance, the task schedule queue SQ t is generated before the actual scheduling.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-61756-5_1">doi:10.1007/978-3-319-61756-5_1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/32qvfhink5fxbgurnfmhe2wsde">fatcat:32qvfhink5fxbgurnfmhe2wsde</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829070938/http://www.cs.huji.ac.il/~feit/parsched/jsspp15/p3-singh.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/c7/d3/c7d33a9f8090028a16bd25d9cf70c498ea0486b5.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-319-61756-5_1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 1,929 results