Computational Technology Resources - CCP

B. Stamatovic¹ and R. Trobec²

¹Faculty of Information Systems and Technologies, University of Donja Gorica, Podgorica, Montenegro
²Jozef Stefan Institute, Ljubljana, Slovenia

doi:10.4203/ccp.107.16

purchase the full-text of this paper

B. Stamatovic, R. Trobec, "Identification of Backbones in a Two-Dimensional Percolation Site", in , (Editors), "Proceedings of the Fourth International Conference on Parallel, Distributed, Grid and Cloud Computing for Engineering", Civil-Comp Press, Stirlingshire, UK, Paper 16, 2015. doi:10.4203/ccp.107.16

Keywords: infinite cluster, backbone, percolation, parallel algorithm, data-flow.

Summary

The paper proposes a new data-flow based approach for the identification a backbone of an infinite cluster in a two-dimensional percolation site lattice, which connects two opposite lattice boundaries. The infinite cluster is identified first, then a multi step algorithm is applied for the reduction of the infinite cluster to its backbone. The algorithm is local and can therefore be efficiently implemented on data-flow parallel platforms. The proposed methodology could resolve the problem of stack overflow at large systems that can appear with classical graph based algorithms, and has a potential for a higher execution speed-up on parallel architectures.

purchase the full-text of this paper (price £20)

go to the previous paper
go to the next paper
return to the table of contents
return to the book description
purchase this book (price £45 +P&P)

	Computational & Technology Resources an online resource for computational, engineering & technology publications
	not logged in - login
Front Page Browse CCP CSETS CTR IJRT Other Authors Search Purchase Guide FAQ Contact us	Civil-Comp Proceedings ISSN 1759-3433 CCP: 107 PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED, GRID AND CLOUD COMPUTING FOR ENGINEERING Edited by: Paper 16 Identification of Backbones in a Two-Dimensional Percolation Site B. Stamatovic¹ and R. Trobec² ¹Faculty of Information Systems and Technologies, University of Donja Gorica, Podgorica, Montenegro ²Jozef Stefan Institute, Ljubljana, Slovenia doi:10.4203/ccp.107.16 purchase the full-text of this paper Full Bibliographic Reference for this paper B. Stamatovic, R. Trobec, "Identification of Backbones in a Two-Dimensional Percolation Site", in , (Editors), "Proceedings of the Fourth International Conference on Parallel, Distributed, Grid and Cloud Computing for Engineering", Civil-Comp Press, Stirlingshire, UK, Paper 16, 2015. doi:10.4203/ccp.107.16 Keywords: infinite cluster, backbone, percolation, parallel algorithm, data-flow. Summary The paper proposes a new data-flow based approach for the identification a backbone of an infinite cluster in a two-dimensional percolation site lattice, which connects two opposite lattice boundaries. The infinite cluster is identified first, then a multi step algorithm is applied for the reduction of the infinite cluster to its backbone. The algorithm is local and can therefore be efficiently implemented on data-flow parallel platforms. The proposed methodology could resolve the problem of stack overflow at large systems that can appear with classical graph based algorithms, and has a potential for a higher execution speed-up on parallel architectures. purchase the full-text of this paper (price £20) go to the previous paper go to the next paper return to the table of contents return to the book description purchase this book (price £45 +P&P)
Back to top	©Civil-Comp Limited 2023 - terms & conditions