Article
Refine
Year of publication
- 2020 (132) (remove)
Institute
- Fachbereich Medizintechnik und Technomathematik (44)
- IfB - Institut für Bioengineering (26)
- Fachbereich Luft- und Raumfahrttechnik (19)
- Fachbereich Wirtschaftswissenschaften (17)
- Fachbereich Energietechnik (13)
- Fachbereich Chemie und Biotechnologie (10)
- Fachbereich Elektrotechnik und Informationstechnik (10)
- Fachbereich Bauingenieurwesen (9)
- Fachbereich Maschinenbau und Mechatronik (9)
- INB - Institut für Nano- und Biotechnologien (9)
Language
- English (101)
- German (30)
- Multiple languages (1)
Document Type
- Article (132) (remove)
Keywords
- rebound-effect (2)
- sustainability (2)
- Adaptive control (1)
- Anwendungsorientierter Forschungsansatz (1)
- Biofuel (1)
- Biorefinery (1)
- Brownian Pillow (1)
- Butanol (1)
- Clostridium acetobutylicum (1)
- Conservation laws (1)
Is part of the Bibliography
- no (132)
The Rothman–Woodroofe symmetry test statistic is revisited on the basis of independent but not necessarily identically distributed random variables. The distribution-freeness if the underlying distributions are all symmetric and continuous is obtained. The results are applied for testing symmetry in a meta-analysis random effects model. The consistency of the procedure is discussed in this situation as well. A comparison with an alternative proposal from the literature is conducted via simulations. Real data are analyzed to demonstrate how the new approach works in practice.
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.
EDPB: Europäische Aufsichtsbehörden mit neuen Guidelines zur datenschutzkonformen Einwilligung
(2020)