High computational performance is extremely important for climate system models, especially in ultra-high-resolution model development. In this study, the computational performance of the Finite-volume Atmospheric Mod...High computational performance is extremely important for climate system models, especially in ultra-high-resolution model development. In this study, the computational performance of the Finite-volume Atmospheric Model of the IAP/LASG （FAMIL） was comprehensively evaluated on Tianhe-2, which was the world＇s top-ranked supercomputer from June 2013 to May 2016. The standardized Atmospheric Model Inter-comparison Project （AMIP） type of experiment was carried out that focused on the computational performance of each node as well as the simulation year per day （SYPD）, the running cost speedup, and the scalability of the FAMIL. The results indicated that （1） based on five indexes （CPU usage, percentage of CPU kernel mode that occupies CPU time and of message passing waiting time （CPU SW）, code vectorization （VEC）, average of Gflops （Gflops_ AVE）, and peak of Gflops （Gflops_PK））, FAMIL shows excellent computational performance on every Tianhe-2 computing node; （2） considering SYPD and the cost speedup of FAMIL systematically, the optimal Message Passing Interface （MPI） numbers of processors （MNPs） choice appears when FAMIL use 384 and 1536 MNPs for C96 （100 km） and C384 （25 km）, respectively; and （3） FAMIL shows positive scalability with increased threads to drive the model. Considering the fast network speed and acceleration card in the MIC architecture on Tianhe-2, there is still significant room to improve the computational performance of FAMIL.展开更多
A new direct method for solving unsymmetrical sparse linear systems（USLS） arising from meshless methods was introduced. Computation of certain meshless methods such as meshless local Petrov-Galerkin （MLPG） method ...A new direct method for solving unsymmetrical sparse linear systems（USLS） arising from meshless methods was introduced. Computation of certain meshless methods such as meshless local Petrov-Galerkin （MLPG） method need to solve large USLS. The proposed solution method for unsymmetrical case performs factorization processes symmetrically on the upper and lower triangular portion of matrix, which differs from previous work based on general unsymmetrical process, and attains higher performance. It is shown that the solution algorithm for USLS can be simply derived from the existing approaches for the symmetrical case. The new matrix factorization algorithm in our method can be implemented easily by modifying a standard JKI symmetrical matrix factorization code. Multi-blocked out-of-core strategies were also developed to expand the solution scale. The approach convincingly increases the speed of the solution process, which is demonstrated with the numerical tests.展开更多
Various parameters can be integrated in material-based computational design in architecture.Materials are the main driver of these processes and evaluated with the constraints related to the form,performance,and fabri...Various parameters can be integrated in material-based computational design in architecture.Materials are the main driver of these processes and evaluated with the constraints related to the form,performance,and fabrication techniques.However,current methodologies mostly involve investigating already existing materials.Studies on computational material design,in which new materials are developed by designing their microstructures in response to the performative issues,are generally undertaken at the material scale,and not adopted to the architectural design process yet.To resolve this issue,the methodology titled Interscalable Material Microstructure Organization in Performance-based Computational Design(I2MO_PCD)is developed and presented in three stages,including(1)identification of different types of material microstructures,(2)computational material design,and(3)prototyping.Data-based material modelling and visualization,and algorithmic modelling techniques are utilized,followed by various performance simulations as a part of an iterative process.New microstructure organizations are designed computationally,organized under three main groups as linear-curvilinear,crystal and metaball-voronoi.The outcomes of different performance analyses,including structure,radiation,direct sun hours,acoustics and thermal bridge were compared.Thus,the role of geometrical organization of microstructures,scales and material types in different performance computations were identified,by designing and fabricating synthetic materials.展开更多
In the previous papers, a high performance sparse static solver with two-level unrolling based on a cell-sparse storage scheme was reported. Although the solver reaches quite a high efficiency for a big percentage of ...In the previous papers, a high performance sparse static solver with two-level unrolling based on a cell-sparse storage scheme was reported. Although the solver reaches quite a high efficiency for a big percentage of finite element analysis benchmark tests, the MFLOPS （million floating operations per second） of LDL^T factorization of benchmark tests vary on a Dell Pentium IV 850 MHz machine from 100 to 456 depending on the average size of the super-equations, i.e., on the average depth of unrolling. In this paper, a new sparse static solver with two-level unrolling that employs the concept of master-equations and searches for an appropriate depths of unrolling is proposed. The new solver provides higher MFLOPS for LDL^T factorization of benchmark tests, and therefore speeds up the solution process.展开更多
Further improving the railway innovation capacity and technological strength is the important goal of the 14th Five-Year Plan for railway scientific and technological innovation.It includes promoting the deep integrat...Further improving the railway innovation capacity and technological strength is the important goal of the 14th Five-Year Plan for railway scientific and technological innovation.It includes promoting the deep integration of cutting-edge technologies with the railway systems,strengthening the research and application of intelligent railway technologies,applying green computing technologies and advancing the collaborative sharing of transportation big data.The high-speed rail system tasks need to process huge amounts of data and heavy workload with the requirement of ultra-fast response.Therefore,it is of great necessity to promote computation efficiency by applying High Performance Computing(HPC)to high-speed rail systems.The HPC technique is a great solution for improving the performance,efficiency,and safety of high-speed rail systems.In this review,we introduce and analyze the application research of high performance computing technology in the field of highspeed railways.These HPC applications are cataloged into four broad categories,namely:fault diagnosis,network and communication,management system,and simulations.Moreover,challenges and issues to be addressed are discussed and further directions are suggested.展开更多
Cloud computing technology is changing the development and usage patterns of IT infrastructure and applications. Virtualized and distributed systems as well as unified management and scheduling has greatly im proved c...Cloud computing technology is changing the development and usage patterns of IT infrastructure and applications. Virtualized and distributed systems as well as unified management and scheduling has greatly im proved computing and storage. Management has become easier, andOAM costs have been significantly reduced. Cloud desktop technology is develop ing rapidly. With this technology, users can flexibly and dynamically use virtual ma chine resources, companies＇ efficiency of using and allocating resources is greatly improved, and information security is ensured. In most existing virtual cloud desk top solutions, computing and storage are bound together, and data is stored as im age files. This limits the flexibility and expandability of systems and is insufficient for meetinz customers＇ requirements in different scenarios.展开更多
This paper proposes algorithm for Increasing Virtual Machine Security Strategy in Cloud Computing computations.Imbalance between load and energy has been one of the disadvantages of old methods in providing server and...This paper proposes algorithm for Increasing Virtual Machine Security Strategy in Cloud Computing computations.Imbalance between load and energy has been one of the disadvantages of old methods in providing server and hosting,so that if two virtual severs be active on a host and energy load be more on a host,it would allocated the energy of other hosts(virtual host)to itself to stay steady and this option usually leads to hardware overflow errors and users dissatisfaction.This problem has been removed in methods based on cloud processing but not perfectly,therefore,providing an algorithm not only will implement a suitable security background but also it will suitably divide energy consumption and load balancing among virtual severs.The proposed algorithm is compared with several previously proposed Security Strategy including SC-PSSF,PSSF and DEEAC.Comparisons show that the proposed method offers high performance computing,efficiency and consumes lower energy in the network.展开更多
Today the PC class machines are quite popular for HPC area, especially on the problemsthat require the good cost/performance ratios. One of the drawback of these machines is the poormemory throughput performance. And ...Today the PC class machines are quite popular for HPC area, especially on the problemsthat require the good cost/performance ratios. One of the drawback of these machines is the poormemory throughput performance. And one of the reasons of the poor performance is depend on the lack of the mapping capability of the TLB which is a buffer to accelerate the virtual memory access. In this report, I present that the mapping capability and the performance can be improved with the multi granularity TLB feature that some processors have. And I also present that the new TLB handling routine can be incorporated into the demand paging system of Linux.展开更多
This paper analyzes the physical potential, computing performance benefi t and power consumption of optical interconnects. Compared with electrical interconnections, optical ones show undoubted advantages based on phy...This paper analyzes the physical potential, computing performance benefi t and power consumption of optical interconnects. Compared with electrical interconnections, optical ones show undoubted advantages based on physical factor analysis. At the same time, since the recent developments drive us to think about whether these optical interconnect technologies with higher bandwidth but higher cost are worthy to be deployed, the computing performance comparison is performed. To meet the increasing demand of large-scale parallel or multi-processor computing tasks, an analytic method to evaluate parallel computing performance ofinterconnect systems is proposed in this paper. Both bandwidth-limit model and full-bandwidth model are under our investigation. Speedup and effi ciency are selected to represent the parallel performance of an interconnect system. Deploying the proposed models, we depict the performance gap between the optical and electrically interconnected systems. Another investigation on power consumption of commercial products showed that if the parallel interconnections are deployed, the unit power consumption will be reduced. Therefore, from the analysis of computing influence and power dissipation, we found that parallel optical interconnect is valuable combination of high performance and low energy consumption. Considering the possible data center under construction, huge power could be saved if parallel optical interconnects technologies are used.展开更多
Aeroacoustic performance of fans is essential due to their widespread application. Therefore, the original aim of this paper is to evaluate the generated noise owing to different geometric parameters. In current study...Aeroacoustic performance of fans is essential due to their widespread application. Therefore, the original aim of this paper is to evaluate the generated noise owing to different geometric parameters. In current study, effect of five geometric parameters was investigated on well performance of a Bladeless fan. Airflow through this fan was analyzed simulating a Bladeless fan within a 2 m×2 m×4 m room. Analysis of the flow field inside the fan and evaluating its performance were obtained by solving conservations of mass and momentum equations for aerodynamic investigations and FW-H noise equations for aeroacoustic analysis. In order to design Bladeless fan Eppler 473 airfoil profile was used as the cross section of this fan. Five distinct parameters, namely height of cross section of the fan, outlet angle of the flow relative to the fan axis, thickness of airflow outlet slit, hydraulic diameter and aspect ratio for circular and quadratic cross sections were considered. Validating acoustic code results, we compared numerical solution of FW-H noise equations for NACA0012 with experimental results. FW-H model was selected to predict the noise generated by the Bladeless fan as the numerical results indicated a good agreement with experimental ones for NACA0012. To validate 3-D numerical results, the experimental results of a round jet showed good agreement with those simulation data. In order to indicate the effect of each mentioned parameter on the fan performance, SPL and OASPL diagrams were illustrated.展开更多
In recent years, the widespread adoption of parallel computing, especially in multi-core processors and high-performance computing environments, ushered in a new era of efficiency and speed. This trend was particularl...In recent years, the widespread adoption of parallel computing, especially in multi-core processors and high-performance computing environments, ushered in a new era of efficiency and speed. This trend was particularly noteworthy in the field of image processing, which witnessed significant advancements. This parallel computing project explored the field of parallel image processing, with a focus on the grayscale conversion of colorful images. Our approach involved integrating OpenMP into our framework for parallelization to execute a critical image processing task: grayscale conversion. By using OpenMP, we strategically enhanced the overall performance of the conversion process by distributing the workload across multiple threads. The primary objectives of our project revolved around optimizing computation time and improving overall efficiency, particularly in the task of grayscale conversion of colorful images. Utilizing OpenMP for concurrent processing across multiple cores significantly reduced execution times through the effective distribution of tasks among these cores. The speedup values for various image sizes highlighted the efficacy of parallel processing, especially for large images. However, a detailed examination revealed a potential decline in parallelization efficiency with an increasing number of cores. This underscored the importance of a carefully optimized parallelization strategy, considering factors like load balancing and minimizing communication overhead. Despite challenges, the overall scalability and efficiency achieved with parallel image processing underscored OpenMP’s effectiveness in accelerating image manipulation tasks.展开更多
GPU computing is expected to play an integral part in all modern Exascale supercomputers.It is also expected that higher order Godunov schemes will make up about a significant fraction of the application mix on such s...GPU computing is expected to play an integral part in all modern Exascale supercomputers.It is also expected that higher order Godunov schemes will make up about a significant fraction of the application mix on such supercomputers.It is,therefore,very important to prepare the community of users of higher order schemes for hyperbolic PDEs for this emerging opportunity.Not every algorithm that is used in the space-time update of the solution of hyperbolic PDEs will take well to GPUs.However,we identify a small core of algorithms that take exceptionally well to GPU computing.Based on an analysis of available options,we have been able to identify weighted essentially non-oscillatory(WENO)algorithms for spatial reconstruction along with arbitrary derivative(ADER)algorithms for time extension followed by a corrector step as the winning three-part algorithmic combination.Even when a winning subset of algorithms has been identified,it is not clear that they will port seamlessly to GPUs.The low data throughput between CPU and GPU,as well as the very small cache sizes on modern GPUs,implies that we have to think through all aspects of the task of porting an application to GPUs.For that reason,this paper identifies the techniques and tricks needed for making a successful port of this very useful class of higher order algorithms to GPUs.Application codes face a further challenge—the GPU results need to be practically indistinguishable from the CPU results—in order for the legacy knowledge bases embedded in these applications codes to be preserved during the port of GPUs.This requirement often makes a complete code rewrite impossible.For that reason,it is safest to use an approach based on OpenACC directives,so that most of the code remains intact(as long as it was originally well-written).This paper is intended to be a one-stop shop for anyone seeking to make an OpenACC-based port of a higher order Godunov scheme to GPUs.We focus on three broad and high-impact areas where higher order Godunov schemes are used.The first area is computational fluid dynamics(CFD).The second is computational magnetohydrodynamics(MHD)which has an involution constraint that has to be mimetically preserved.The third is computational electrodynamics(CED)which has involution constraints and also extremely stiff source terms.Together,these three diverse uses of higher order Godunov methodology,cover many of the most important applications areas.In all three cases,we show that the optimal use of algorithms,techniques,and tricks,along with the use of OpenACC,yields superlative speedups on GPUs.As a bonus,we find a most remarkable and desirable result:some higher order schemes,with their larger operations count per zone,show better speedup than lower order schemes on GPUs.In other words,the GPU is an optimal stratagem for overcoming the higher computational complexities of higher order schemes.Several avenues for future improvement have also been identified.A scalability study is presented for a real-world application using GPUs and comparable numbers of high-end multicore CPUs.It is found that GPUs offer a substantial performance benefit over comparable number of CPUs,especially when all the methods designed in this paper are used.展开更多
The integration of clusters,grids,clouds,edges and other computing platforms result in contemporary technology of jungle computing.This novel technique has the aptitude to tackle high performance computation systems a...The integration of clusters,grids,clouds,edges and other computing platforms result in contemporary technology of jungle computing.This novel technique has the aptitude to tackle high performance computation systems and it manages the usage of all computing platforms at a time.Federated learning is a collaborative machine learning approach without centralized training data.The proposed system effectively detects the intrusion attack without human intervention and subsequently detects anomalous deviations in device communication behavior,potentially caused by malicious adversaries and it can emerge with new and unknown attacks.The main objective is to learn overall behavior of an intruder while performing attacks to the assumed target service.Moreover,the updated system model is send to the centralized server in jungle computing,to detect their pattern.Federated learning greatly helps the machine to study the type of attack from each device and this technique paves a way to complete dominion over all malicious behaviors.In our proposed work,we have implemented an intrusion detection system that has high accuracy,low False Positive Rate(FPR)scalable,and versatile for the jungle computing environment.The execution time taken to complete a round is less than two seconds,with an accuracy rate of 96%.展开更多
The high-performance computing paradigm needs high-speed switching fabrics to meet the heavy traffic generated by their applications.These switching fabrics are efficiently driven by the deployed scheduling algorithms...The high-performance computing paradigm needs high-speed switching fabrics to meet the heavy traffic generated by their applications.These switching fabrics are efficiently driven by the deployed scheduling algorithms.In this paper,we proposed two scheduling algorithms for input queued switches whose operations are based on ranking procedures.At first,we proposed a Simple 2-Bit(S2B)scheme which uses binary ranking procedure and queue size for scheduling the packets.Here,the Virtual Output Queue(VOQ)set with maximum number of empty queues receives higher rank than other VOQ’s.Through simulation,we showed S2B has better throughput performance than Highest Ranking First(HRF)arbitration under uniform,and non-uniform traffic patterns.To further improve the throughput-delay performance,an Enhanced 2-Bit(E2B)approach is proposed.This approach adopts an integer representation for rank,which is the number of empty queues in a VOQ set.The simulation result shows E2B outperforms S2B and HRF scheduling algorithms with maximum throughput-delay performance.Furthermore,the algorithms are simulated under hotspot traffic and E2B proves to be more efficient.展开更多
In this paper, a brief survey of smart citiy projects in Europe is presented. This survey shows the extent of transport and logistics in smart cities. We concentrate on a smart city project we have been working on tha...In this paper, a brief survey of smart citiy projects in Europe is presented. This survey shows the extent of transport and logistics in smart cities. We concentrate on a smart city project we have been working on that is related to A Logistic Mobile Application （ALMA）. The application is based on Internet of Things and combines a communication infrastructure and a High Performance Computing infrastructure in order to deliver mobile logistic services with high quality of service and adaptation to the dynamic nature of logistic operations.展开更多
Parallel vector buffer analysis approaches can be classified into 2 types:algorithm-oriented parallel strategy and the data-oriented parallel strategy.These methods do not take its applicability on the existing geogra...Parallel vector buffer analysis approaches can be classified into 2 types:algorithm-oriented parallel strategy and the data-oriented parallel strategy.These methods do not take its applicability on the existing geographic information systems(GIS)platforms into consideration.In order to address the problem,a spatial decomposition approach for accelerating buffer analysis of vector data is proposed.The relationship between the number of vertices of each feature and the buffer analysis computing time is analyzed to generate computational intensity transformation functions(CITFs).Then,computational intensity grids(CIGs)of polyline and polygon are constructed based on the relative CITFs.Using the corresponding CIGs,a spatial decomposition method for parallel buffer analysis is developed.Based on the computational intensity of the features and the sub-domains generated in the decomposition,the features are averagely assigned within the sub-domains into parallel buffer analysis tasks for load balance.Compared with typical regular domain decomposition methods,the new approach accomplishes greater balanced decomposition of computational intensity for parallel buffer analysis and achieves near-linear speedups.展开更多
A new approach for the implementation of variogram models and ordinary kriging using the R statistical language, in conjunction with Fortran, the MPI （Message Passing Interface）, and the ＂pbdDMAT＂ package within R...A new approach for the implementation of variogram models and ordinary kriging using the R statistical language, in conjunction with Fortran, the MPI （Message Passing Interface）, and the ＂pbdDMAT＂ package within R on the Bridges and Stampede Supercomputers will be described. This new technique has led to great improvements in timing as compared to those in R alone, or R with C and MPI. These improvements include processing and forecasting vectors of size 25,000 in an average time of 6 minutes on the Stampede Supercomputer and 2.5 minutes on the Bridges Supercomputer as compared to previous processing times of 3.5 hours.展开更多
In this paper we study the computational performance of variants of an algebraic additive Schwarz preconditioner for the Schur complement for the solution of large sparse linear systems.In earlier works,the local Schu...In this paper we study the computational performance of variants of an algebraic additive Schwarz preconditioner for the Schur complement for the solution of large sparse linear systems.In earlier works,the local Schur complements were computed exactly using a sparse direct solver.The robustness of the preconditioner comes at the price of this memory and time intensive computation that is the main bottleneck of the approach for tackling huge problems.In this work we investigate the use of sparse approximation of the dense local Schur complements.These approximations are computed using a partial incomplete LU factorization.Such a numerical calculation is the core of the multi-level incomplete factorization such as the one implemented in pARMS. The numerical and computing performance of the new numerical scheme is illustrated on a set of large 3D convection-diffusion problems;preliminary experiments on linear systems arising from structural mechanics are also reported.展开更多
The aim of this paper is to test a developed SOR R＆B method using the Chebyshev accelerator algorithm to solve the Laplace equation in a cubic 3D configuration. Comparisons are made in terms of precision and computin...The aim of this paper is to test a developed SOR R＆B method using the Chebyshev accelerator algorithm to solve the Laplace equation in a cubic 3D configuration. Comparisons are made in terms of precision and computing time with other elliptic equation solvers proposed in the open source LIS library. The first results, obtained by using a single core on a HPC, show that the developed SOR R＆B method is efficient when the spectral radius needed for the Chebyshev acceleration is carefully pre-estimated. Preliminary results obtained with a parallelized code using the MPI library are also discussed when the calculation is distributed over one hundred cores.展开更多
基金supported by the National Natural Science Foundation of China[grant number 41675100],[grant number91337110]the Third Tibetan Plateau Scientific Experiment:Observations for Boundary Layer and Troposphere[GYHY201406001]+1 种基金the Key Research Program of Frontier Sciences,Chinese Academy of Science(CAS)(QYZDY-SSW-DQC018)the Special Program for Applied Research on Super Computation of the NSFC-Guangdong Joint Fund(the 2nd phase)
文摘High computational performance is extremely important for climate system models, especially in ultra-high-resolution model development. In this study, the computational performance of the Finite-volume Atmospheric Model of the IAP/LASG （FAMIL） was comprehensively evaluated on Tianhe-2, which was the world＇s top-ranked supercomputer from June 2013 to May 2016. The standardized Atmospheric Model Inter-comparison Project （AMIP） type of experiment was carried out that focused on the computational performance of each node as well as the simulation year per day （SYPD）, the running cost speedup, and the scalability of the FAMIL. The results indicated that （1） based on five indexes （CPU usage, percentage of CPU kernel mode that occupies CPU time and of message passing waiting time （CPU SW）, code vectorization （VEC）, average of Gflops （Gflops_ AVE）, and peak of Gflops （Gflops_PK））, FAMIL shows excellent computational performance on every Tianhe-2 computing node; （2） considering SYPD and the cost speedup of FAMIL systematically, the optimal Message Passing Interface （MPI） numbers of processors （MNPs） choice appears when FAMIL use 384 and 1536 MNPs for C96 （100 km） and C384 （25 km）, respectively; and （3） FAMIL shows positive scalability with increased threads to drive the model. Considering the fast network speed and acceleration card in the MIC architecture on Tianhe-2, there is still significant room to improve the computational performance of FAMIL.
基金Project supported by the National Natural Science Foundation of China (Nos. 10232040, 10572002 and 10572003)
文摘A new direct method for solving unsymmetrical sparse linear systems（USLS） arising from meshless methods was introduced. Computation of certain meshless methods such as meshless local Petrov-Galerkin （MLPG） method need to solve large USLS. The proposed solution method for unsymmetrical case performs factorization processes symmetrically on the upper and lower triangular portion of matrix, which differs from previous work based on general unsymmetrical process, and attains higher performance. It is shown that the solution algorithm for USLS can be simply derived from the existing approaches for the symmetrical case. The new matrix factorization algorithm in our method can be implemented easily by modifying a standard JKI symmetrical matrix factorization code. Multi-blocked out-of-core strategies were also developed to expand the solution scale. The approach convincingly increases the speed of the solution process, which is demonstrated with the numerical tests.
基金Scientific Research Projects at Istanbul Technical University from the year 2021 to 2023(ITÜ BAP Project No.MAB-2021-42813).
文摘Various parameters can be integrated in material-based computational design in architecture.Materials are the main driver of these processes and evaluated with the constraints related to the form,performance,and fabrication techniques.However,current methodologies mostly involve investigating already existing materials.Studies on computational material design,in which new materials are developed by designing their microstructures in response to the performative issues,are generally undertaken at the material scale,and not adopted to the architectural design process yet.To resolve this issue,the methodology titled Interscalable Material Microstructure Organization in Performance-based Computational Design(I2MO_PCD)is developed and presented in three stages,including(1)identification of different types of material microstructures,(2)computational material design,and(3)prototyping.Data-based material modelling and visualization,and algorithmic modelling techniques are utilized,followed by various performance simulations as a part of an iterative process.New microstructure organizations are designed computationally,organized under three main groups as linear-curvilinear,crystal and metaball-voronoi.The outcomes of different performance analyses,including structure,radiation,direct sun hours,acoustics and thermal bridge were compared.Thus,the role of geometrical organization of microstructures,scales and material types in different performance computations were identified,by designing and fabricating synthetic materials.
基金Project supported by the Research Fund for the Doctoral Program of Higher Education (No.20030001112).
文摘In the previous papers, a high performance sparse static solver with two-level unrolling based on a cell-sparse storage scheme was reported. Although the solver reaches quite a high efficiency for a big percentage of finite element analysis benchmark tests, the MFLOPS （million floating operations per second） of LDL^T factorization of benchmark tests vary on a Dell Pentium IV 850 MHz machine from 100 to 456 depending on the average size of the super-equations, i.e., on the average depth of unrolling. In this paper, a new sparse static solver with two-level unrolling that employs the concept of master-equations and searches for an appropriate depths of unrolling is proposed. The new solver provides higher MFLOPS for LDL^T factorization of benchmark tests, and therefore speeds up the solution process.
基金supported in part by the Talent Fund of Beijing Jiaotong University(2023XKRC017)in part by Research and Development Project of China State Railway Group Co.,Ltd.(P2022Z003).
文摘Further improving the railway innovation capacity and technological strength is the important goal of the 14th Five-Year Plan for railway scientific and technological innovation.It includes promoting the deep integration of cutting-edge technologies with the railway systems,strengthening the research and application of intelligent railway technologies,applying green computing technologies and advancing the collaborative sharing of transportation big data.The high-speed rail system tasks need to process huge amounts of data and heavy workload with the requirement of ultra-fast response.Therefore,it is of great necessity to promote computation efficiency by applying High Performance Computing(HPC)to high-speed rail systems.The HPC technique is a great solution for improving the performance,efficiency,and safety of high-speed rail systems.In this review,we introduce and analyze the application research of high performance computing technology in the field of highspeed railways.These HPC applications are cataloged into four broad categories,namely:fault diagnosis,network and communication,management system,and simulations.Moreover,challenges and issues to be addressed are discussed and further directions are suggested.
文摘Cloud computing technology is changing the development and usage patterns of IT infrastructure and applications. Virtualized and distributed systems as well as unified management and scheduling has greatly im proved computing and storage. Management has become easier, andOAM costs have been significantly reduced. Cloud desktop technology is develop ing rapidly. With this technology, users can flexibly and dynamically use virtual ma chine resources, companies＇ efficiency of using and allocating resources is greatly improved, and information security is ensured. In most existing virtual cloud desk top solutions, computing and storage are bound together, and data is stored as im age files. This limits the flexibility and expandability of systems and is insufficient for meetinz customers＇ requirements in different scenarios.
文摘This paper proposes algorithm for Increasing Virtual Machine Security Strategy in Cloud Computing computations.Imbalance between load and energy has been one of the disadvantages of old methods in providing server and hosting,so that if two virtual severs be active on a host and energy load be more on a host,it would allocated the energy of other hosts(virtual host)to itself to stay steady and this option usually leads to hardware overflow errors and users dissatisfaction.This problem has been removed in methods based on cloud processing but not perfectly,therefore,providing an algorithm not only will implement a suitable security background but also it will suitably divide energy consumption and load balancing among virtual severs.The proposed algorithm is compared with several previously proposed Security Strategy including SC-PSSF,PSSF and DEEAC.Comparisons show that the proposed method offers high performance computing,efficiency and consumes lower energy in the network.
文摘Today the PC class machines are quite popular for HPC area, especially on the problemsthat require the good cost/performance ratios. One of the drawback of these machines is the poormemory throughput performance. And one of the reasons of the poor performance is depend on the lack of the mapping capability of the TLB which is a buffer to accelerate the virtual memory access. In this report, I present that the mapping capability and the performance can be improved with the multi granularity TLB feature that some processors have. And I also present that the new TLB handling routine can be incorporated into the demand paging system of Linux.
基金supported in part by National 863 Program (2009AA01Z256,No.2009AA01A345)National 973 Program (2007CB310705)the NSFC (60932004),P.R.China
文摘This paper analyzes the physical potential, computing performance benefi t and power consumption of optical interconnects. Compared with electrical interconnections, optical ones show undoubted advantages based on physical factor analysis. At the same time, since the recent developments drive us to think about whether these optical interconnect technologies with higher bandwidth but higher cost are worthy to be deployed, the computing performance comparison is performed. To meet the increasing demand of large-scale parallel or multi-processor computing tasks, an analytic method to evaluate parallel computing performance ofinterconnect systems is proposed in this paper. Both bandwidth-limit model and full-bandwidth model are under our investigation. Speedup and effi ciency are selected to represent the parallel performance of an interconnect system. Deploying the proposed models, we depict the performance gap between the optical and electrically interconnected systems. Another investigation on power consumption of commercial products showed that if the parallel interconnections are deployed, the unit power consumption will be reduced. Therefore, from the analysis of computing influence and power dissipation, we found that parallel optical interconnect is valuable combination of high performance and low energy consumption. Considering the possible data center under construction, huge power could be saved if parallel optical interconnects technologies are used.
文摘Aeroacoustic performance of fans is essential due to their widespread application. Therefore, the original aim of this paper is to evaluate the generated noise owing to different geometric parameters. In current study, effect of five geometric parameters was investigated on well performance of a Bladeless fan. Airflow through this fan was analyzed simulating a Bladeless fan within a 2 m×2 m×4 m room. Analysis of the flow field inside the fan and evaluating its performance were obtained by solving conservations of mass and momentum equations for aerodynamic investigations and FW-H noise equations for aeroacoustic analysis. In order to design Bladeless fan Eppler 473 airfoil profile was used as the cross section of this fan. Five distinct parameters, namely height of cross section of the fan, outlet angle of the flow relative to the fan axis, thickness of airflow outlet slit, hydraulic diameter and aspect ratio for circular and quadratic cross sections were considered. Validating acoustic code results, we compared numerical solution of FW-H noise equations for NACA0012 with experimental results. FW-H model was selected to predict the noise generated by the Bladeless fan as the numerical results indicated a good agreement with experimental ones for NACA0012. To validate 3-D numerical results, the experimental results of a round jet showed good agreement with those simulation data. In order to indicate the effect of each mentioned parameter on the fan performance, SPL and OASPL diagrams were illustrated.
文摘In recent years, the widespread adoption of parallel computing, especially in multi-core processors and high-performance computing environments, ushered in a new era of efficiency and speed. This trend was particularly noteworthy in the field of image processing, which witnessed significant advancements. This parallel computing project explored the field of parallel image processing, with a focus on the grayscale conversion of colorful images. Our approach involved integrating OpenMP into our framework for parallelization to execute a critical image processing task: grayscale conversion. By using OpenMP, we strategically enhanced the overall performance of the conversion process by distributing the workload across multiple threads. The primary objectives of our project revolved around optimizing computation time and improving overall efficiency, particularly in the task of grayscale conversion of colorful images. Utilizing OpenMP for concurrent processing across multiple cores significantly reduced execution times through the effective distribution of tasks among these cores. The speedup values for various image sizes highlighted the efficacy of parallel processing, especially for large images. However, a detailed examination revealed a potential decline in parallelization efficiency with an increasing number of cores. This underscored the importance of a carefully optimized parallelization strategy, considering factors like load balancing and minimizing communication overhead. Despite challenges, the overall scalability and efficiency achieved with parallel image processing underscored OpenMP’s effectiveness in accelerating image manipulation tasks.
基金support via the NSF grants NSF-19-04774,NSF-AST-2009776,NASA-2020-1241the NASA grant 80NSSC22K0628。
文摘GPU computing is expected to play an integral part in all modern Exascale supercomputers.It is also expected that higher order Godunov schemes will make up about a significant fraction of the application mix on such supercomputers.It is,therefore,very important to prepare the community of users of higher order schemes for hyperbolic PDEs for this emerging opportunity.Not every algorithm that is used in the space-time update of the solution of hyperbolic PDEs will take well to GPUs.However,we identify a small core of algorithms that take exceptionally well to GPU computing.Based on an analysis of available options,we have been able to identify weighted essentially non-oscillatory(WENO)algorithms for spatial reconstruction along with arbitrary derivative(ADER)algorithms for time extension followed by a corrector step as the winning three-part algorithmic combination.Even when a winning subset of algorithms has been identified,it is not clear that they will port seamlessly to GPUs.The low data throughput between CPU and GPU,as well as the very small cache sizes on modern GPUs,implies that we have to think through all aspects of the task of porting an application to GPUs.For that reason,this paper identifies the techniques and tricks needed for making a successful port of this very useful class of higher order algorithms to GPUs.Application codes face a further challenge—the GPU results need to be practically indistinguishable from the CPU results—in order for the legacy knowledge bases embedded in these applications codes to be preserved during the port of GPUs.This requirement often makes a complete code rewrite impossible.For that reason,it is safest to use an approach based on OpenACC directives,so that most of the code remains intact(as long as it was originally well-written).This paper is intended to be a one-stop shop for anyone seeking to make an OpenACC-based port of a higher order Godunov scheme to GPUs.We focus on three broad and high-impact areas where higher order Godunov schemes are used.The first area is computational fluid dynamics(CFD).The second is computational magnetohydrodynamics(MHD)which has an involution constraint that has to be mimetically preserved.The third is computational electrodynamics(CED)which has involution constraints and also extremely stiff source terms.Together,these three diverse uses of higher order Godunov methodology,cover many of the most important applications areas.In all three cases,we show that the optimal use of algorithms,techniques,and tricks,along with the use of OpenACC,yields superlative speedups on GPUs.As a bonus,we find a most remarkable and desirable result:some higher order schemes,with their larger operations count per zone,show better speedup than lower order schemes on GPUs.In other words,the GPU is an optimal stratagem for overcoming the higher computational complexities of higher order schemes.Several avenues for future improvement have also been identified.A scalability study is presented for a real-world application using GPUs and comparable numbers of high-end multicore CPUs.It is found that GPUs offer a substantial performance benefit over comparable number of CPUs,especially when all the methods designed in this paper are used.
文摘The integration of clusters,grids,clouds,edges and other computing platforms result in contemporary technology of jungle computing.This novel technique has the aptitude to tackle high performance computation systems and it manages the usage of all computing platforms at a time.Federated learning is a collaborative machine learning approach without centralized training data.The proposed system effectively detects the intrusion attack without human intervention and subsequently detects anomalous deviations in device communication behavior,potentially caused by malicious adversaries and it can emerge with new and unknown attacks.The main objective is to learn overall behavior of an intruder while performing attacks to the assumed target service.Moreover,the updated system model is send to the centralized server in jungle computing,to detect their pattern.Federated learning greatly helps the machine to study the type of attack from each device and this technique paves a way to complete dominion over all malicious behaviors.In our proposed work,we have implemented an intrusion detection system that has high accuracy,low False Positive Rate(FPR)scalable,and versatile for the jungle computing environment.The execution time taken to complete a round is less than two seconds,with an accuracy rate of 96%.
文摘The high-performance computing paradigm needs high-speed switching fabrics to meet the heavy traffic generated by their applications.These switching fabrics are efficiently driven by the deployed scheduling algorithms.In this paper,we proposed two scheduling algorithms for input queued switches whose operations are based on ranking procedures.At first,we proposed a Simple 2-Bit(S2B)scheme which uses binary ranking procedure and queue size for scheduling the packets.Here,the Virtual Output Queue(VOQ)set with maximum number of empty queues receives higher rank than other VOQ’s.Through simulation,we showed S2B has better throughput performance than Highest Ranking First(HRF)arbitration under uniform,and non-uniform traffic patterns.To further improve the throughput-delay performance,an Enhanced 2-Bit(E2B)approach is proposed.This approach adopts an integer representation for rank,which is the number of empty queues in a VOQ set.The simulation result shows E2B outperforms S2B and HRF scheduling algorithms with maximum throughput-delay performance.Furthermore,the algorithms are simulated under hotspot traffic and E2B proves to be more efficient.
文摘In this paper, a brief survey of smart citiy projects in Europe is presented. This survey shows the extent of transport and logistics in smart cities. We concentrate on a smart city project we have been working on that is related to A Logistic Mobile Application （ALMA）. The application is based on Internet of Things and combines a communication infrastructure and a High Performance Computing infrastructure in order to deliver mobile logistic services with high quality of service and adaptation to the dynamic nature of logistic operations.
基金the National Natural Science Foundation of China(No.41971356,41701446)National Key Research and Development Program of China(No.2017YFB0503600,2018YFB0505500,2017YFC0602204).
文摘Parallel vector buffer analysis approaches can be classified into 2 types:algorithm-oriented parallel strategy and the data-oriented parallel strategy.These methods do not take its applicability on the existing geographic information systems(GIS)platforms into consideration.In order to address the problem,a spatial decomposition approach for accelerating buffer analysis of vector data is proposed.The relationship between the number of vertices of each feature and the buffer analysis computing time is analyzed to generate computational intensity transformation functions(CITFs).Then,computational intensity grids(CIGs)of polyline and polygon are constructed based on the relative CITFs.Using the corresponding CIGs,a spatial decomposition method for parallel buffer analysis is developed.Based on the computational intensity of the features and the sub-domains generated in the decomposition,the features are averagely assigned within the sub-domains into parallel buffer analysis tasks for load balance.Compared with typical regular domain decomposition methods,the new approach accomplishes greater balanced decomposition of computational intensity for parallel buffer analysis and achieves near-linear speedups.
文摘A new approach for the implementation of variogram models and ordinary kriging using the R statistical language, in conjunction with Fortran, the MPI （Message Passing Interface）, and the ＂pbdDMAT＂ package within R on the Bridges and Stampede Supercomputers will be described. This new technique has led to great improvements in timing as compared to those in R alone, or R with C and MPI. These improvements include processing and forecasting vectors of size 25,000 in an average time of 6 minutes on the Stampede Supercomputer and 2.5 minutes on the Bridges Supercomputer as compared to previous processing times of 3.5 hours.
基金developed in the framework of the associated team PhyLeas(Study of parallel hybrid sparse linear solvers) funded by INRIA where the partners are INRIA,T.U.Brunswick and University of Minnesotasupported by the US Department of Energy under grant DE-FG-08ER25841 and by the Minnesota Supercomputer Institute.
文摘In this paper we study the computational performance of variants of an algebraic additive Schwarz preconditioner for the Schur complement for the solution of large sparse linear systems.In earlier works,the local Schur complements were computed exactly using a sparse direct solver.The robustness of the preconditioner comes at the price of this memory and time intensive computation that is the main bottleneck of the approach for tackling huge problems.In this work we investigate the use of sparse approximation of the dense local Schur complements.These approximations are computed using a partial incomplete LU factorization.Such a numerical calculation is the core of the multi-level incomplete factorization such as the one implemented in pARMS. The numerical and computing performance of the new numerical scheme is illustrated on a set of large 3D convection-diffusion problems;preliminary experiments on linear systems arising from structural mechanics are also reported.
基金performed using HPC resources from CALMIP(Grant 2011-[P1053])supported by the French Agence Nationale de la Recherche under Project REMOVAL ANR-12-BS09-0019-1
文摘The aim of this paper is to test a developed SOR R＆B method using the Chebyshev accelerator algorithm to solve the Laplace equation in a cubic 3D configuration. Comparisons are made in terms of precision and computing time with other elliptic equation solvers proposed in the open source LIS library. The first results, obtained by using a single core on a HPC, show that the developed SOR R＆B method is efficient when the spectral radius needed for the Chebyshev acceleration is carefully pre-estimated. Preliminary results obtained with a parallelized code using the MPI library are also discussed when the calculation is distributed over one hundred cores.
