Parallel processing on block-based Gauss-Jordan algorithm for desktop grid

Shang, Yizi; Lü, Gongxuan; Shang, Ling; Wang, Guangqian

doi:10.2298/csis100907026s

Cited by 5 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The sequential BbGJ algorithm [ 27 – 29 ] is a classical linear algebra method to get the inversion of a large-scale matrix. The algorithm can be described as follows.…”

Section: Block Based Gauss Jordan Algorithmmentioning

confidence: 99%

Using the High-Level Based Program Interface to Facilitate the Large Scale Scientific Computing

Shang

Gao

et al. 2014

The Scientific World Journal

Self Cite

View full text Add to dashboard Cite

This paper is to make further research on facilitating the large-scale scientific computing on the grid and the desktop grid platform. The related issues include the programming method, the overhead of the high-level program interface based middleware, and the data anticipate migration. The block based Gauss Jordan algorithm as a real example of large-scale scientific computing is used to evaluate those issues presented above. The results show that the high-level based program interface makes the complex scientific applications on large-scale scientific platform easier, though a little overhead is unavoidable. Also, the data anticipation migration mechanism can improve the efficiency of the platform which needs to process big data based scientific applications.

show abstract

“…The sequential BbGJ algorithm [ 27 – 29 ] is a classical linear algebra method to get the inversion of a large-scale matrix. The algorithm can be described as follows.…”

Section: Block Based Gauss Jordan Algorithmmentioning

confidence: 99%

Using the High-Level Based Program Interface to Facilitate the Large Scale Scientific Computing

Shang

Gao

et al. 2014

The Scientific World Journal

Self Cite

View full text Add to dashboard Cite

show abstract

“…This paper also discusses the results of the application of the distributed computing platform previously proposed by the authors (Shang et al, 2007a(Shang et al, , 2007b(Shang et al, , 2011b. Based on the architecture of the platform, we presently present a gate regulation algorithm for downstream water level control in multi-pool canals.…”

Section: Introductionmentioning

confidence: 99%

Algorithm for Canal Gate Operation to Maintain Steady Water Levels Under Abrupt Water Withdrawal

Shang

2016

Irrig. and Drain.

Self Cite

View full text Add to dashboard Cite

Most studies on the design of an automated canal pool have produced fairly good results. However, when the designs are extended to multi‐pool canals, there is an inability to eliminate interactions between pools caused by gate start‐up and shutdown. This paper thus proposes a distributed computing gate operation algorithm for eliminating water level fluctuation and controlling the downstream water level of canal pools within a reasonable range. The algorithm was developed using state space equations derived from the complete Saint Venant equations by a finite difference scheme. This paper illustrates the application of the control method to a series of pools bounded by upstream and downstream gates. The effectiveness of the control was also verified by applying it to a laboratory canal, wherein the soft sensor technique was used to simplify communication between the distributed information nodes. The test results confirmed the ability of the proposed method to cope with rapid variations in water demand while maintaining water levels of the controlled pools. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

“…In the current conditions, it is hard to simulate the KMC evolution of dust particles in a large-scale urban environment by one computer. Therefore, the parallel computing method can be used to shorten the simulation time [30][31][32][33].…”

Section: Introductionmentioning

confidence: 99%

Kinetic-Monte-Carlo-Based Parallel Evolution Simulation Algorithm of Dust Particles

Hu¹,

Xu²,

Cai³

et al. 2014

Journal of Applied Mathematics

View full text Add to dashboard Cite

The evolution simulation of dust particles provides an important way to analyze the impact of dust on the environment. KMC-based parallel algorithm is proposed to simulate the evolution of dust particles. In the parallel evolution simulation algorithm of dust particles, data distribution way and communication optimizing strategy are raised to balance the load of every process and reduce the communication expense among processes. The experimental results show that the simulation of diffusion, sediment, and resuspension of dust particles in virtual campus is realized and the simulation time is shortened by parallel algorithm, which makes up for the shortage of serial computing and makes the simulation of large-scale virtual environment possible.

show abstract

Parallel processing on block-based Gauss-Jordan algorithm for desktop grid

Cited by 5 publications

References 9 publications

Using the High-Level Based Program Interface to Facilitate the Large Scale Scientific Computing

Using the High-Level Based Program Interface to Facilitate the Large Scale Scientific Computing

Algorithm for Canal Gate Operation to Maintain Steady Water Levels Under Abrupt Water Withdrawal

Kinetic-Monte-Carlo-Based Parallel Evolution Simulation Algorithm of Dust Particles

Contact Info

Product

Resources

About