Cost optimal scheduling in IaaS for dependent workload with particle swarm optimization

บทความในวารสาร

ผู้เขียน/บรรณาธิการ

กลุ่มสาขาการวิจัยเชิงกลยุทธ์

ไม่พบข้อมูลที่เกี่ยวข้อง

รายละเอียดสำหรับงานพิมพ์

รายชื่อผู้แต่ง: Netjinda N., Sirinaovakul B., Achalakul T.

ผู้เผยแพร่: Springer

ปีที่เผยแพร่ (ค.ศ.): 2014

วารสาร: Journal of Supercomputing (0920-8542)

Volume number: 68

Issue number: 3

หน้าแรก: 1579

หน้าสุดท้าย: 1603

จำนวนหน้า: 25

นอก: 0920-8542

eISSN: 1573-0484

URL: https://www.scopus.com/inward/record.uri?eid=2-s2.0-84905666939&doi=10.1007%2fs11227-014-1126-9&partnerID=40&md5=438295a1491ab054b726fc2182bbb80b

ภาษา: English-Great Britain (EN-GB)

ดูในเว็บของวิทยาศาสตร์ | ดูบนเว็บไซต์ของสำนักพิมพ์ | บทความในเว็บของวิทยาศาสตร์

บทคัดย่อ

Optimizing cloud provisioning for scientificworkflowapplications is a challenging problem, since the workflows generally contain dependency between tasks and require specific deadlines. Usually, cloud providers offer many options to the consumers. These options include the number of virtual machines, the type of each virtual machine and the purchasing method for each machine. Currently, cloud provisioning cost optimization is an active research topic. Most of this literature is concerned with task scheduling, cloud option selection, and cloud option selection for scientific workflow applications. However, research that attempts to find solutions which cover both cloud option selection and workflow task scheduling is very limited. In this paper, we focus on optimizing the cost of purchasing infrastructure-as-a-service cloud capabilities to achieve scientific work flow execution within the specific deadlines. The proposed system considers the number of purchased instances, instance types, purchasing options, and task scheduling as constraints in an optimization process. Particle swarm optimization augmented with a variable neighborhood search technique is used to find the optimal solution. Our approach finds the configurations of purchasing options with the optimum budget for a specified workflow application based on the required performance. The solutions from the proposed system show promising performance from the perspectives of the total cost and fitness convergence when compared with other state-of-the-art algorithms. ฉ Springer Science+Business Media New York 2014.

คำสำคัญ

Cost optimization, Deadline constraint, Variable neighborhood search