This study introduces FTCSEM,a FORTRAN-based,parallelized one-dimensional controlledsource electromagnetic(CSEM)forward modeling and inversion software capable of accommodating arbitrary source-receiver confi guration...This study introduces FTCSEM,a FORTRAN-based,parallelized one-dimensional controlledsource electromagnetic(CSEM)forward modeling and inversion software capable of accommodating arbitrary source-receiver confi gurations.In comparison to existing one-dimensional CSEM tools,FTCSEM incorporates several signifi cant enhancements:it supports transmitters of diverse shapes,quantities,and spatial locations;permits receivers to be positioned flexibly on the surface,subsurface,or in the atmosphere;facilitates simulations and inversions in both frequency and time domains;integrates an adaptive regularized inversion algorithm with multiple model constraints;and leverages GPU-accelerated parallel computing to attain high computational efficiency.Validation through numerical experiments and field data inversion confirms the program’s accuracy and practical applicability.The findings indicate that FTCSEM performs robustly in complex geoelectric environments,multi-source and multi-receiver arrangements,as well as multi-component joint inversion scenarios,thereby offering a versatile and powerful tool for advancing CSEM research and applications.展开更多
This paper studies the problem of optimal parallel tracking control for continuous-time general nonlinear systems.Unlike existing optimal state feedback control,the control input of the optimal parallel control is int...This paper studies the problem of optimal parallel tracking control for continuous-time general nonlinear systems.Unlike existing optimal state feedback control,the control input of the optimal parallel control is introduced into the feedback system.However,due to the introduction of control input into the feedback system,the optimal state feedback control methods can not be applied directly.To address this problem,an augmented system and an augmented performance index function are proposed firstly.Thus,the general nonlinear system is transformed into an affine nonlinear system.The difference between the optimal parallel control and the optimal state feedback control is analyzed theoretically.It is proven that the optimal parallel control with the augmented performance index function can be seen as the suboptimal state feedback control with the traditional performance index function.Moreover,an adaptive dynamic programming(ADP)technique is utilized to implement the optimal parallel tracking control using a critic neural network(NN)to approximate the value function online.The stability analysis of the closed-loop system is performed using the Lyapunov theory,and the tracking error and NN weights errors are uniformly ultimately bounded(UUB).Also,the optimal parallel controller guarantees the continuity of the control input under the circumstance that there are finite jump discontinuities in the reference signals.Finally,the effectiveness of the developed optimal parallel control method is verified in two cases.展开更多
Production scheduling has a major impact on the productivity of the manufacturing process. Recently, scheduling problems with deteriorating jobs have attracted increasing attentions from researchers. In many practical...Production scheduling has a major impact on the productivity of the manufacturing process. Recently, scheduling problems with deteriorating jobs have attracted increasing attentions from researchers. In many practical situations,it is found that some jobs fail to be processed prior to the pre-specified thresholds,and they often consume extra deteriorating time for successful accomplishment. Their processing times can be characterized by a step-wise function. Such kinds of jobs are called step-deteriorating jobs. In this paper,parallel machine scheduling problem with stepdeteriorating jobs( PMSD) is considered. Due to its intractability,four different mixed integer programming( MIP) models are formulated for solving the problem under consideration. The study aims to investigate the performance of these models and find promising optimization formulation to solve the largest possible problem instances. The proposed four models are solved by commercial software CPLEX. Moreover,the near-optimal solutions can be obtained by black-box local-search solver LocalS olver with the fourth one. The computational results show that the efficiencies of different MIP models depend on the distribution intervals of deteriorating thresholds, and the performance of LocalS olver is clearly better than that of CPLEX in terms of the quality of the solutions and the computational time.展开更多
Peta-scale high-perfomlance computing systems are increasingly built with heterogeneous CPU and GPU nodes to achieve higher power efficiency and computation throughput. While providing unprecedented capabilities to co...Peta-scale high-perfomlance computing systems are increasingly built with heterogeneous CPU and GPU nodes to achieve higher power efficiency and computation throughput. While providing unprecedented capabilities to conduct computational experiments of historic significance, these systems are presently difficult to program. The users, who are domain experts rather than computer experts, prefer to use programming models closer to their domains (e.g., physics and biology) rather than MPI and OpenME This has led the development of domain-specific programming that provides domain-specific programming interfaces but abstracts away some performance-critical architecture details. Based on experience in designing large-scale computing systems, a hybrid programming framework for scientific computing on heterogeneous architectures is proposed in this work. Its design philosophy is to provide a collaborative mechanism for domain experts and computer experts so that both domain-specific knowledge and performance-critical architecture details can be adequately exploited. Two real-world scientific applications have been evaluated on TH-IA, a peta-scale CPU-GPU heterogeneous system that is currently the 5th fastest supercomputer in the world. The experimental results show that the proposed framework is well suited for developing large-scale scientific computing applications on peta-scale heterogeneous CPU/GPU systems.展开更多
In this paper,we present two parallel multiplicative algorithms for convex programming.If the objective function has compact level sets and has a locally Lipschitz continuous gradient,we discuss convergence of the alg...In this paper,we present two parallel multiplicative algorithms for convex programming.If the objective function has compact level sets and has a locally Lipschitz continuous gradient,we discuss convergence of the algorithms.The proofs are essentially based on the results of sequential methods shown by Eggermontt[1].展开更多
Web service is a grid computing technology that promises greater ease-of-use and interoperability than previous distributed computing technologies. This paper proposed Group Service Framework, a grid computing platfor...Web service is a grid computing technology that promises greater ease-of-use and interoperability than previous distributed computing technologies. This paper proposed Group Service Framework, a grid computing platform based on Microsoft. NET that use web service to: (1) locate and harness volunteer computing resources for different applications, and (2) support multi-models such as Master/Slave, Divide and Conquer, Phase Parallel and so forth parallel programming paradigms in Grid environment, (3) allocate data and balance load dynamically and transparently for grid computing application. The Grid Service Framework based on Microsoft. NET was used to implement several simple parallel computing applications. The results show that the proposed Group Service Framework is suitable for generic parallel numerical computing.展开更多
The purpose of this paper is to develop an implementable strategy of brake energy recovery for a parallel hydraulic hybrid bus. Based on brake process analysis, a dynamic programming algorithm of brake energy recovery...The purpose of this paper is to develop an implementable strategy of brake energy recovery for a parallel hydraulic hybrid bus. Based on brake process analysis, a dynamic programming algorithm of brake energy recovery is established. And then an implementable strategy of brake energy recovery is proposed by the constraint variable trajectories analysis of the dynamic programming algorithm in the typical urban bus cycle. The simulation results indicate the brake energy recovery efficiency of the accumulator can reach 60% in the dynamic programming algorithm. And the hydraulic hybrid system can output braking torque as much as possible.Moreover, the accumulator has almost equal efficiency of brake energy recovery between the implementable strategy and the dynamic programming algorithm. Therefore, the implementable strategy is very effective in improving the efficiency of brake energy recovery.The road tests show the fuel economy of the hydraulic hybrid bus improves by 22.6% compared with the conventional bus.展开更多
As software applications grow increasingly large and complex,traditional code vulnerability detection methods struggle with performance and efficiency.Although code visualization-based algorithms have demonstrated eff...As software applications grow increasingly large and complex,traditional code vulnerability detection methods struggle with performance and efficiency.Although code visualization-based algorithms have demonstrated effectiveness in capturing sparse features and complex workflows in large-scale source code,their capacity to extract global semantic information and intricate long-range dependencies remains limited.Recent large language model(LLM)-based approaches have shown promising accuracy by leveraging rich contextual information,but their high computational cost often limits practical efficiency.To address these challenges,we propose VulSCP,a new framework that integrates sequential convolution with a parallel attention mechanism.Specifically,VulSCP first constructs a semantically weighted graph from the source code,then employs sequential convolution to extract local vulnerability-related features,and finally enhances the global feature representation through parallel attention.Experimental results on large-scale C/C++function-level datasets show that VulSCP achieves an accuracy of 85.14%and a false positive rate of 17.25%,outperforming the best baseline in accuracy by 1.73 percentage points and reducing the false positive rate by 3.38 percentage points.Moreover,while maintaining high detection accuracy,VulSCP achieves a low average inference time of 1.89 s per sample,showing favorable efficiency compared with the evaluated LLM-based methods.These results suggest that VulSCP is a promising approach for vulnerability detection in large and complex software systems,offering a favorable balance between accuracy and efficiency.The source code of VulSCP is publicly available at http://gffzz188fe103f8f1460asnnk0fxv5kwov69pf.ffgz.tsg.suse.edu.cn/Hwzx-ZeL/VulSCP.展开更多
This study embarks on a comprehensive examination of optimization techniques within GPU-based parallel programming models,pivotal for advancing high-performance computing(HPC).Emphasizing the transition of GPUs from g...This study embarks on a comprehensive examination of optimization techniques within GPU-based parallel programming models,pivotal for advancing high-performance computing(HPC).Emphasizing the transition of GPUs from graphic-centric processors to versatile computing units,it delves into the nuanced optimization of memory access,thread management,algorithmic design,and data structures.These optimizations are critical for exploiting the parallel processing capabilities of GPUs,addressingboth the theoretical frameworks and practical implementations.By integrating advanced strategies such as memory coalescing,dynamic scheduling,and parallel algorithmic transformations,this research aims to significantly elevate computational efficiency and throughput.The findings underscore the potential of optimized GPU programming to revolutionize computational tasks across various domains,highlighting a pathway towards achieving unparalleled processing power and efficiency in HPC environments.The paper not only contributes to the academic discourse on GPU optimization but also provides actionable insights for developers,fostering advancements in computational sciences and technology.展开更多
In recent years, it has been difficult for manufactures and suppliers to forecast demand from a market for a given product precisely. Therefore, it has become important for them to cope with fluctuations in demand. Fr...In recent years, it has been difficult for manufactures and suppliers to forecast demand from a market for a given product precisely. Therefore, it has become important for them to cope with fluctuations in demand. From this viewpoint, the problem of planning or scheduling in production systems can be regarded as a mathematical problem with stochastic elements. However, in many previous studies, such problems are formulated without stochastic factors, treating stochastic elements as deterministic variables or parameters. Stochastic programming incorporates such factors into the mathematical formulation. In the present paper, we consider a multi-product, discrete, lotsizing and scheduling problem on parallel machines with stochastic demands. Under certain assumptions, this problem can be formulated as a stochastic integer programming problem. We attempt to solve this problem by a scenario aggregation method proposed by Rockafellar and Wets. The results from computational experiments suggest that our approach is able to solve large-scale problems, and that, under the condition of uncertainty, incorporating stochastic elements into the model gives better results than formulating the problem as a deterministic model.展开更多
In this paper, we conduct research on the Java multi-thread programming and its further development tendency. Multithreading mechanisms can run several programs at the same time, make the program run effi ciency becom...In this paper, we conduct research on the Java multi-thread programming and its further development tendency. Multithreading mechanisms can run several programs at the same time, make the program run effi ciency becomes higher that also can overcome the problem of basic traditional programming language design while its design is the key to the realization of the synchronous thread. Multithreading is a mechanism that allows concurrent execution of multiple instruction stream in the program, each instruction stream is called a thread, independent from each other between each other. Thread is also known as a lightweight process, it have independent execution and process control. Our research starts from the analysis of the corresponding mechanism to enhance the performance that is innovative and meaningful.展开更多
A neruon-oriented programming system based on parallel neural information processing has been presented. With the neural programming system built upon 4~8 process elements(TMS C30), the system has thus provided users...A neruon-oriented programming system based on parallel neural information processing has been presented. With the neural programming system built upon 4~8 process elements(TMS C30), the system has thus provided users high speed, general purpose and large scale neural network application development platforms etc.展开更多
mc211vm is a process-level ARM-to-x86 binary translator developed in our lab in the past several years. Currently, it is able to emulate singlethreaded programs. We extend mc211vm to emulate multi-threaded programs. O...mc211vm is a process-level ARM-to-x86 binary translator developed in our lab in the past several years. Currently, it is able to emulate singlethreaded programs. We extend mc211vm to emulate multi-threaded programs. Our main task is to reconstruct its architecture for multi-threaded programs. Register mapping, code cache management, and address mapping in mc2llvm have all been modified. In addition, to further speed up the emulation, we collect hot paths, aggressively optimize and generate code for them at run time. Additional threads are used to alleviate the overhead. Thus, when the same hot path is walked through again, the corresponding optimized native code will be executed instead. In our experiments, our system is 8.8X faster than QEMU (quick emulator) on average when emulating the specified benchmarks with 8 guest threads.展开更多
PARCS (Parallel Asynchronous Recursive Control System) programming tools that allow unified add-on parallel extensions over traditional programming languages are described. The PARCS model is based on the conception o...PARCS (Parallel Asynchronous Recursive Control System) programming tools that allow unified add-on parallel extensions over traditional programming languages are described. The PARCS model is based on the conception of a control space, which is used to describe parallel interacting processes. Structurally, the control space consists of addressable “points” and “channels”. Executing modules are assigned to points and communicate through channels connecting points. Recursive embeddings of processes are allowed. The effective implementation of PARCS on cloud platforms Microsoft AZURE and Amazon EC2 is also presented.展开更多
Modern power systems are evolving into sociotechnical systems with massive complexity, whose real-time operation and dispatch go beyond human capability. Thus,the need for developing and applying new intelligent power...Modern power systems are evolving into sociotechnical systems with massive complexity, whose real-time operation and dispatch go beyond human capability. Thus,the need for developing and applying new intelligent power system dispatch tools are of great practical significance. In this paper, we introduce the overall business model of power system dispatch, the top level design approach of an intelligent dispatch system, and the parallel intelligent technology with its dispatch applications. We expect that a new dispatch paradigm,namely the parallel dispatch, can be established by incorporating various intelligent technologies, especially the parallel intelligent technology, to enable secure operation of complex power grids,extend system operators' capabilities, suggest optimal dispatch strategies, and to provide decision-making recommendations according to power system operational goals.展开更多
The workload of the 3D magnetotelluric forward modeling algorithm is so large that the traditional serial algorithm costs an extremely large compute time. However, the 3D forward modeling algorithm can process the dat...The workload of the 3D magnetotelluric forward modeling algorithm is so large that the traditional serial algorithm costs an extremely large compute time. However, the 3D forward modeling algorithm can process the data in the frequency domain, which is very suitable for parallel computation. With the advantage of MPI and based on an analysis of the flow of the 3D magnetotelluric serial forward algorithm, we suggest the idea of parallel computation and apply it. Three theoretical models are tested and the execution efficiency is compared in different situations. The results indicate that the parallel 3D forward modeling computation is correct and the efficiency is greatly improved. This method is suitable for large size geophysical computations.展开更多
In this paper,we study a model on joint decisions of scheduling and subcontracting, in which jobs(orders) can be either processed by parallel machines at the manufacturer in-house or subcontracted to a subcontractor.T...In this paper,we study a model on joint decisions of scheduling and subcontracting, in which jobs(orders) can be either processed by parallel machines at the manufacturer in-house or subcontracted to a subcontractor.The manufacturer needs to determine which jobs should be produced in-house and which jobs should be subcontracted.Furthermore,it needs to determine a production schedule for jobs to be produced in-house.We discuss five classical scheduling objectives as production costs.For each problem with different objective functions,we give optimality conditions and propose dynamic programming algorithms.展开更多
基金funded by the National Natural Science Foundation of China(42274192 and 42030106)Youth Innovation Promotion Association CAS(2023070).
摘要This study introduces FTCSEM,a FORTRAN-based,parallelized one-dimensional controlledsource electromagnetic(CSEM)forward modeling and inversion software capable of accommodating arbitrary source-receiver confi gurations.In comparison to existing one-dimensional CSEM tools,FTCSEM incorporates several signifi cant enhancements:it supports transmitters of diverse shapes,quantities,and spatial locations;permits receivers to be positioned flexibly on the surface,subsurface,or in the atmosphere;facilitates simulations and inversions in both frequency and time domains;integrates an adaptive regularized inversion algorithm with multiple model constraints;and leverages GPU-accelerated parallel computing to attain high computational efficiency.Validation through numerical experiments and field data inversion confirms the program’s accuracy and practical applicability.The findings indicate that FTCSEM performs robustly in complex geoelectric environments,multi-source and multi-receiver arrangements,as well as multi-component joint inversion scenarios,thereby offering a versatile and powerful tool for advancing CSEM research and applications.
基金supported in part by the National Key Reseanch and Development Program of China(2018AAA0101502,2018YFB1702300)in part by the National Natural Science Foundation of China(61722312,61533019,U1811463,61533017)in part by the Intel Collaborative Research Institute for Intelligent and Automated Connected Vehicles。
摘要This paper studies the problem of optimal parallel tracking control for continuous-time general nonlinear systems.Unlike existing optimal state feedback control,the control input of the optimal parallel control is introduced into the feedback system.However,due to the introduction of control input into the feedback system,the optimal state feedback control methods can not be applied directly.To address this problem,an augmented system and an augmented performance index function are proposed firstly.Thus,the general nonlinear system is transformed into an affine nonlinear system.The difference between the optimal parallel control and the optimal state feedback control is analyzed theoretically.It is proven that the optimal parallel control with the augmented performance index function can be seen as the suboptimal state feedback control with the traditional performance index function.Moreover,an adaptive dynamic programming(ADP)technique is utilized to implement the optimal parallel tracking control using a critic neural network(NN)to approximate the value function online.The stability analysis of the closed-loop system is performed using the Lyapunov theory,and the tracking error and NN weights errors are uniformly ultimately bounded(UUB).Also,the optimal parallel controller guarantees the continuity of the control input under the circumstance that there are finite jump discontinuities in the reference signals.Finally,the effectiveness of the developed optimal parallel control method is verified in two cases.
基金National Natural Science Foundation of China(No.51405403)the Fundamental Research Funds for the Central Universities,China(No.2682014BR019)the Scientific Research Program of Education Bureau of Sichuan Province,China(No.12ZB322)
摘要Production scheduling has a major impact on the productivity of the manufacturing process. Recently, scheduling problems with deteriorating jobs have attracted increasing attentions from researchers. In many practical situations,it is found that some jobs fail to be processed prior to the pre-specified thresholds,and they often consume extra deteriorating time for successful accomplishment. Their processing times can be characterized by a step-wise function. Such kinds of jobs are called step-deteriorating jobs. In this paper,parallel machine scheduling problem with stepdeteriorating jobs( PMSD) is considered. Due to its intractability,four different mixed integer programming( MIP) models are formulated for solving the problem under consideration. The study aims to investigate the performance of these models and find promising optimization formulation to solve the largest possible problem instances. The proposed four models are solved by commercial software CPLEX. Moreover,the near-optimal solutions can be obtained by black-box local-search solver LocalS olver with the fourth one. The computational results show that the efficiencies of different MIP models depend on the distribution intervals of deteriorating thresholds, and the performance of LocalS olver is clearly better than that of CPLEX in terms of the quality of the solutions and the computational time.
基金Project(61170049) supported by the National Natural Science Foundation of ChinaProject(2012AA010903) supported by the National High Technology Research and Development Program of China
摘要Peta-scale high-perfomlance computing systems are increasingly built with heterogeneous CPU and GPU nodes to achieve higher power efficiency and computation throughput. While providing unprecedented capabilities to conduct computational experiments of historic significance, these systems are presently difficult to program. The users, who are domain experts rather than computer experts, prefer to use programming models closer to their domains (e.g., physics and biology) rather than MPI and OpenME This has led the development of domain-specific programming that provides domain-specific programming interfaces but abstracts away some performance-critical architecture details. Based on experience in designing large-scale computing systems, a hybrid programming framework for scientific computing on heterogeneous architectures is proposed in this work. Its design philosophy is to provide a collaborative mechanism for domain experts and computer experts so that both domain-specific knowledge and performance-critical architecture details can be adequately exploited. Two real-world scientific applications have been evaluated on TH-IA, a peta-scale CPU-GPU heterogeneous system that is currently the 5th fastest supercomputer in the world. The experimental results show that the proposed framework is well suited for developing large-scale scientific computing applications on peta-scale heterogeneous CPU/GPU systems.
基金Projcct Supported by National Natural Science Foundation of,China
摘要In this paper,we present two parallel multiplicative algorithms for convex programming.If the objective function has compact level sets and has a locally Lipschitz continuous gradient,we discuss convergence of the algorithms.The proofs are essentially based on the results of sequential methods shown by Eggermontt[1].
基金National Natural F oundation of China(No.60 173 0 13 )
摘要Web service is a grid computing technology that promises greater ease-of-use and interoperability than previous distributed computing technologies. This paper proposed Group Service Framework, a grid computing platform based on Microsoft. NET that use web service to: (1) locate and harness volunteer computing resources for different applications, and (2) support multi-models such as Master/Slave, Divide and Conquer, Phase Parallel and so forth parallel programming paradigms in Grid environment, (3) allocate data and balance load dynamically and transparently for grid computing application. The Grid Service Framework based on Microsoft. NET was used to implement several simple parallel computing applications. The results show that the proposed Group Service Framework is suitable for generic parallel numerical computing.
基金supported by Shanghai Science and Technology Committee(No.0904H155100)
摘要The purpose of this paper is to develop an implementable strategy of brake energy recovery for a parallel hydraulic hybrid bus. Based on brake process analysis, a dynamic programming algorithm of brake energy recovery is established. And then an implementable strategy of brake energy recovery is proposed by the constraint variable trajectories analysis of the dynamic programming algorithm in the typical urban bus cycle. The simulation results indicate the brake energy recovery efficiency of the accumulator can reach 60% in the dynamic programming algorithm. And the hydraulic hybrid system can output braking torque as much as possible.Moreover, the accumulator has almost equal efficiency of brake energy recovery between the implementable strategy and the dynamic programming algorithm. Therefore, the implementable strategy is very effective in improving the efficiency of brake energy recovery.The road tests show the fuel economy of the hydraulic hybrid bus improves by 22.6% compared with the conventional bus.
基金funded by the Ministry of Public Security of the People’s Republic of China,grant number 2024ZB02(X.Z.).
摘要As software applications grow increasingly large and complex,traditional code vulnerability detection methods struggle with performance and efficiency.Although code visualization-based algorithms have demonstrated effectiveness in capturing sparse features and complex workflows in large-scale source code,their capacity to extract global semantic information and intricate long-range dependencies remains limited.Recent large language model(LLM)-based approaches have shown promising accuracy by leveraging rich contextual information,but their high computational cost often limits practical efficiency.To address these challenges,we propose VulSCP,a new framework that integrates sequential convolution with a parallel attention mechanism.Specifically,VulSCP first constructs a semantically weighted graph from the source code,then employs sequential convolution to extract local vulnerability-related features,and finally enhances the global feature representation through parallel attention.Experimental results on large-scale C/C++function-level datasets show that VulSCP achieves an accuracy of 85.14%and a false positive rate of 17.25%,outperforming the best baseline in accuracy by 1.73 percentage points and reducing the false positive rate by 3.38 percentage points.Moreover,while maintaining high detection accuracy,VulSCP achieves a low average inference time of 1.89 s per sample,showing favorable efficiency compared with the evaluated LLM-based methods.These results suggest that VulSCP is a promising approach for vulnerability detection in large and complex software systems,offering a favorable balance between accuracy and efficiency.The source code of VulSCP is publicly available at http://gffzz188fe103f8f1460asnnk0fxv5kwov69pf.ffgz.tsg.suse.edu.cn/Hwzx-ZeL/VulSCP.
摘要This study embarks on a comprehensive examination of optimization techniques within GPU-based parallel programming models,pivotal for advancing high-performance computing(HPC).Emphasizing the transition of GPUs from graphic-centric processors to versatile computing units,it delves into the nuanced optimization of memory access,thread management,algorithmic design,and data structures.These optimizations are critical for exploiting the parallel processing capabilities of GPUs,addressingboth the theoretical frameworks and practical implementations.By integrating advanced strategies such as memory coalescing,dynamic scheduling,and parallel algorithmic transformations,this research aims to significantly elevate computational efficiency and throughput.The findings underscore the potential of optimized GPU programming to revolutionize computational tasks across various domains,highlighting a pathway towards achieving unparalleled processing power and efficiency in HPC environments.The paper not only contributes to the academic discourse on GPU optimization but also provides actionable insights for developers,fostering advancements in computational sciences and technology.
摘要In recent years, it has been difficult for manufactures and suppliers to forecast demand from a market for a given product precisely. Therefore, it has become important for them to cope with fluctuations in demand. From this viewpoint, the problem of planning or scheduling in production systems can be regarded as a mathematical problem with stochastic elements. However, in many previous studies, such problems are formulated without stochastic factors, treating stochastic elements as deterministic variables or parameters. Stochastic programming incorporates such factors into the mathematical formulation. In the present paper, we consider a multi-product, discrete, lotsizing and scheduling problem on parallel machines with stochastic demands. Under certain assumptions, this problem can be formulated as a stochastic integer programming problem. We attempt to solve this problem by a scenario aggregation method proposed by Rockafellar and Wets. The results from computational experiments suggest that our approach is able to solve large-scale problems, and that, under the condition of uncertainty, incorporating stochastic elements into the model gives better results than formulating the problem as a deterministic model.
摘要In this paper, we conduct research on the Java multi-thread programming and its further development tendency. Multithreading mechanisms can run several programs at the same time, make the program run effi ciency becomes higher that also can overcome the problem of basic traditional programming language design while its design is the key to the realization of the synchronous thread. Multithreading is a mechanism that allows concurrent execution of multiple instruction stream in the program, each instruction stream is called a thread, independent from each other between each other. Thread is also known as a lightweight process, it have independent execution and process control. Our research starts from the analysis of the corresponding mechanism to enhance the performance that is innovative and meaningful.
摘要A neruon-oriented programming system based on parallel neural information processing has been presented. With the neural programming system built upon 4~8 process elements(TMS C30), the system has thus provided users high speed, general purpose and large scale neural network application development platforms etc.
基金supported by NSC under Grant No.NSC 100-2218-E-009-009MY3 and NSC 100-2218-E-009-010-MY3
摘要mc211vm is a process-level ARM-to-x86 binary translator developed in our lab in the past several years. Currently, it is able to emulate singlethreaded programs. We extend mc211vm to emulate multi-threaded programs. Our main task is to reconstruct its architecture for multi-threaded programs. Register mapping, code cache management, and address mapping in mc2llvm have all been modified. In addition, to further speed up the emulation, we collect hot paths, aggressively optimize and generate code for them at run time. Additional threads are used to alleviate the overhead. Thus, when the same hot path is walked through again, the corresponding optimized native code will be executed instead. In our experiments, our system is 8.8X faster than QEMU (quick emulator) on average when emulating the specified benchmarks with 8 guest threads.
摘要PARCS (Parallel Asynchronous Recursive Control System) programming tools that allow unified add-on parallel extensions over traditional programming languages are described. The PARCS model is based on the conception of a control space, which is used to describe parallel interacting processes. Structurally, the control space consists of addressable “points” and “channels”. Executing modules are assigned to points and communicate through channels connecting points. Recursive embeddings of processes are allowed. The effective implementation of PARCS on cloud platforms Microsoft AZURE and Amazon EC2 is also presented.
基金supported by State Grid Corporation of China(SGCC)Science and Technology Project SGTJDK00DWJS1700060
摘要Modern power systems are evolving into sociotechnical systems with massive complexity, whose real-time operation and dispatch go beyond human capability. Thus,the need for developing and applying new intelligent power system dispatch tools are of great practical significance. In this paper, we introduce the overall business model of power system dispatch, the top level design approach of an intelligent dispatch system, and the parallel intelligent technology with its dispatch applications. We expect that a new dispatch paradigm,namely the parallel dispatch, can be established by incorporating various intelligent technologies, especially the parallel intelligent technology, to enable secure operation of complex power grids,extend system operators' capabilities, suggest optimal dispatch strategies, and to provide decision-making recommendations according to power system operational goals.
基金This research is sponsored by the National Natural Science Foundation of China (No. 40374024).
摘要The workload of the 3D magnetotelluric forward modeling algorithm is so large that the traditional serial algorithm costs an extremely large compute time. However, the 3D forward modeling algorithm can process the data in the frequency domain, which is very suitable for parallel computation. With the advantage of MPI and based on an analysis of the flow of the 3D magnetotelluric serial forward algorithm, we suggest the idea of parallel computation and apply it. Three theoretical models are tested and the execution efficiency is compared in different situations. The results indicate that the parallel 3D forward modeling computation is correct and the efficiency is greatly improved. This method is suitable for large size geophysical computations.
基金Supported by the National Natural Science Foundation of China(70731160015)Supported the National Natural Science Foundation of Jiangsu Province(yw06037)
摘要In this paper,we study a model on joint decisions of scheduling and subcontracting, in which jobs(orders) can be either processed by parallel machines at the manufacturer in-house or subcontracted to a subcontractor.The manufacturer needs to determine which jobs should be produced in-house and which jobs should be subcontracted.Furthermore,it needs to determine a production schedule for jobs to be produced in-house.We discuss five classical scheduling objectives as production costs.For each problem with different objective functions,we give optimality conditions and propose dynamic programming algorithms.