scholarly journals A Two-Stage Fault Tolerance Method for Large-Scale Manufacturing Network

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 81574-81592 ◽  
Author(s):  
Yinan Wu ◽  
Gongzhuang Peng ◽  
Hongwei Wang ◽  
Heming Zhang
Keyword(s):  
Fault Tolerance ◽  
Large Scale ◽  
Two Stage ◽  
Manufacturing Network ◽  
Tolerance Method

scholarly journals A Replication-Based Mechanism for Fault Tolerance in MapReduce Framework

2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Yang Liu ◽  
Wei Wei
Keyword(s):  
Fault Tolerance ◽  
Large Scale ◽  
Failure Time ◽  
Programming Model ◽  
Large Data ◽  
Distributed Data ◽  
Mapreduce Framework ◽  
Single Node ◽  
Node Failure ◽  
Tolerance Method

MapReduce is a programming model and an associated implementation for processing and generating large data sets with a parallel, distributed algorithm on a cluster. In cloud environment, node and task failure are no longer accidental but a common feature of large-scale systems. Current rescheduling-based fault tolerance method in MapReduce framework failed to fully consider the location of distributed data and the computation and storage overhead of rescheduling failure tasks. Thus, a single node failure will increase the completion time dramatically. In this paper, a replication-based mechanism is proposed, which takes both task and node failure into consideration. Experimental results show that, compared with default mechanism in Hadoop, our mechanism can significantly improve the performance at failure time, with more than 30% decreasing in execution time.

scholarly journals Two-stage multi-tasking transform framework for large-scale many-objective optimization problems

2021 ◽  
Author(s):  
Lu Chen ◽  
Handing Wang ◽  
Wenping Ma
Keyword(s):  
Large Scale ◽  
Original Problem ◽  
Optimization Problems ◽  
Reference Points ◽  
Optimization Strategy ◽  
Two Stage ◽  
Decision Space ◽  
Second Stage ◽  
Decision Variables ◽  
Objective Space

AbstractReal-world optimization applications in complex systems always contain multiple factors to be optimized, which can be formulated as multi-objective optimization problems. These problems have been solved by many evolutionary algorithms like MOEA/D, NSGA-III, and KnEA. However, when the numbers of decision variables and objectives increase, the computation costs of those mentioned algorithms will be unaffordable. To reduce such high computation cost on large-scale many-objective optimization problems, we proposed a two-stage framework. The first stage of the proposed algorithm combines with a multi-tasking optimization strategy and a bi-directional search strategy, where the original problem is reformulated as a multi-tasking optimization problem in the decision space to enhance the convergence. To improve the diversity, in the second stage, the proposed algorithm applies multi-tasking optimization to a number of sub-problems based on reference points in the objective space. In this paper, to show the effectiveness of the proposed algorithm, we test the algorithm on the DTLZ and LSMOP problems and compare it with existing algorithms, and it outperforms other compared algorithms in most cases and shows disadvantage on both convergence and diversity.

scholarly journals Combined Aggregated Sampling Stochastic Dynamic Programming and Simulation-Optimization to Derive Operation Rules for Large-Scale Hydropower System

Energies ◽  
2021 ◽  
Vol 14 (3) ◽  
pp. 625
Author(s):  
Xinyu Wu ◽  
Rui Guo ◽  
Xilong Cheng ◽  
Chuntian Cheng
Keyword(s):  
Dynamic Programming ◽  
Stochastic Dynamic Programming ◽  
Large Scale ◽  
Simulation Optimization ◽  
Optimal Operation ◽  
Stochastic Dynamic ◽  
Operation Model ◽  
Two Stage ◽  
Operation Rules ◽  
Reservoir Systems

Simulation-optimization methods are often used to derive operation rules for large-scale hydropower reservoir systems. The solution of the simulation-optimization models is complex and time-consuming, for many interconnected variables need to be optimized, and the objective functions need to be computed through simulation in many periods. Since global solutions are seldom obtained, the initial solutions are important to the solution quality. In this paper, a two-stage method is proposed to derive operation rules for large-scale hydropower systems. In the first stage, the optimal operation model is simplified and solved using sampling stochastic dynamic programming (SSDP). In the second stage, the optimal operation model is solved by using a genetic algorithm, taking the SSDP solution as an individual in the initial population. The proposed method is applied to a hydropower system in Southwest China, composed of cascaded reservoir systems of Hongshui River, Lancang River, and Wu River. The numerical result shows that the two-stage method can significantly improve the solution in an acceptable solution time.

scholarly journals A Compound Wind Power Forecasting Strategy Based on Clustering, Two-Stage Decomposition, Parameter Optimization, and Optimal Combination of Multiple Machine Learning Approaches

Energies ◽  
2019 ◽  
Vol 12 (18) ◽  
pp. 3586 ◽  
Author(s):  
Sizhou Sun ◽  
Jingqi Fu ◽  
Ang Li
Keyword(s):  
Wind Power ◽  
Large Scale ◽  
Wind Farm ◽  
Search Algorithm ◽  
Interpolation Method ◽  
Least Square ◽  
Support Vector ◽  
Two Stage ◽  
Wind Power Forecasting ◽  
Power Forecasting

