Approximation algorithms and heuristics for task scheduling in data‐intensive distributed systems

Póvoa Marcelo G.; Xavier Eduardo C.

摘要

Abstract >In this work, we are interested in the problem of task scheduling on large‐scale data‐intensive computing systems. In order to achieve good performance, one must construct not only good task schedules but also good data allocation across nodes on the system, since before a task can be executed, it must have access to data distributed on the system. In this article, we present a general formulation of a static problem that combines both scheduling and replication problems in data‐intensive distributed systems. We show that this problem does not admit an approximation algorithm. However, considering a restricted version of the problem that considers some practical constraints, an approximation algorithm can be designed. From a practical perspective, we introduce a novel heuristic for the problem that is based on nodes clustering. We compare the heuristic with two adapted approaches from other works in the literature by computational simulations using an extensive set of instances based on real computer grids. We show that our heuristic often obtains the best solutions and also runs faster than other approaches. </abstract> </span> <span class="z_kbtn z_kbtnclass hoverxs" style="display: none;">展开▼</span> </div> <div class="translation abstracttxt"> <span class="zhankaihshouqi fivelineshidden" id="abstract"> <span>机译：</span><abstract xmlns =“http://www.wiley.com/namespaces/wiley”type =“main”xml：lang =“en”> <title type =“main”>抽象</ title> >工作，我们对大规模数据密集型计算系统上的任务调度问题感兴趣。为了实现良好的性能，必须构造不仅是良好的任务计划，而且在系统上的节点上也是良好的数据分配，因为在可以执行任务之前，它必须可以访问分布在系统上的数据。在本文中，我们展示了一种静态问题的常规制定，这些静态问题结合了数据密集型分布式系统中的调度和复制问题。我们表明这个问题不承认近似算法。然而，考虑到考虑考虑一些实际约束的问题的受限制版本，可以设计近似算法。从实际的角度来看，我们为基于节点聚类的问题介绍了一个新的启发式。通过使用基于真实计算机网格的广泛的实例，通过计算模拟将文献中的两个适应方法的启发式与其他作品的启发式进行比较。我们表明我们的启发式经常获得最佳解决方案，并且还比其他方法更快地运行。</ p> </ abstract> </span> <span class="z_kbtn z_kbtnclass hoverxs" style="display: none;">展开▼</span> </div> </div> <div class="record"> <h2 class="all_title" id="enpatent33" >著录项</h2> <ul> <li> <span class="lefttit">来源</span> <div style="width: 86%;vertical-align: text-top;display: inline-block;"> <a href='/journal-foreign-21977/'>《International transactions in operational research: A journal of The International Federation of Operational Research Societies》</a> <b style="margin: 0 2px;">|</b><span>2018年第5期</span><b style="margin: 0 2px;">|</b><span>共25页</span> </div> </li> <li> <div class="author"> <span class="lefttit">作者</span> <p id="fAuthorthree" class="threelineshidden zhankaihshouqi"> <a href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=Póvoa Marcelo G.&option=202" target="_blank" rel="nofollow">Póvoa Marcelo G.;</a> <a href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=Xavier Eduardo C.&option=202" target="_blank" rel="nofollow">Xavier Eduardo C.;</a> </p> <span class="z_kbtnclass z_kbtnclassall hoverxs" id="zkzz" style="display: none;">展开▼</span> </div> </li> <li> <div style="display: flex;"> <span class="lefttit">作者单位</span> <div style="position: relative;margin-left: 3px;max-width: 639px;"> <div class="threelineshidden zhankaihshouqi" id="fOrgthree"> <p>GoogleAvenida dos Andradas 3000 Belo Hozitonte 30260‐070 Brazil;</p> <p>Institute of ComputingUniversity of CampinasAv. Albert Einstein 1251 Campinas 13083‐852 Brazil;</p> </div> <span class="z_kbtnclass z_kbtnclassall hoverxs" id="zhdw" style="display: none;">展开▼</span> </div> </div> </li> <li > <span class="lefttit">收录信息</span> <span style="width: 86%;vertical-align: text-top;display: inline-block;"></span> </li> <li> <span class="lefttit">原文格式</span> <span>PDF</span> </li> <li> <span class="lefttit">正文语种</span> <span>eng</span> </li> <li> <span class="lefttit">中图分类</span> <span><a href="https://www.zhangqiaokeyan.com/clc/1144.html" title="运筹学">运筹学;</a></span> </li> <li class="antistop"> <span class="lefttit">关键词</span> <p style="width: 86%;vertical-align: text-top;"> <a style="color: #3E7FEB;" href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=data grids&option=203" rel="nofollow">data grids;</a> <a style="color: #3E7FEB;" href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=task scheduling&option=203" rel="nofollow">task scheduling;</a> <a style="color: #3E7FEB;" href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=data replication&option=203" rel="nofollow">data replication;</a> <a style="color: #3E7FEB;" href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=approximation algorithms&option=203" rel="nofollow">approximation algorithms;</a> </p> <div class="translation"> 机译：数据网格;任务调度;数据复制;近似算法; </div> </li> </ul> </div> </div> <div class="literature cardcommon"> <div class="similarity "> <h3 class="all_title" id="enpatent66">相似文献</h3> <div class="similaritytab clearfix"> <ul> <li class="active" >外文文献</li> <li >中文文献</li> <li >专利</li> </ul> </div> <div class="similarity_details"> <ul > <li> <div> <b>1. </b><a class="enjiyixqcontent" href="/journal-foreign-detail/0704023093835.html">Approximation algorithms and heuristics for task scheduling in data‐intensive distributed systems</a> <b>[J]</b> . <span> <a href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=Póvoa Marcelo G.&option=202" target="_blank" rel="nofollow" class="tuijian_auth tuijian_authcolor">Póvoa Marcelo G.,</a> <a href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=Xavier Eduardo C.&option=202" target="_blank" rel="nofollow" class="tuijian_auth tuijian_authcolor">Xavier Eduardo C. </a> <a href="/journal-foreign-21977/" target="_blank" rel="nofollow" class="tuijian_authcolor">International transactions in operational research: A journal of The International Federation of Operational Research Societies .</a> <span>2018</span><span>,第5期</span> </span> </div> <p class="zwjiyix translation" style="max-width: initial;height: auto;word-break: break-all;white-space: initial;text-overflow: initial;overflow: initial;"> <span>机译：数据密集型分布式系统任务调度的近似算法和启发式</span> </p> </li> <li> <div> <b>2. </b><a class="enjiyixqcontent" href="/academic-journal-foreign_detail_thesis/0204115245972.html">A Study Of BNP Parallel Task Scheduling Algorithms Metric's For Distributed Database System</a> <b>[J]</b> . <span> <a href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=Manik Sharma&option=202" target="_blank" rel="nofollow" class="tuijian_auth tuijian_authcolor">Manik Sharma,</a> <a href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=Gurdev Singh&option=202" target="_blank" rel="nofollow" class="tuijian_auth tuijian_authcolor">Gurdev Singh,</a> <a href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=Harsimran Kaur&option=202" target="_blank" rel="nofollow" class="tuijian_auth tuijian_authcolor">Harsimran Kaur </a> <a href="/journal-foreign-21079/" target="_blank" rel="nofollow" class="tuijian_authcolor">International Journal of Distributed and Parallel Systems .</a> <span>2012</span><span>,第1期</span> </span> </div> <p class="zwjiyix translation" style="max-width: initial;height: auto;word-break: break-all;white-space: initial;text-overflow: initial;overflow: initial;"> <span>机译：分布式数据库系统BNP并行任务调度算法度量的研究</span> </p> </li> <li> <div> <b>3. </b><a class="enjiyixqcontent" href="/academic-journal-foreign_detail_thesis/0204115100563.html">Static Task Scheduling Algorithms Based on Greedy Heuristics for Battery-Powered DVS Systems</a> <b>[J]</b> . <span> <a href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=Tetsuo YOKOYAMA&option=202" target="_blank" rel="nofollow" class="tuijian_auth tuijian_authcolor">Tetsuo YOKOYAMA,</a> <a href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=Gang ZENG&option=202" target="_blank" rel="nofollow" class="tuijian_auth tuijian_authcolor">Gang ZENG,</a> <a href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=Hiroyuki TOMIYAMA&option=202" target="_blank" rel="nofollow" class="tuijian_auth tuijian_authcolor">Hiroyuki TOMIYAMA,</a> <a href="/journal-foreign-20360/" target="_blank" rel="nofollow" class="tuijian_authcolor">IEICE transactions on information and systems .</a> <span>2010</span><span>,第10期</span> </span> </div> <p class="zwjiyix translation" style="max-width: initial;height: auto;word-break: break-all;white-space: initial;text-overflow: initial;overflow: initial;"> <span>机译：基于贪婪启发式的电池供电DVS系统静态任务调度算法</span> </p> </li> <li> <div> <b>4. </b><a class="enjiyixqcontent" href="/academic-conference-foreign_meeting-208468_thesis/020514333591.html">A List-based Heuristic Algorithm for Static Task Scheduling in Heterogeneous Distributed Computing Systems</a> <b>[C]</b> . <span> <a href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=Hadi Gholami&option=202" target="_blank" rel="nofollow" class="tuijian_auth tuijian_authcolor">Hadi Gholami,</a> <a href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=Reza Zakerian&option=202" target="_blank" rel="nofollow" class="tuijian_auth tuijian_authcolor">Reza Zakerian </a> <a href="/conference-foreign-208468/" target="_blank" rel="nofollow" class="tuijian_authcolor">International Conference on Web Research .</a> <span>2020</span> </span> </div> <p class="zwjiyix translation" style="max-width: initial;height: auto;word-break: break-all;white-space: initial;text-overflow: initial;overflow: initial;"> <span>机译：异构分布式计算系统中基于列表的启发式静态任务调度算法</span> </p> </li> <li> <div> <b>5. </b><a class="enjiyixqcontent" href="/academic-degree-foreign_mphd_thesis/02061187293.html">H2GS: A hybrid heuristic-genetic scheduling algorithm for static scheduling of tasks on heterogeneous processor networks.</a> <b>[D] </b> . <span> <a href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=Daoud, Mohammad.&option=202" target="_blank" rel="nofollow" class="tuijian_auth tuijian_authcolor">Daoud, Mohammad. </a> <span>2005</span> </span> </div> <p class="zwjiyix translation" style="max-width: initial;height: auto;word-break: break-all;white-space: initial;text-overflow: initial;overflow: initial;"> <span>机译：H2GS：一种混合启发式遗传调度算法，用于异构处理器网络上的任务静态调度。</span> </p> </li> <li> <div> <b>6. </b><a class="enjiyixqcontent" href="/academic-journal-foreign-pmc_elsevier-sponsored-documents_thesis/040004946491.html">Multi-heuristic dynamic task allocation using genetic algorithms in a heterogeneous distributed system</a> <b>[O] </b> . <span> <a href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=Andrew J. Page&option=202" target="_blank" rel="nofollow" class="tuijian_auth tuijian_authcolor">Andrew J. Page,</a> <a href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=Thomas M. Keane&option=202" target="_blank" rel="nofollow" class="tuijian_auth tuijian_authcolor">Thomas M. Keane,</a> <a href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=Thomas J. Naughton&option=202" target="_blank" rel="nofollow" class="tuijian_auth tuijian_authcolor">Thomas J. Naughton </a> <span>-1</span> </span> </div> <p class="zwjiyix translation" style="max-width: initial;height: auto;word-break: break-all;white-space: initial;text-overflow: initial;overflow: initial;"> <span>机译：异构分布式系统中使用遗传算法的多启发式动态任务分配</span> </p> </li> <li> <div> <b>7. </b><a class="enjiyixqcontent" href="/open-access_resources_thesis/0100059872918.html">Heuristic Algorithms for Scheduling Iterative Task Computations on Distributed Memory Machines</a> <b>[O] </b> . <span> <a href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=Tao Yang&option=202" target="_blank" rel="nofollow" class="tuijian_auth tuijian_authcolor">Tao Yang,</a> <a href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=Cong Fu&option=202" target="_blank" rel="nofollow" class="tuijian_auth tuijian_authcolor">Cong Fu </a> <span>1995</span> </span> </div> <p class="zwjiyix translation" style="max-width: initial;height: auto;word-break: break-all;white-space: initial;text-overflow: initial;overflow: initial;"> <span>机译：分布式存储器上迭代任务计算的启发式算法</span> </p> </li> </ul> <ul style="display: none;"> <li> <div> <b>1. </b><a class="enjiyixqcontent" href="/academic-journal-cn_computer-engineering-applications_thesis/0201241071336.html">分布式系统下的启发式任务调度算法</a> <b>[J]</b> <span> <a href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=贾丽云&option=202" target="_blank" rel="nofollow" class="tuijian_auth tuijian_authcolor"> . 贾丽云</a> <a href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=张向利&option=202" target="_blank" rel="nofollow" class="tuijian_auth tuijian_authcolor">,张向利</a> <a href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=张红梅&option=202" target="_blank" rel="nofollow" class="tuijian_auth tuijian_authcolor">,张红梅</a> <span> <a href="/journal-cn-8897/" target="_blank" rel="nofollow" class="tuijian_authcolor"> . 计算机工程与应用 </a> </span> <span> . 2017</span><span>,第012期</span> </span> </div> </li> <li> <div> <b>2. </b><a class="enjiyixqcontent" href="/academic-journal-cn_geomatics-spatial-information-technology_thesis/0201273473160.html">遥感影像处理特征及数据密集型任务调度算法研究</a> <b>[J]</b> <span> <a href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=李振举&option=202" target="_blank" rel="nofollow" class="tuijian_auth tuijian_authcolor"> . 李振举</a> <span> <a href="/journal-cn-4785/" target="_blank" rel="nofollow" class="tuijian_authcolor"> . 测绘与空间地理信息 </a> </span> <span> . 2019</span><span>,第003期</span> </span> </div> </li> <li> <div> <b>3. </b><a class="enjiyixqcontent" href="/academic-journal-cn_detail_thesis/0201292365966.html">基于信任模型的数据密集型网格任务调度算法研究</a> <b>[J]</b> <span> <a href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=林剑柠&option=202" target="_blank" rel="nofollow" class="tuijian_auth tuijian_authcolor"> . 林剑柠</a> <a href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=吴慧中&option=202" target="_blank" rel="nofollow" class="tuijian_auth tuijian_authcolor">,吴慧中</a> <span> <a href="/journal-cn-56753/" target="_blank" rel="nofollow" class="tuijian_authcolor"> . 信息与控制 </a> </span> <span> . 2006</span><span>,第5期</span> </span> </div> </li> <li> <div> <b>4. </b><a class="enjiyixqcontent" href="/academic-journal-cn_computer-engineering-applications_thesis/0201241311987.html">单位处理时间的多处理机任务调度近似算法</a> <b>[J]</b> <span> <a href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=黄金贵&option=202" target="_blank" rel="nofollow" class="tuijian_auth tuijian_authcolor"> . 黄金贵</a> <span> <a href="/journal-cn-8897/" target="_blank" rel="nofollow" class="tuijian_authcolor"> . 计算机工程与应用 </a> </span> <span> . 2008</span><span>,第032期</span> </span> </div> </li> <li> <div> <b>5. </b><a class="enjiyixqcontent" href="/academic-journal-cn_computer-engineering-applications_thesis/0201241312929.html">任意处理时间的多处理机任务调度近似算法</a> <b>[J]</b> <span> <a href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=黄金贵&option=202" target="_blank" rel="nofollow" class="tuijian_auth tuijian_authcolor"> . 黄金贵</a> <span> <a href="/journal-cn-8897/" target="_blank" rel="nofollow" class="tuijian_authcolor"> . 计算机工程与应用 </a> </span> <span> . 2008</span><span>,第033期</span> </span> </div> </li> <li> <div> <b>6. </b><a class="enjiyixqcontent" href="/academic-conference-cn_meeting-30321_thesis/0202293744.html">并行任务调度的近似算法</a> <b>[C]</b> <span> <a href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=黄金贵&option=202" target="_blank" rel="nofollow" class="tuijian_auth tuijian_authcolor"> . 黄金贵</a> <a href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=康宝生&option=202" target="_blank" rel="nofollow" class="tuijian_auth tuijian_authcolor">,康宝生</a> <span> <a href="/conference-cn-30321/" target="_blank" rel="nofollow" class="tuijian_authcolor"> . 第一届全国几何设计与计算学术会议 </a> <span> <span> . 2002</span> </span> </div> </li> <li> <div> <b>7. </b><a class="enjiyixqcontent" href="/academic-degree-domestic_mphd_thesis/020312899283.html">分布式系统中处理机的任务调度算法研究——智能算法在网格任务调度中的研究</a> <b>[A] </b> <span> <a href="/search.html?doctypes=4_5_6_1-0_4-0_1_2_3_7_9&sertext=张勇&option=202" target="_blank" rel="nofollow" class="tuijian_auth tuijian_authcolor"> . 张勇</a> <span> . 2008</span> </span> </div> </li> </ul> <ul style="display: none;"> <li> <div> <b>1. </b><a class="enjiyixqcontent" href="/patent-detail/06120111117955.html">基于数据密集型科学工作流的任务调度与虚拟机整合方法</a> <b>[P]</b> . <span> 中国专利： CN108628665A </span> <span> . 2018-10-09</span> </div> </li> <li> <div> <b>2. </b><a class="enjiyixqcontent" href="/patent-detail/06120107008593.html">多节点分布式系统中的任务调度装置和任务调度方法</a> <b>[P]</b> . <span> 中国专利： CN102831012A </span> <span> . 2012-12-19</span> </div> </li> <li> <div> <b>3. </b><a class="enjiyixqcontent" href="/patent-detail/06130416641579.html">Method and system of scheduling in charing tasks for electric vehicles based on genetic algorithms and intial population selection heuristics</a> <b>[P]</b> . <span> 外国专利：  KR101449801B1 </span> <span> . 2014-10-28</span> </div> <p class="zwjiyix translation" style="max-width: initial;height: auto;word-break: break-all;white-space: initial;text-overflow: initial;overflow: initial;"> <span>机译：基于遗传算法和初始种群选择启发式的电动汽车充电任务调度方法和系统 </span> </p> </li> <li> <div> <b>4. </b><a class="enjiyixqcontent" href="/patent-detail/06130416857078.html">METHOD AND SYSTEM OF SCHEDULING IN CHARING TASKS FOR ELECTRIC VEHICLES BASED ON GENETIC ALGORITHMS AND INTIAL POPULATION SELECTION HEURISTICS</a> <b>[P]</b> . <span> 外国专利：  KR20140017278A </span> <span> . 2014-02-11</span> </div> <p class="zwjiyix translation" style="max-width: initial;height: auto;word-break: break-all;white-space: initial;text-overflow: initial;overflow: initial;"> <span>机译：基于遗传算法和最终种群选择算法的电动汽车调度任务调度方法和系统 </span> </p> </li> <li> <div> <b>5. </b><a class="enjiyixqcontent" href="/patent-detail/06130443670678.html">Machine tool control device has dual CPUs with different operating systems and a data management unit, with one CPU intended for slower data-intensive tasks and the other intended for processing-intensive tasks such as NC tasks</a> <b>[P]</b> . <span> 外国专利：  DE10315273A1 </span> <span> . 2003-10-30</span> </div> <p class="zwjiyix translation" style="max-width: initial;height: auto;word-break: break-all;white-space: initial;text-overflow: initial;overflow: initial;"> <span>机译：机床控制设备具有带不同操作系统的双CPU和一个数据管理单元，其中一个CPU用于处理速度较慢的数据密集型任务，另一个CPU用于处理密集型任务（如NC任务） </span> </p> </li> </ul> </div> </div> </div> <div class="theme cardcommon" style="overflow: auto;display:none"> <h3 class="all_title" id="enpatent55">相关主题</h3> <ul id="subject"> </ul> </div> </div> </div> </div> <div class="right rightcon"> <div class="details_img cardcommon clearfix" style="margin-bottom: 10px;display:none;" > </div> </div> </div> <div id="thesis_get_original1" class="downloadBth" style="bottom: 19px;z-index: 999;" onclick="ywcd('0704023093835','4',7,2,1,'',this,24)" class="delivery" prompt="010401" title="通过人工服务将文献原文发送至邮箱" >获取原文</div> <div class="journalsub-pop-up" style="display: none"> <div class="journal-sub"> <h2>期刊订阅</h2> <img src="https://cdn.zhangqiaokeyan.com/img/loginclose.png" alt="关闭" onclick="$('.journalsub-pop-up').hide()"> <p class="pardon">抱歉，该期刊暂不可订阅，敬请期待！</p> <p class="current">目前支持订阅全部北京大学中文核心（2020）期刊目录。</p> <div style="display: flex;margin-top: 69px;justify-content: space-between;"> <div class="no-sub" onclick="$('.journalsub-pop-up').hide()">暂不订阅</div> <div class="other-sub" onclick="continueSub('from=pc-detail')">继续订阅其他期刊</div> </div> </div> </div> <div class="right_btn"> <ul> <li class="gouwuche">  </li> <li class="yijian"> <a href="javascript:void(0);" onclick="link_analysis('/mycenter/auth/complaint.html',this)" title="意见反馈">意见反馈</a> </li> <li class="top"> <a href="javascript:scrollTo(0,0);" title="回到顶部">回到顶部</a> </li> <li class="shouye"> <a href="/" title="首页">回到首页</a> </li> </ul> </div> <div class="xllindexfooter"> <div class="xllindexfootercenter"> <div class="xllindexfooterleft left" > <div class="xllindexfooterleftli"> <ul> <li><a href="/about.html" title="关于掌桥">关于掌桥</a></li> <li><a href="/help/helpmap.html" title="资源导航">资源导航</a></li> <li><a href="/help/helpguide.html" title="新手指南">新手指南</a></li> <li><a href="/help/helpcenter.html" title="常见问题">常见问题</a></li> <li><a href="/sitemap.html" title="网站地图">网站地图</a></li> <li><a href="/help/helpcenter.html?type=9" title="版权声明">版权声明</a></li> </ul> </div> <div class="xllindexfooterleft"> <p class="xllindexfooterlefteamil">客服邮箱：kefu@zhangqiaokeyan.com</p> <div class="xllindexfooterlefttcp"> <div class="xllindexfooterpoliceiimg"></div> <div class="xllindexfooterpoliceispan"> <span>京公网安备：11010802029741号 </span> <span>ICP备案号：<a href="https://beian.miit.gov.cn" rel="nofollow" target="_blank" title="ICP备案号">京ICP备15016152号-6</a></span> <span>六维联合信息科技 (北京) 有限公司©版权所有</span> </div> </div> </div> </div> <div class="xllindexfooterright left"> <ul> <li> <p style="font-weight: bold;">客服微信</p> <div></div> </li> <li> <p style="font-weight: bold;">服务号</p> <div></div> </li> </ul> </div> </div> </div> <span id="0704023093835down" data-source="7," data-out-id="WLu4ThAMArKOH8TK+aCRvXilBdkWswLMHIV8kR0ypxevpIyuwUD/srwAvnxQvixR," data-f-source-id="7" data-title="Approximation algorithms and heuristics for task scheduling in data‐intensive distributed systems" data-price="20" data-site-name="" data-transnum="24" style="display:none;"></span> <input type="hidden" value="4" id="sourcetype"> <input type="hidden" value="21977" id="journalid"> <input type="hidden" value="1" id="inyn_provide_service_level"> <input type="hidden" value="https://cdn.zhangqiaokeyan.com" id="imgcdn"> <input type="hidden" value="1" id="isdeatail"> <input type="hidden" value="" id="syyn_indexed_database"> <input type="hidden" value="" id="servicetype"> <input type="hidden" id="pagename" value="Approximation algorithms and heuristics for task scheduling in data‐intensive distributed systems"/> <input type="hidden" value="thesis_get_original" id="pageIdentification"> <script type="text/javascript" src="https://cdn.zhangqiaokeyan.com/js/jquery-1.12.4.js"></script> <script type="text/javascript" src="https://cdn.zhangqiaokeyan.com/js/common/lwlh_ajax.js"></script> <script type="text/javascript" src="https://cdn.zhangqiaokeyan.com/js/zq.js?v=5.7.8"></script> <script type="text/javascript" src="https://cdn.zhangqiaokeyan.com/js/common/common.js?v=5.7.8"></script> <script type="text/javascript" src="https://cdn.zhangqiaokeyan.com/js/jquery.cookie.js"></script> <script type="text/javascript" src="https://cdn.zhangqiaokeyan.com/js/top.js?v=5.7.8"></script> <script type="text/javascript" src="https://cdn.zhangqiaokeyan.com/js/common/tip.js?v=5.7.8"></script> <script type="text/javascript" src="https://cdn.zhangqiaokeyan.com/js/common/login.js?v=5.7.8"></script> <script type="text/javascript" src="https://cdn.zhangqiaokeyan.com/js/common/down.js?v=5.7.8"></script> <script type="text/javascript" src="https://cdn.zhangqiaokeyan.com/js/common/search.js?v=5.7.8"></script> <script type="text/javascript" src="https://cdn.zhangqiaokeyan.com/js/common/newmail.js?v=5.7.8"></script> <script type="text/javascript" src="https://cdn.zhangqiaokeyan.com/js/searchtype.js?v=5.7.8"></script> <script type="text/javascript" src="https://cdn.zhangqiaokeyan.com/js/user/regist.js?v=5.7.8"></script> <script type="text/javascript" src="https://cdn.zhangqiaokeyan.com/js/zxs_solor/detail.js?v=5.7.8"></script> <script type="text/javascript" src="https://www.zhangqiaokeyan.com/statistics/static/pagecollection.js"></script> <script type="text/javascript" src="https://cdn.zhangqiaokeyan.com/js/tj.js"></script> <script type="text/javascript" src="https://cdn.zhangqiaokeyan.com/js/common/sse.js?v=5.7.8"></script> <script type="text/javascript" src="https://cdn.zhangqiaokeyan.com/js/pushbaidu.js"></script> <script type="text/javascript" src="https://cdn.zhangqiaokeyan.com/js/common/history.js"></script> <script type="text/javascript" src="https://cdn.zhangqiaokeyan.com/js/util/cookie.js?v=5.7.8"></script> <script type="text/javascript" src="https://cdn.zhangqiaokeyan.com/js/weipu/weipu.js?v=5.7.8"></script> </body> <script> $(function(){ var weiPuStatus = getCookie('WeiPuStatus'); if(weiPuStatus){ tipWeiPuStatus(weiPuStatus); delCookie('WeiPuStatus'); } getFacetKeywordVoInId(); var sourcetype = $("#sourcetype").val(); var inyn_provide_service_level = $("#inyn_provide_service_level").val(); if((sourcetype ==1||sourcetype==4)&&inyn_provide_service_level!=4){ getJournal(); } }) </script> </html>