Computational grids have provided the usage of computational distributed resources for computation-intensive applications. The development of programs that use these capabilities is one of the challenging issues for grid computing. In this article, an effort has been ma More
Computational grids have provided the usage of computational distributed resources for computation-intensive applications. The development of programs that use these capabilities is one of the challenging issues for grid computing. In this article, an effort has been made in order to solve this problem by presenting mobile-agent-based parallel programming on the grid. The presentation of this model, which has been materialized by extending Alchemi™ grid infrastructure, adding agent properties and navigational commands that let the user to develop his/her program by using agents’ mobility and communication between them. In order to evaluate the system, algorithm of matrix multiplication as well as algorithm of finding the convex hull of a series of points have been implemented in the mentioned system.
Manuscript profile
Graphs are powerful data representations used in enormous computational domains. In graph-based applications, a systematic exploration of graph such as a breath first search often is a fundamental component in the processing of the vast data sets. In this paper we prese More
Graphs are powerful data representations used in enormous computational domains. In graph-based applications, a systematic exploration of graph such as a breath first search often is a fundamental component in the processing of the vast data sets. In this paper we presented a hybrid method that in each level of processing of graph chooses the best implementation of algorithms implemented on CPU or GPU, while avoid poor performance on low and high degree graphs. Our method shows improved performance over the current state-of-the-art implementation and our results proves it.
Manuscript profile