A distributed bio-inspired method for multisite grid mapping

Computational grids assemble multisite and multiowner resources and represent the most promising solutions for processing distributed computationally intensive applications, each composed by a collection of communicating tasks. The execution of an application on a grid presumes three successive steps: the localization of the available resources together with their characteristics and status; the mapping which selects the resources that, during the estimated running time, better support this execution and, at last, the scheduling of the tasks. These operations are very difficult both because the availability and workload of grid resources change dynamically and because, in many cases, multisite mapping must be adopted to exploit all the possible benefits. As the mapping problem in parallel systems, already known as NP-complete, becomes even harder in distributed heterogeneous environments as in grids, evolutionary techniques can be adopted to find near-optimal solutions. In this paper an effective and efficient multisite mapping, based on a distributed Differential Evolution algorithm, is proposed. The aim is to minimize the time required to complete the execution of the application, selecting from among all the potential ones the solution which reduces the use of the grid resources. The proposed mapper is tested on different scenarios

Multi-objective scheduling of Scientific Workflows in multisite clouds

Clouds appear as appropriate infrastructures for executing Scientific Workflows (SWfs). A cloud is typically made of several sites (or data centers), each with its own resources and data. Thus, it becomes important to be able to execute some SWfs at more than one cloud site because of the geographical distribution of data or available resources among different cloud sites. Therefore, a major problem is how to execute a SWf in a multisite cloud, while reducing execution time and monetary costs. In this paper, we propose a general solution based on multi-objective scheduling in order to execute SWfs in a multisite cloud. The solution consists of a multi-objective cost model including execution time and monetary costs, a Single Site Virtual Machine (VM) Provisioning approach (SSVP) and ActGreedy, a multisite scheduling approach. We present an experimental evaluation, based on the execution of the SciEvol SWf in Microsoft Azure cloud. The results reveal that our scheduling approach significantly outperforms two adapted baseline algorithms (which we propose by adapting two existing algorithms) and the scheduling time is reasonable compared with genetic and brute-force algorithms. The results also show that our cost model is accurate and that SSVP can generate better VM provisioning plans compared with an existing approach.Work partially funded by EU H2020 Programme and MCTI/RNP-Brazil (HPC4E grant agreement number 689772), CNPq, FAPERJ, and INRIA (MUSIC project), Microsoft (ZcloudFlow project) and performed in the context of the Computational Biology Institute (www.ibc-montpellier.fr). We would like to thank Kary Ocaña for her help in modeling and executing the SciEvol SWf.Peer ReviewedPostprint (author's final draft

A Distributed Bio-Inspired Method for Multisite Grid Mapping

Computational grids assemble multisite and multiowner resources and represent the most promising solutions for processing distributed computationally intensive applications, each composed by a collection of communicating tasks. The execution of an application on a grid presumes three successive steps: the localization of the available resources together with their characteristics and status; the mapping which selects the resources that, during the estimated running time, better support this execution and, at last, the scheduling of the tasks. These operations are very difficult both because the availability and workload of grid resources change dynamically and because, in many cases, multisite mapping must be adopted to exploit all the possible benefits. As the mapping problem in parallel systems, already known as NP-complete, becomes even harder in distributed heterogeneous environments as in grids, evolutionary techniques can be adopted to find near-optimal solutions. In this paper an effective and efficient multisite mapping, based on a distributed Differential Evolution algorithm, is proposed. The aim is to minimize the time required to complete the execution of the application, selecting from among all the potential ones the solution which reduces the use of the grid resources. The proposed mapper is tested on different scenarios

Priority-grouping method for parallel multi-scheduling in Grid

With the advent in multicore computers, the scheduling of Grid jobs can be made more effective if scaled to fully utilize the underlying hardware, and parallelized to benefit from the exploitation of multicores. The fact that sequential algorithms do not scale with multicore systems nor benefit from parallelism remains a major obstacle to scheduling in the Grid. As multicore systems become ever more pervasive in our computing lives, over reliance on such systems for passive parallelism does not offer the best option in harnessing the benefits of their multiprocessors for Grid scheduling. An explicit means of exploiting parallelism for Grid scheduling is required. The Group-based Parallel Multi-scheduler, introduced in this paper, is aimed at effectively exploiting the benefits of multicore systems for Grid scheduling by splitting jobs and machines into paired groups and independently scheduling jobs in parallel from those groups. We implemented two job grouping methods, Execution Time Balanced (ETB) and Execution Time Sorted then Balanced (ETSB), and two machine grouping methods, Evenly Distributed (EvenDist) and Similar Together (SimTog). For each method, we varied the number of groups between 2, 4 and 8. We then executed the MinMin Grid scheduling algorithm independently within the groups. We demonstrated that by sharing jobs and machines into groups before scheduling, the computation time for the scheduling process drastically improved by magnitudes of 85% over the ordinary MinMin algorithm when implemented on a HPC system. We also found that our balanced group based approach achieved better results than our previous Priority based grouping approach

An Extensive Exploration of Techniques for Resource and Cost Management in Contemporary Cloud Computing Environments

Resource and cost optimization techniques in cloud computing environments target minimizing expenditure while ensuring efficient resource utilization. This study categorizes these techniques into three primary groups: Cloud and VM-focused strategies, Workflow techniques, and Resource Utilization and Efficiency techniques. Cloud and VM-focused strategies predominantly concentrate on the allocation, scheduling, and optimization of resources within cloud environments, particularly virtual machines. These strategies aim at a balance between cost reduction and adhering to specified deadlines, while ensuring scalability and adaptability to different cloud models. However, they may introduce complexities due to their dynamic nature and continuous optimization requirements. Workflow techniques emphasize the optimal execution of tasks in distributed systems. They address inconsistencies in Quality of Service (QoS) and seek to enhance the reservation process and task scheduling. By employing models, such as Integer Linear Programming, these techniques offer precision. But they might be computationally demanding, especially for extensive problems. Techniques focusing on Resource Utilization and Efficiency attempts to maximize the use of available resources in an energy-efficient and cost-effective manner. Considering factors like current energy levels and application requirements, these models aim to optimize performance without overshooting budgets. However, a continuous monitoring mechanism might be necessary, which can introduce additional complexities

Group-based parallel multi-scheduler for grid computing

With the advent in multicore computers, the scheduling of Grid jobs can be made more effective if scaled to fully utilize the underlying hardware, and parallelized to benefit from the exploitation of multicores. The fact that sequential algorithms do not scale with multicore systems nor benefit from parallelism remains a major obstacle to scheduling in the Grid. As multicore systems become ever more pervasive in our computing lives, over reliance on such systems for passive parallelism does not offer the best option in harnessing the benefits of their multiprocessors for Grid scheduling. An explicit means of exploiting parallelism for Grid scheduling is required. The Group-based Parallel Multi-scheduler, introduced in this paper, is aimed at effectively exploiting the benefits of multicore systems for Grid scheduling by splitting jobs and machines into paired groups and independently scheduling jobs in parallel from those groups. We implemented two job grouping methods, Execution Time Balanced (ETB) and Execution Time Sorted then Balanced (ETSB), and two machine grouping methods, Evenly Distributed (EvenDist) and Similar Together (SimTog). For each method, we varied the number of groups between 2, 4 and 8. We then executed the MinMin Grid scheduling algorithm independently within the groups. We demonstrated that by sharing jobs and machines into groups before scheduling, the computation time for the scheduling process drastically improved by magnitudes of 85% over the ordinary MinMin algorithm when implemented on a HPC system. We also found that our balanced group based approach achieved better results than our previous Priority based grouping approach

Multi criteria decision support system for watershed management under uncertain conditions, A

2012 Summer.Includes bibliographical references.Nonpoint source (NPS) pollution is the primary cause of impaired water bodies in the United States and around the world. Elevated nutrient, sediment, and pesticide loads to waterways may negatively impact human health and aquatic ecosystems, increasing costs of pollutant mitigation and water treatment. Control of nonpoint source pollution is achievable through implementation of conservation practices, also known as Best Management Practices (BMPs). Watershed-scale NPS pollution control plans aim at minimizing the potential for water pollution and environmental degradation at minimum cost. Simulation models of the environment play a central role in successful implementation of watershed management programs by providing the means to assess the relative contribution of different sources to the impairment and water quality impact of conservation practices. While significant shifts in climatic patterns are evident worldwide, many natural processes, including precipitation and temperature, are affected. With projected changes in climatic conditions, significant changes in diffusive transport of nonpoint source pollutants, assimilative capacity of water bodies, and landscape positions of critical areas that should be targeted for implementation of conservation practices are also expected. The amount of investment on NPS pollution control programs makes it all but vital to assure the conservation benefits of practices will be sustained under the shifting climatic paradigms and challenges for adoption of the plans. Coupling of watershed models with regional climate projections can potentially provide answers to a variety of questions on the dynamic linkage between climate and ecologic health of water resources. The overarching goal of this dissertation is to develop a new analysis framework for the development of optimal NPS pollution control strategy at the regional scale under projected future climate conditions. Proposed frameworks were applied to a 24,800 ha watershed in the Eagle Creek Watershed in central Indiana. First, a computational framework was developed for incorporation of disparate information from observed hydrologic responses at multiple locations into the calibration of watershed models. This study highlighted the use of multiobjective approaches for proper calibration of watershed models that are used for pollutant source identification and watershed management. Second, an integrated simulation-optimization approach for targeted implementation of agricultural conservation practices was presented. A multiobjective genetic algorithm (NSGA-II) with mixed discrete-continuous decision variables was used to identify optimal types and locations of conservation practices for nutrient and pesticide control. This study showed that mixed discrete-continuous optimization method identifies better solutions than commonly used binary optimization methods. Third, the conclusion from application of NSGA-II optimization followed by development of a multi criteria decision analysis framework to identify near-optimal NPS pollution control plan using a priori knowledge about the system. The results suggested that the multi criteria decision analysis framework can be an effective and efficient substitute for optimization frameworks. Fourth, the hydrologic and water quality simulations driven by an extensive ensemble of climate projections were analyzed for their respective changes in basin average temperature and precipitation. The results revealed that the water yield and pollutants transport are likely to change substantially under different climatic paradigms. And finally, impact of projected climate change on performance of conservation practice and shifts in their optimal types and locations were analyzed. The results showed that performance of NPS control plans under different climatic projections will alter substantially; however, the optimal types and locations of conservation practices remained relatively unchanged

Advanced turboprop multidisciplinary design and optimization within agile project

The present paper deals with the design, analysis and optimization of a 90 passengers turboprop aircraft with a design range of 1200 nautical miles and a cruise Mach number equal to 0.56. The prescribed aircraft is one of the use cases of the AGILE European project, aiming to provide a 3rd generation of multidisciplinary design and optimization chain, following the collaborative and remote aircraft design paradigm, through an heterogenous team of experts. The multidisciplinary aircraft design analysis is set-up involving tools provided by AGILE partners distributed worldwide and run locally from partners side. A complete design of experiment, focused on wing planform variables, is performed to build response surfaces suitable for optimization purposes. The goal of the optimization is the direct operating cost, subject to wing design variables and top-level aircraft requirements

유전 알고리즘을 이용한 다중스케일/다목적 공간계획 최적화모델 구축

학위논문 (박사)-- 서울대학교 대학원 : 환경대학원 협동과정 조경학전공, 2019. 2. 이동근.공간계획 과정에서 다양한 이해관계자와 결부된 목표와 제약 요건을 만족시키는 것은 복잡한 비선형적 문제로서 해결하기 어려운 것으로 알려져 왔다. 그러나 최근 이러한 문제에 유전 알고리즘 (genetic algorithms), 담금질 기법 (simulated annealing), 개미 군집 최적화 (ant colony optimization) 등의 다목적 최적화 알고리즘이 응용되고 있으며, 관련 연구 역시 급증하고 있다. 이 중 유전 알고리즘은 공간 최적화 부문에 가장 빈도 높게 적용된 최적화 알고리즘으로 exploration과 exploitation의 균형으로 합리적인 시간 내에 충분히 좋은 계획안을 제시할 수 있다. 그러나 공간 최적화 연구가 보여준 좋은 성과에도 불구하고 대부분의 연구가 특정 용도 혹은 시설의 배치에 집중되어 있으며, 기후변화 적응, 재해 관리, 그린인프라 계획과 같은 최근의 환경 이슈를 다룬 사례는 매우 미흡하다. 따라서 본 연구에서는 유전 알고리즘과 비지배 정렬 유전 알고리즘 (non-dominated sorting genetic algorithm II)에 기초하여 기후변화 적응, 재해 관리, 도시의 녹지 계획 등과 같은 환경 이슈를 공간계획에 반영할 수 있는 일련의 공간 최적화 모델을 제시하였다. 개별 환경 이슈에 따라 공간 해상도, 목적, 제약요건이 다르게 구성하였으며, 공간적 범위가 좁아지고 공간해상도는 높아지는 순서대로 나열하였다. 논문의 첫번째 장에서는 행정구역 도 규모 (province scale, 해상도 1㎢)에서 미래의 기후변화에 적응하기 위한 토지이용 시나리오를 모의할 수 있는 공간 최적화 모델을 제안하였다. 기후변화가 먼 미래가 아닌, 현재 이미 진행되고 있으며 관련한 다수의 피해가 관찰되고 있기 때문에 공간적 관점에서 기후변화에 대한 적응의 필요성이 지적되어 왔다. 그러나 구체적으로 기후에 대한 회복 탄력성을 향상시키기 위하여 토지이용의 공간적 구성을 어떻게 변화시켜야 할지에 대한 방법론 제시는 미흡하다. 지역계획에서 기후변화 영향을 고려한 토지이용 배분은 매우 유용한, 기본적인 중장기 적응 전략에 해당한다. 본 연구에서는 다목적 유전 알고리즘 (MOGA, multi-objective genetic algorithm)에 기초하여 9,982㎢에 350만의 인구가 거주하는 한국의 충청남도 및 대전광역시 일대를 대상으로 기후변화 적응을 위한 토지이용 시나리오를 제시하였다. 지역적인 기후변화 영향과 경제적 여건을 고려하여 재해 피해 및 전환량의 최소화, 벼 생산량, 종 풍부도 보전, 경제적 가치의 최대화 등 다섯 가지의 목적을 선택하였다. 각 목적 별 가중치를 변화시키며 여섯 가지 가중치 조합에 대한 17개의 파레토 최적 토지이용 시나리오를 생성하였다. 대부분의 시나리오는 정도의 차이는 있으나 현재의 토지이용에 비해 기후변화 적응 부분에서 더 좋은 퍼포먼스를 보였으므로, 기후변화에 대한 회복탄력성이 개선할 수 있을 것으로 판단하였다. 또한 공간 최적화 모델의 유연한 구조를 고려하였을 때, 지역의 실무자 역시 가중치와 같은 모델의 파라미터, 기후변화 영향 평가와 같은 입력자료를 변경함으로써 효율적으로 새로운 시나리오를 생성 및 선택하는 것이 가능할 것으로 예상하였다. 논문의 두 번째 장에서는 행정구역 군 규모 (local scale, 해상도 100m)에서 기후변화에 따른 재해 피해를 관리하기 위한 토지이용 시나리오를 모의할 수 있는 공간 최적화 모델을 제안하였다. 산악지형에서 폭우로 인한 산사태는 인명과 재산에 심각한 피해를 초래할 수 있는 것으로 알려져 있다. 더욱이 기후변화에 따른 강우의 변동성 증가로 이러한 산사태 빈도 및 강도 역시 증대될 것으로 예상된다. 일반적으로 산사태 리스크가 높은 지역을 피해 개발지역을 배치하는 것이 피해를 저감 혹은 회피할 수 있는 가장 효과적인 전략으로 알려져 있으나, 실제공간에서의 계획은 매우 복잡한 비선형의 문제로서 이것을 실현하는 데 어려움이 있다. 따라서 본 연구에서는 비지배 정렬 유전 알고리즘 II에 기초하여 산사태 리스크 및 전환량, 파편화의 최소화 등의 다양한 목적을 만족시키는 종합적인 토지이용 배분 계획을 제안하였다. 대상지는 2018년 동계올림픽 개최지인 한국의 평창군으로서 2006년에 산사태로 인한 대규모의 피해를 경험하였으나, 올림픽 특수 등의 개발압력으로 인한 난개발이 우려되는 지역이다. 최종적으로 한번의 모의를 통해 현재의 토지이용 보다 적어도 한가지 이상의 목적에서 좋은 퍼포먼스를 보이는 100개의 파레토 최적 계획안을 생성하였다. 또한 5개의 대표적인 계획안을 선정하여 산사태리스크 최소화와 전환량 최소화 간에 발생하는 상쇄 효과를 설명하였다. 본 연구결과는 기후변화와 관련된 공간 적응 전략의 수립, 보다 향상된 개발계획을 위한 의사결정을 효과적으로 지원할 수 있을 것으로 예상하였다. 논문의 세 번째 장에서는 블록 규모(neighborhood scale, 2m)에서 도시 내 녹지계획안을 모의할 수 있는 공간 최적화 모델을 제안하였다. 녹지 공간은 도시민의 삶의 질에 결정적인 영향을 미치기 때문에 다양한 도시 재생 및 개발계획에는 녹지와 직 간접적으로 관련된 전략이 포함된다. 녹지 공간은 도시지역 내에서 열섬 현상 완화, 유출량 저감, 생태 네트워크 증진 등 다양한 긍정적 효과가 있음이 알려져 있으나, 공간 계획의 관점에서 이러한 다양한 효과를 종합적, 정량적으로 고려된 사례는 매우 미흡하다. 따라서 본 연구에서는 비지배 정렬 유전 알고리즘 II에 기초하여 녹지의 생태적 연결성 증진, 열섬 효과 완화와 같은 다양한 효과와 설치에 따르는 비용을 종합적으로 고려하여 적절한 녹지의 유형과 위치를 결정한 녹지계획안을 제시하였다. 블록 규모의 가상의 대상지에 본 최적화 모델을 적용함으로써 30개의 파레토 최적 녹지계획안을 생성하였으며, 각 목적 간 퍼포먼스를 비교하여 녹지의 열섬 완화 효과와 생태적 연결성 증진 효과 간의 상승 관계 (synergistic relationship), 이러한 긍정적 효과와 비용 절감 간의 상쇄 효과 (trade-off relationship)를 분석하였다. 또한 다양한 계획안 중 대표적인 특성을 지니는 계획안, 다수의 계획안에서 공통적으로 녹지 설치를 위해 선택된 주요 후보지역 역시 규명하였다. 본 연구에서 제시된 모델은 계획안의 수정에서부터 정량적 평가, 계획안 선택에 이르는 일련의 긍정적인 피드백 과정을 수없이 반복함으로써 기존의 녹지계획 과정을 개선하는 데 기여할 수 있을 뿐만 아니라 모델의 결과 역시 다자간 협력적 디자인 (co-design)을 위한 초안으로서 활용될 수 있을 것으로 예상하였다.The meeting of heterogeneous goals while staying within the constraints of spatial planning is a nonlinear problem that cannot be solved by linear methodologies. Instead, this problem can be solved using multi-objective optimization algorithms such as genetic algorithms (GA), simulated annealing (SA), ant colony optimization (ACO), etc., and research related to this field has been increasing rapidly. GA, in particular, are the most frequently applied spatial optimization algorithms and are known to search for a good solution within a reasonable time period by maintaining a balance between exploration and exploitation. However, despite its good performance and applicability, it has not adequately addressed recent urgent issues such as climate change adaptation, disaster management, and green infrastructure planning. It is criticized for concentrating on only the allocation of specific land use such as urban and protected areas, or on the site selection of a specific facility. Therefore, in this study, a series of spatial optimizations are proposed to address recent urgent issues such as climate change, disaster management, and urban greening by supplementing quantitative assessment methodologies to the spatial planning process based on GA and Non-dominated Sorting Genetic Algorithm II (NSGA II). This optimization model needs to be understood as a tool for providing a draft plan that quantitatively meets the essential requirements so that the stakeholders can collaborate smoothly in the planning process. Three types of spatial planning optimization models are classified according to urgent issues. Spatial resolution, planning objectives, and constraints were also configured differently according to relevant issues. Each spatial planning optimization model was arranged in the order of increasing spatial resolution. In the first chapter, the optimization model was proposed to simulate land use scenarios to adapt to climate change on a provincial scale. As climate change is an ongoing phenomenon, many recent studies have focused on adaptation to climate change from a spatial perspective. However, little is known about how changing the spatial composition of land use could improve resilience to climate change. Consideration of climate change impacts when spatially allocating land use could be a useful and fundamental long-term adaptation strategy, particularly for regional planning. Here climate adaptation scenarios were identified on the basis of existing extents of three land use classes using Multi-objective Genetic Algorithms (MOGA) for a 9,982 km2 region with 3.5 million inhabitants in South Korea. Five objectives were selected for adaptation based on predicted climate change impacts and regional economic conditions: minimization of disaster damageand existing land use conversionmaximization of rice yieldprotection of high-species-richness areasand economic value. The 17 Pareto land use scenarios were generated by six weighted combinations of the adaptation objectives. Most scenarios, although varying in magnitude, showed better performance than the current spatial land use composition for all adaptation objectives, suggesting that some alteration of current land use patterns could increase overall climate resilience. Given the flexible structure of the optimization model, it is expected that regional stakeholders would efficiently generate other scenarios by adjusting the model parameters (weighting combinations) or replacing the input data (impact maps) and selecting a scenario depending on their preference or a number of problem-related factors. In the second chapter, the optimization model was proposed to simulate land use scenarios for managing disaster damage due to climate change on local scale. Extreme landslides triggered by rainfall in hilly regions frequently lead to serious damage, including casualties and property loss. The frequency of landslides may increase under climate change, because of the increased variability of precipitation. Developing urban areas outside landslide risk zones is the most effective method of reducing or preventing damageplanning in real life is, however, a complex and nonlinear problem. For such multi-objective problems, GA may be the most appropriate optimization tool. Therefore, comprehensive land use allocation plans were suggested using the NSGA II to overcome multi-objective problems, including the minimization of landslide risk, minimization of change, and maximization of compactness. The study area is Pyeongchang-gun, the host city of the 2018 Winter Olympics in Korea, where high development pressure has resulted in an urban sprawl into the hazard zone that experienced a large-scale landslide in 2006. We obtained 100 Pareto plans that are better than the actual land use data for at least one objective, with five plans that explain the trade-offs between meeting the first and the second objectives mentioned above. The results can be used by decision makers for better urban planning and for climate change-related spatial adaptation. In the third chapter, the optimization model was proposed to simulate urban greening plans on a neighborhood scale. Green space is fundamental to the good quality of life of residents, and therefore urban planning or improvement projects often include strategies directly or indirectly related to greening. Although green spaces generate positive effects such as cooling and reduction of rainwater runoff, and are an ecological corridor, few studies have examined the comprehensive multiple effects of greening in the urban planning context. To fill this gap in this fields literature, this study seeks to identify a planning model that determines the location and type of green cover based on its multiple effects (e.g., cooling and enhancement of ecological connectivity) and the implementation cost using NSGA II. The 30 Pareto-optimal plans were obtained by applying our model to a hypothetical landscape on a neighborhood scale. The results showed a synergistic relationship between cooling and enhancement of connectivity, as well as a trade-off relationship between greenery effects and implementation cost. It also defined critical lots for urban greening that are commonly selected in various plans. This model is expected to contribute to the improvement of existing planning processes by repeating the positive feedback loop: from plan modification to quantitative evaluation and selection of better plans. These optimal plans can also be considered as options for co-design by related stakeholders.1. INTRODUCTION 2. CHAPTER 1: Modelling Spatial Climate Change Land use Adaptation with Multi-Objective Genetic Algorithms to Improve Resilience for Rice Yield and Species Richness and to Mitigate Disaster Risk 2.1. Introduction 2.2. Study area 2.3. Methods 2.4. Results 2.5. Discussion 2.6. References 2.7. Supplemental material 3. CHAPTER 2: Multi-Objective Land-Use Allocation Considering Landslide Risk under Climate Change: Case Study in Pyeongchang-gun, Korea 3.1. Introduction 3.2. Material and Methods 3.3. Results 3.4. Discussion 3.5. Conclusion 3.6. References 4. CHAPTER 3: Multi-Objective Planning Model for Urban Greening based on Optimization Algorithms 3.1. Introduction 3.2. Methods 3.3. Results 3.4. Discussion 3.5. Conclusion 3.6. References 3.7. Appendix 5. CONCLUSION REFERENCESDocto