The impact of checkpointing interval selection on the scheduling performance of real‐time fine‐grained parallel applications in SaaS clouds under various failure probabilities. (23rd August 2017)
- Record Type:
- Journal Article
- Title:
- The impact of checkpointing interval selection on the scheduling performance of real‐time fine‐grained parallel applications in SaaS clouds under various failure probabilities. (23rd August 2017)
- Main Title:
- The impact of checkpointing interval selection on the scheduling performance of real‐time fine‐grained parallel applications in SaaS clouds under various failure probabilities
- Authors:
- Stavrinides, Georgios L.
Karatza, Helen D. - Other Names:
- Delgado Olabarriaga Sílvia guestEditor.
Krefting Dagmar guestEditor.
Glatard Tristan guestEditor.
Zbakh Mostapha guestEditor.
Bakhouya Mohamed guestEditor.
Essaaidi Mohamed guestEditor.
Manneback Pierre guestEditor. - Abstract:
- Summary: As the adoption of Software as a Service (SaaS) cloud computing continues to gain momentum, the arising challenges of scheduling parallel applications on such platforms need to be addressed. Due to the complexity and the fine‐grained parallelism of the workload, as well as the multi‐tenancy of the underlying host environment, end‐user applications are usually prone to transient software failures. Therefore, fault tolerance is one of the most crucial aspects of scheduling in SaaS clouds. It is usually achieved through application‐directed checkpointing. However, selecting an appropriate checkpointing interval is not a trivial task. Unnecessary frequent checkpointing may degrade the system performance. On the other hand, infrequent checkpointing may lead to greater recovery time and thus poorer performance. Consequently, the checkpointing interval must be selected taking into account the failure probability, as well as the nature of the workload. Towards this direction, we investigate via simulation the impact of checkpointing interval selection on the performance of a SaaS cloud, where fine‐grained parallel applications with firm deadlines and approximate computations are scheduled for execution, under various failure probabilities. The simulation results are analyzed, in an attempt to shed light on the relation between the checkpointing interval and failure probability.
- Is Part Of:
- Concurrency and computation. Volume 30:Number 12(2018)
- Journal:
- Concurrency and computation
- Issue:
- Volume 30:Number 12(2018)
- Issue Display:
- Volume 30, Issue 12 (2018)
- Year:
- 2018
- Volume:
- 30
- Issue:
- 12
- Issue Sort Value:
- 2018-0030-0012-0000
- Page Start:
- n/a
- Page End:
- n/a
- Publication Date:
- 2017-08-23
- Subjects:
- approximate computations -- checkpointing interval -- gang scheduling -- real‐time parallel applications -- SaaS cloud performance -- software failures
Parallel processing (Electronic computers) -- Periodicals
Parallel computers -- Periodicals
004.35 - Journal URLs:
- http://onlinelibrary.wiley.com/ ↗
- DOI:
- 10.1002/cpe.4288 ↗
- Languages:
- English
- ISSNs:
- 1532-0626
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 3405.622000
British Library DSC - BLDSS-3PM
British Library STI - ELD Digital store - Ingest File:
- 6769.xml