TY  - JOUR
A1  - Krott, Daniel
A1  - Gerhards, Michael
A1  - Skorupa, Sascha
A1  - Sander, Volker
T1  - NHiLA - Bridging the Gap Between .NET and UNICORE
JF  - UNICORE Summit 2011 : proceedings, 7-8 July 2011, Torun, Poland / Mathilde Romberg ... (Eds.)
Y1  - 2011
SN  - 9783893367504
N1  - UNICORE Summit ; (2011 ; 2011.07.07-08 ; Torun) ; Schriften des Forschungszentrums Jülich IAS Series 9
SP  - 77
EP  - 86
PB  - Forschungszentrum Jülich
CY  - Jülich
ER  - 
TY  - JOUR
A1  - Gerhards, Michael
A1  - Sander, Volker
A1  - Zivkovic, Miroslav
A1  - Belloum, Adam
A1  - Bubak, Marian
T1  - New approach to allocation planning of many‐task workflows on clouds
JF  - Concurrency and Computation: Practice and Experience
N2  - Experience has shown that a priori created static resource allocation plans are vulnerable to runtime deviations and hence often become uneconomic or highly exceed a predefined soft deadline. The assumption of constant task execution times during allocation planning is even more unlikely in a cloud environment where virtualized resources vary in performance. Revising the initially created resource allocation plan at runtime allows the scheduler to react on deviations between planning and execution. Such an adaptive rescheduling of a many-task application workflow is only feasible, when the planning time can be handled efficiently at runtime. In this paper, we present the static low-complexity resource allocation planning algorithm (LCP) applicable to efficiently schedule many-task scientific application workflows on cloud resources of different capabilities. The benefits of the presented algorithm are benchmarked against alternative approaches. The benchmark results show that LCP is not only able to compete against higher complexity algorithms in terms of planned costs and planned makespan but also outperforms them significantly by magnitudes of 2 to 160 in terms of required planning time. Hence, LCP is superior in terms of practical usability where low planning time is essential such as in our targeted online rescheduling scenario.
Y1  - 2020
U6  - http://dx.doi.org/10.1002/cpe.5404
SN  - 1532-0634
VL  - 32
IS  - 2 Article e5404
SP  - 1
EP  - 16
PB  - Wiley
CY  - Chichester
ER  - 
TY  - CHAP
A1  - Gerhards, Michael
A1  - Sander, Volker
A1  - Belloum, Adam
ED  - Zimmermann, Wolf
ED  - Lee, Yong Woo
ED  - Demchenko, Yuri
T1  - About the flexible Migration of Workflow Tasks to Clouds : Combining on- and off-premise Executions of Applications
T2  - CLOUD COMPUTING 2012 : The Third International Conference on Cloud Computing, GRIDs, and Virtualization ; July 22-27, 2012 - Nice, France
N2  - An increasing number of applications target their executions on specific hardware like general purpose Graphics Processing Units. Some Cloud Computing providers offer this specific hardware so that organizations can rent such resources. However, outsourcing the whole application to the Cloud causes avoidable costs if only some parts of the application benefit from the specific expensive hardware. A partial execution of applications in the Cloud is a tradeoff between costs and efficiency. This paper addresses the demand for a consistent framework that allows for a mixture of on- and off-premise calculations by migrating only specific parts to a Cloud. It uses the concept of workflows to present how individual workflow tasks can be migrated to the Cloud whereas the remaining tasks are executed on-premise.
KW  - Workflow Orchestration
KW  - Workflow
KW  - Grid Computing
KW  - Cloud Service Broker
KW  - Cloud Computing
Y1  - 2012
SN  - 978-1-61208-216-5
SP  - 82
EP  - 87
PB  - IARIA Journals
ER  - 
TY  - CHAP
A1  - Gerhards, Michael
A1  - Sander, Volker
A1  - Belloum, Adam
T1  - Seamlessly enabling the use of cloud resources in workflows
T2  - Cloud Computing 2013 : The Fourth International Conference on Cloud Computing, GRIDs, and Virtualization : May 27 - June 1, 2013 - Valencia, Spain
Y1  - 2013
SN  - 978-1-61208-271-4
SP  - 108
EP  - 114
PB  - Curren
CY  - Red Hook, NY
ER  -