Given the large-scale exploitation and utilization of wind power, the problems caused by the high stochastic and random characteristics of wind speed make researchers develop more reliable and precise wind power forecasting (WPF) models. To obtain better predicting accuracy, this study proposes a novel compound WPF strategy by optimal integration of four base forecasting engines. In the forecasting process, density-based spatial clustering of applications with noise (DBSCAN) is firstly employed to identify meaningful information and discard the abnormal wind power data. To eliminate the adverse influence of the missing data on the forecasting accuracy, Lagrange interpolation method is developed to get the corrected values of the missing points. Then, the two-stage decomposition (TSD) method including ensemble empirical mode decomposition (EEMD) and wavelet transform (WT) is utilized to preprocess the wind power data. In the decomposition process, the empirical wind power data are disassembled into different intrinsic mode functions (IMFs) and one residual (Res) by EEMD, and the highest frequent time series IMF1 is further broken into different components by WT. After determination of the input matrix by a partial autocorrelation function (PACF) and normalization into [0, 1], these decomposed components are used as the input variables of all the base forecasting engines, including least square support vector machine (LSSVM), wavelet neural networks (WNN), extreme learning machine (ELM) and autoregressive integrated moving average (ARIMA), to make the multistep WPF. To avoid local optima and improve the forecasting performance, the parameters in LSSVM, ELM, and WNN are tuned by backtracking search algorithm (BSA). On this basis, BSA algorithm is also employed to optimize the weighted coefficients of the individual forecasting results that produced by the four base forecasting engines to generate an ensemble of the forecasts. In the end, case studies for a certain wind farm in China are carried out to assess the proposed forecasting strategy.

Large-Scale Simulation of the Clocking Impact of 2D Combustor Profile on a Two Stage High Pressure Turbine

2014 ◽  
Author(s):  
Thomas E. Dyson ◽  
David B. Helmer ◽  
James A. Tallman
Keyword(s):  
High Pressure ◽  
Large Scale ◽  
High Pressure Turbine ◽  
Cfd Simulations ◽  
Two Stage ◽  
Substantial Impact ◽  
Sliding Mesh ◽  
Wall Flow ◽  
End Wall ◽  
Film Flows

This paper presents sliding-mesh unsteady CFD simulations of high-pressure turbine sections of a modern aviation engine in an extension of previously presented work [1]. The simulation included both the first and second stages of a two-stage high-pressure turbine. Half-wheel domains were used, with source terms representing purge and film flows. The end-wall flow-path cavities were incorporated in the domain to a limited extent. The passage-to-passage variation in thermal predictions was compared for a 1D and 2D turbine inlet boundary condition. Substantial impact was observed on both first and second stage vanes despite the mixing from the first stage blade. Qualitative and quantitative differences in surface temperature distributions were observed due to different ratios between airfoil counts in the two domains.

Research and Design of the Distributed Mass Small File Storage System Based on WCF

2013 ◽  
Vol 765-767 ◽  
pp. 1087-1091
Author(s):  
Hong Lin ◽  
Shou Gang Chen ◽  
Bao Hui Wang
Keyword(s):  
Fault Tolerance ◽  
Distributed Computing ◽  
Data Storage ◽  
Large Scale ◽  
Storage System ◽  
Hardware Platform ◽  
File Storage ◽  
Computing Framework ◽  
Research And Design ◽  
Small File

Recently, with the development of Internet and the coming of new application modes, data storage has some new characters and new requirements. In this paper, a Distributed Computing Framework Mass Small File storage System (For short:Dnet FS) based on Windows Communication Foundation in .Net platform is presented, which is lightweight, good-expansibility, running in cheap hardware platform, supporting Large-scale concurrent access, and having certain fault-tolerance. The framework of this system is analyzed and the performance of this system is tested and compared. All of these prove this system meet requirements.

Fast two-stage phasing of large-scale sequence data

2021 ◽  
Author(s):  
Brian L. Browning ◽  
Xiaowen Tian ◽  
Ying Zhou ◽  
Sharon R. Browning
Keyword(s):  
Large Scale ◽  
Sequence Data ◽  
Two Stage ◽  
Scale Sequence

A Novel Approach for Two-Stage UAV Path Planning in Pipeline Network Inspection

2020 ◽  
Author(s):  
Rui Qiu ◽  
Yongtu Liang
Keyword(s):  
Path Planning ◽  
Large Scale ◽  
Flight Path ◽  
Mixed Integer ◽  
Optimization Approach ◽  
Two Stage ◽  
Calculation Time ◽  
Pipeline Network ◽  
Second Stage ◽  
Computational Performance

Abstract Currently, unmanned aerial vehicle (UAV) provides the possibility of comprehensive coverage and multi-dimensional visualization of pipeline monitoring. Encouraged by industry policy, research on UAV path planning in pipeline network inspection has emerged. The difficulties of this issue lie in strict operational requirements, variable flight missions, as well as unified optimization for UAV deployment and real-time path planning. Meanwhile, the intricate structure and large scale of the pipeline network further complicate this issue. At present, there is still room to improve the practicality and applicability of the mathematical model and solution strategy. Aiming at this problem, this paper proposes a novel two-stage optimization approach for UAV path planning in pipeline network inspection. The first stage is conventional pre-flight planning, where the requirement for optimality is higher than calculation time. Therefore, a mixed integer linear programming (MILP) model is established and solved by the commercial solver to obtain the optimal UAV number, take-off location and detailed flight path. The second stage is re-planning during the flight, taking into account frequent pipeline accidents (e.g. leaks and cracks). In this stage, the flight path must be timely rescheduled to identify specific hazardous locations. Thus, the requirement for calculation time is higher than optimality and the genetic algorithm is used for solution to satisfy the timeliness of decision-making. Finally, the proposed method is applied to the UAV inspection of a branched oil and gas transmission pipeline network with 36 nodes and the results are analyzed in detail in terms of computational performance. In the first stage, compared to manpower inspection, the total cost and time of UAV inspection is decreased by 54% and 56% respectively. In the second stage, it takes less than 1 minute to obtain a suboptimal solution, verifying the applicability and superiority of the method.

Sign in / Sign up

Export Citation Format

Share Document