A Square Coverage Method for Meshlization of the Grid Resource Topology
| Autor: | Sheng-Wen Li, 李聖文 |
|---|---|
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 97 Grid computing deals with deploying various computing and network resources for meeting diverse users demands. Each grid-computing problem, either computing-intensive or communication-intensive, has its own requirements in selecting resources. Paralleling a grid-computing problem starts with dividing the problem into several pieces, called subtasks, and allocating grid resources to them. Then computing nodes in different locations are configured in some topology. And this is determined through resource selection and job scheduling. The key to successful resource selection and job scheduling lies in balancing the load of both computation on nodes with different computing power, and communication on the underlying interconnection network that supports the topology. This is a critical issue that has attracted a lot of research attention in the grid-computing area. In this thesis, we propose the ISPA algorithm to transform a network resource topology of grid into a regular mesh topology. The grid computing resources are organized to form a virtual mesh. The proposed ISPA algorithm consists of two major phases. In the first phase, the majority of the virtual nodes are assigned to some computing nodes by a permuting process. In the second phase, the remaining virtual nodes are assigned through an attaching process. With flexible and versatile choices in attaching nodes, the ISPA algorithm can exert different ways of distributing resources to solve the computing-oriented and communication-oriented problems effectively. Based on simulation results, we come to the following conclusions. The permuting policy plays an import role in determining the number basic blocks of permutation. The attaching policy has influence on the variance of computational ability of virtual nodes and the average communication ability of virtual links. We find that the computation-oriented policies allow the ISPA algorithm to achieve lower variance of computational ability of virtual nodes than the other policies. We also find that the communication-oriented policies enable the ISPA algorithm to attain higher communication ability of virtual links than the other policies for attaching processes. In respect to dealing with communication-oriented problems, the proposed algorithm shows a significant reduction in communications by 2~7%, compared with the PaGrid. However, the permuting process in ours proposed algorithm requires a high complexity in computation. And this deservers further attention of future research. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|