<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05981004</id>
  <dt>a</dt>
  <an>05981004</an>
  <augroup>
    <au>Jung, Daeyong</au>
    <au>Chin, SungHo</au>
    <au>Chung, KwangSik</au>
    <au>Yu, HeonChang</au>
    <au>Gil, JoonMin</au>
  </augroup>
  <ti>An efficient checkpointing scheme using price history of spot instances in cloud computing environment.</ti>
  <so>Altman, Erik (ed.) et al., Network and parallel computing. 8th IFIP international conference, NPC 2011, Changsha, China, October 21--23, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24402-5/pbk). Lecture Notes in Computer Science 6985, 185-200 (2011).</so>
  <py>2011</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>cloud computing</ut>
    <ut>checkpointing</ut>
    <ut>spot instances</ut>
    <ut>price history</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-642-24403-2_16</li>
  </ligroup>
  <abgroup>
    <ab>Summary: The cloud computing is a computing paradigm that users can rent computing resources from service providers as much as they require. A spot instance in cloud computing helps a user to utilize resources with less expensive cost, even if it is unreliable. When a user performs tasks with unreliable spot instances, failures inevitably lead to the delay of task completion time and cause a seriously deterioration in the QoS of users. Therefore, we propose a price history based checkpointing scheme to avoid the delay of task completion time. The proposed checkpointing scheme reduces the number of checkpoint trials and improves the performance of task execution. The simulation results show that our scheme outperforms the existing checkpointing schemes in terms of the reduction of both the number of checkpoint trials and total costs per spot instance for user's bid.</ab>
    <rv></rv>
  </abgroup>
</item>