检索结果-南通市图书馆

A delay differential equation solver based on the parallel Adams algorithms

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Communications in Nonlinear Science and Numerical Simulation 2001年第1期6卷 28-34页

作者： Chengjian ZHANG and Hongbing YU(Department of Mathematics, Huazhong University of Science and Technology, Wuhan 430074,China) Department of Mathematics Huazhong University of Science and Technology Wuhan 430074 China

This paper constructs a class of parallel Adams algorithms for the systems of delay differential equations. The results on convergence and stability are given. The theoretical analysis and numerical test shows that th... 详细信息

关键词： parallel algorithms Adams algorithms delay differential equations

parallel Optimization of Program Instructions Using Genetic algorithms

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2021年第6期67卷 3293-3310页

作者： Petre Anghelescu partment of Electronics Communications and ComputersUniversity of PitestiPitesti110040Romania

This paper describes an efficient solution to parallelize softwareprogram instructions, regardless of the programming language in which theyare written. We solve the problem of the optimal distribution of a set ofinstructions on available processors. We propose a genetic algorithm to parallelize computations, using evolution to search the solution space. The stagesof our proposed genetic algorithm are: The choice of the initial populationand its representation in chromosomes, the crossover, and the mutation operations customized to the problem being dealt with. In this paper, geneticalgorithms are applied to the entire search space of the parallelization ofthe program instructions problem. This problem is NP-complete, so thereare no polynomial algorithms that can scan the solution space and solve theproblem. The genetic algorithm-based method is general and it is simple andefficient to implement because it can be scaled to a larger or smaller number ofinstructions that must be parallelized. The parallelization technique proposedin this paper was developed in the C# programming language, and our resultsconfirm the effectiveness of our parallelization method. Experimental resultsobtained and presented for different working scenarios confirm the theoreticalresults, and they provide insight on how to improve the exploration of a searchspace that is too large to be searched exhaustively.

关键词： parallel instruction execution parallel algorithms genetic algorithms parallel genetic algorithms artificial intelligence techniques evolutionary strategies

An Adaptive parallel Hierarchical Clustering algorithms without Memory Conflicts

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

An Adaptive Parallel Hierarchical Clustering Algorithms with...

作者： Mazen Hassan Hodeib 湖南大学

学位级别：硕士

Clustering of data has numerous applications and has been studied extensively. It is very important in Bio-informatics and data mining. Though many parallel algorithms have been designed, most of algorithms use the CRCW-PRAM or CREW-PRAM models of computing. This paper proposes a parallel EREW deterministic algorithm for hierarchical clustering. Based on algorithms of complete graph and Euclidean minimum spanning tree, the proposed algorithms can cluster n objects with O（p） processors in O（n/p） time where 1≤p≤n/logn. Performance comparisons show that our algorithm is the first algorithm that is both without memory conflicts and adaptive.

关键词： Hierarchical clustering parallel algorithms Memory conflicts Adaptive PRAM

Fast and scalable routing protocols for data center networks

同方学位论文库评论

在线全文

同方学位论文库

学校读者我要写书评

暂无评论

Digital Communications and Networks 2023年第6期9卷 1340-1350页

作者： Mihailo Vesovic Aleksandra Smiljanic Dusan Kostic School of Electrical Engineering University of Belgrade11120BelgradeSerbia Amazon Web Services(AWS) ZurichSwitzerland

Data center networks may comprise tens or hundreds of thousands of nodes,and,naturally,suffer from frequent software and hardware failures as well as link congestions.Packets are routed along the shortest paths with sufficient resources to facilitate efficient network utilization and minimize delays.In such dynamic networks,links frequently fail or get congested,making the recalculation of the shortest paths a computationally intensive problem.Various routing protocols were proposed to overcome this problem by focusing on network utilization rather than speed.Surprisingly,the design of fast shortest-path algorithms for data centers was largely neglected,though they are universal components of routing protocols.Moreover,parallelization techniques were mostly deployed for random network topologies,and not for regular topologies that are often found in data centers.The aim of this paper is to improve scalability and reduce the time required for the shortest-path calculation in data center networks by parallelization on general-purpose hardware.We propose a novel algorithm that parallelizes edge relaxations as a faster and more scalable solution for popular data center topologies.

关键词： Routing protocols Data center networks parallel algorithms Distributed algorithms Algorithm design and analysis Shortest-path problem Scalability

parallel ROSENBROCK METHODS FOR SOLVING STIFF SYSTEMS IN REAL-TIME SIMULATION

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Computational Mathematics 2000年第4期18卷 375-386页

