Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (2)
  • Open Access


    A Service Level Agreement Aware Online Algorithm for Virtual Machine Migration

    Iftikhar Ahmad1,*, Ambreen Shahnaz2, Muhammad Asfand-e-Yar3, Wajeeha Khalil1, Yasmin Bano1

    CMC-Computers, Materials & Continua, Vol.74, No.1, pp. 279-291, 2023, DOI:10.32604/cmc.2023.031344

    Abstract The demand for cloud computing has increased manifold in the recent past. More specifically, on-demand computing has seen a rapid rise as organizations rely mostly on cloud service providers for their day-to-day computing needs. The cloud service provider fulfills different user requirements using virtualization - where a single physical machine can host multiple Virtual Machines. Each virtual machine potentially represents a different user environment such as operating system, programming environment, and applications. However, these cloud services use a large amount of electrical energy and produce greenhouse gases. To reduce the electricity cost and greenhouse gases,… More >

  • Open Access


    Competitive Risk Aware Algorithm for k-min Search Problem

    Iftikhar Ahmad1,*, Abdulwahab Ali Almazroi2, Mohammed A. Alqarni3, Muhammad Kashif Nawaz1

    Intelligent Automation & Soft Computing, Vol.31, No.2, pp. 1131-1142, 2022, DOI:10.32604/iasc.2022.020715

    Abstract In a classical k-min search problem, an online player wants to buy k units of an asset with the objective of minimizing the total buying cost. The problem setting allows the online player to view only a single price quotation at each time step. A price quotation is the price of one unit of an asset. After receiving the price quotation, the online player has to decide on the number of units to buy. The objective of the online player is to buy the required k units in a fixed length investment horizon. Online algorithms are proposed More >

Displaying 1-10 on page 1 of 2. Per Page