中大學術數位典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/106242
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94201/94201 (100%)
Visitors : 81675354      Online Users : 3966
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: https://ir.lib.ncu.edu.tw/handle/987654321/106242


    Title: A hybrid meta-heuristic algorithm for VM scheduling with load balancing in cloud computing
    Authors: 蔡邦維;Cho, Keng-Mao;Tsai, Pang-Wei;Tsai, Chun-Wei;Yang, Chu-Sing
    Contributors: 管理學院資訊管理學系
    Keywords: Artificial Intelligence;Computational Biology/Bioinformatics;Computational Science and Engineering;Computer Science;Data Mining and Knowledge Discovery;Image Processing and Computer Vision;Original Article;Probability and Statistics in Computer Science
    Date: 2015-08-25
    Issue Date: 2026-04-23 13:14:43 (UTC+8)
    Publisher: Springer London;London: Springer London
    Abstract: 摘要: Virtual machine (VM) scheduling with load balancing in cloud computing aims to assign VMs to suitable servers and balance the resource usage among all of the servers. In an infrastructure-as-a-service framework, there will be dynamic input requests, where the system is in charge of creating VMs without considering what types of tasks run on them. Therefore, scheduling that focuses only on fixed task sets or that requires detailed task information is not suitable for this system. This paper combines ant colony optimization and particle swarm optimization to solve the VM scheduling problem, with the result being known as ant colony optimization with particle swarm (ACOPS). ACOPS uses historical information to predict the workload of new input requests to adapt to dynamic environments without additional task information. ACOPS also rejects requests that cannot be satisfied before scheduling to reduce the computing time of the scheduling procedure. Experimental results indicate that the proposed algorithm can keep the load balance in a dynamic environment and outperform other approaches.
    其他題名: Neural Comput & Applic
    出版者: London: Springer London
    出版日期: 2015-08-01
    出處: Neural computing & applications, 2015-08, Vol.26 (6), p.1297-1309
    資源來源: Academic Search Premier (Ebsco)
    版權: The Natural Computing Applications Forum 2014
    識別號: ISSN: 0941-0643
    識別號: EISSN: 1433-3058
    識別號: DOI: 10.1007/s00521-014-1804-9
    Appears in Collections:[Department of Information Management] journal & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML11View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明