作者： Li-rong Chen De-gui Liu (Beijing institute of Computer Application and Simulation Technology, Beijing 100854, China) 北京计算机应用与仿真技术所北京 100854

In this paper parallel Rosenbrock methods in real-time simulation are presented on parallel computers. Their construction, their convergence and their numerical stability are studied, and the numerical simulation expe... 详细信息

关键词： Rosenbrock methods stiff system real-time simulation parallel algorithms

维普期刊数据库

MODIFIED parallel ROSENBROCK METHODS FOR STIFF DIFFERENTIAL EQUATIONS

在线全文

学校读者我要写书评

暂无评论

Journal of Computational Mathematics 2002年第1期20卷 23-34页

作者： Xue-nian Cao Shou-fu Li De-gui Liu Institute for Computational and Applied Mathematics Xiangtan UniversityXiangtan 411105China Beijing Institute of Computer Application and Simulation Technology Beijing 100854China

Presents a class of modified parallel Rosenbrock methods (MPROW) which possesses more free parameters to improve further the various properties of the methods and will be similarly written as MPROW. Information on par... 详细信息

关键词： numerical analysis stiff ordinary differential equations Rosenbrock methods parallel algorithms

维普期刊数据库

Synchronous parallel Block Coordinate Descent Method for Nonsmooth Convex Function Minimization

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2020年第2期33卷 345-365页

作者： DAI Yutong WENG Yang College of Mathematics Sichuan UniversityChengdu 610064China

This paper proposes a synchronous parallel block coordinate descent algorithm for minimizing a composite function,which consists of a smooth convex function plus a non-smooth but separable convex function.Due to the generalization of the proposed method,some existing synchronous parallel algorithms can be considered as special cases.To tackle high dimensional problems,the authors further develop a randomized variant,which randomly update some blocks of coordinates at each round of computation.Both proposed parallel algorithms are proven to have sub-linear convergence rate under rather mild assumptions.The numerical experiments on solving the large scale regularized logistic regression with 1 norm penalty show that the implementation is quite efficient.The authors conclude with explanation on the observed experimental results and discussion on the potential improvements.

关键词： Block coordinate descent convergence rate convex functions parallel algorithms

维普期刊数据库

parallel Mesh Refinement of Higher Order Finite Elements for Electronic Structure Calculations

在线全文

学校读者我要写书评

暂无评论

Communications in Computational Physics 2008年第10期4卷 1086-1105页

作者： Dier Zhang Aihui Zhou Xin-Gao Gong Department of Physics Fudan UniversityShanghai 200433China LSEC Institute of Computational Mathematics and Scientific/Engineering ComputingAcademy of Mathematics and Systems ScienceChinese Academy of SciencesBeijing 100190China

The finite element method is a promising method for electronic structure calculations.In this paper,a new parallelmesh refinementmethod for electronic structure calculations is presented.Some properties of the method are investigated to make itmore efficient andmore convenient for implementation.Several practical issues such as distributed memory parallel computation,less tetrahedra prototypes,and the assignment of the mesh elements carried out independently in each sub-domain will be discussed.The numerical experiments on the periodic system,cluster and nano-tube are presented to demonstrate the effectiveness of the proposed method.

关键词： Tetrahedralmesh adaptivemesh refinement parallel algorithms electronic structure calculations

parallel Molecular Dynamics with Irregular Domain Decomposition

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Communications in Computational Physics 2011年第9期10卷 1071-1088页

作者： Mauro Bisson Massimo Bernaschi Simone Melchionna Department of Computer Science University of Rome"Sapienza"Italy Istituto Applicazioni Calcolo Consiglio Nazionale delle RicercheRomeItaly Institute of Material Sciences and Engineering ´Ecole Polytechnique F´ed´erale de LausanneSwitzerland CNR-IPCF Istituto Processi Chimico-FisiciConsiglio Nazionale delle RicercheRomeItaly

The spatial domain of Molecular Dynamics simulations is usually a regular box that can be easily divided in subdomains for parallel processing.Recent efforts aimed at simulating complex biological systems,like the blood flow inside arteries,require the execution of parallel Molecular Dynamics(PMD)in vessels that have,by nature,an irregular shape.In those cases,the geometry of the domain becomes an additional input parameter that directly influences the outcome of the simulation.In this paper we discuss the problems due to the parallelization of MD in complex geometries and show an efficient and general method to perform MD in irregular domains.

关键词： Molecular dynamics irregular domain decomposition parallel algorithms hemodynamics