Volltext-Downloads (blau) und Frontdoor-Views (grau)

Development and operation of elastic parallel tree search applications using TASKWORK

  • Cloud resources can be dynamically provisioned according to application-specific requirements and are payed on a per-use basis. This gives rise to a new concept for parallel processing: Elastic parallel computations. However, it is still an open research question to which extent parallel applications can benefit from elastic scaling, which requires resource adaptation at runtime and corresponding coordination mechanisms. In this work, we analyze how to address these system-level challenges in the context of developing and operating elastic parallel tree search applications. Based on our findings, we discuss the design and implementation of TASKWORK, a cloud-aware runtime system specifically designed for elastic parallel tree search, which enables the implementation of elastic applications by means of higher-level development frameworks. We show how to implement an elastic parallel branch-and-bound application based on an exemplary development framework and report on our experimental evaluation that also considers several benchmarks for parallel tree search.

Download full text files

  • 2924.pdf
    eng

Export metadata

Additional Services

Search Google Scholar

Statistics

frontdoor_oas
Metadaten
Author of HS ReutlingenKehrer, Stefan; Blochinger, Wolfgang
DOI:https://doi.org/10.1007/978-3-030-49432-2_3
ISBN:978-3-030-49432-2
Erschienen in:Cloud Computing and Services Science : 9th International Conference, CLOSER 2019, Heraklion, Crete, Greece, May 2–4, 2019, Revised Selected Papers
Publisher:Springer
Place of publication:Cham
Document Type:Conference proceeding
Language:English
Publication year:2020
Tag:branch-and-bound; cloud computing; elasticity; parallel computing; task parallelism
Page Number:24
First Page:42
Last Page:65
DDC classes:004 Informatik
Open access?:Nein
Licence (German):License Logo  In Copyright - Urheberrechtlich geschützt