Refine
Year of publication
- 2020 (241) (remove)
Institute
- Fachbereich Medizintechnik und Technomathematik (59)
- Fachbereich Energietechnik (35)
- Fachbereich Wirtschaftswissenschaften (35)
- Fachbereich Luft- und Raumfahrttechnik (33)
- IfB - Institut für Bioengineering (33)
- Fachbereich Elektrotechnik und Informationstechnik (29)
- ECSM European Center for Sustainable Mobility (18)
- Fachbereich Maschinenbau und Mechatronik (17)
- Fachbereich Bauingenieurwesen (14)
- Solar-Institut Jülich (14)
Language
- English (171)
- German (68)
- Multiple languages (1)
- Dutch (1)
Document Type
- Article (132)
- Conference Proceeding (55)
- Part of a Book (19)
- Book (9)
- Review (7)
- Other (4)
- Doctoral Thesis (3)
- Patent (3)
- Administrative publication (3)
- Conference Poster (2)
Keywords
- Amtliche Mitteilung (3)
- MINLP (3)
- Additive manufacturing (2)
- Adjacent buildings (2)
- Experimental validation (2)
- Historical centres (2)
- INODIS (2)
- SIJ (2)
- Shake table test (2)
- Solar-Institut Jülich (2)
Is part of the Bibliography
- no (241)
This paper primarily presents an aerodynamic CFD analysis of a winged spaceplane geometry based on the Japanese Space Walker proposal. StarCCM was used to calculate aerodynamic coefficients for a typical space flight trajectory including super-, trans- and subsonic Mach numbers and two angles of attack. Since the solution of the RANS equations in such supersonic flight regimes is still computationally expensive, inviscid Euler simulations can principally lead to a significant reduction in computational effort. The impact on accuracy of aerodynamic properties is further analysed by comparing both methods for different flight regimes up to a Mach number of 4.
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.