A Domain-Based Model for Efficient Measurement of Network Information on Grid Computing Environments

Yang, Chao-Tung; Shih, Po-Chi; Chen, Sung-Yi

doi:10.1093/ietisy/e89-d.2.738

Cited by 12 publications

(13 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our previous link-bandwidth measurement scheme [44,47] measures a total of NMN(n) = n ×(n −1) network links per T seconds, producing a huge amount of measurement traffic and degrading system performance where n is the number of nodes in the Grid of concern. One of our previous works [11] proposed the domain-based network information model which is a static link-measure model. With this model, the head node of a site (e.g.…”

Section: Dynamic Domain-based Network Information Modelmentioning

confidence: 99%

Resource brokering using a multi‐site resource allocation strategy for computational grids

Yang

Leu

Chen

2010

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYGrid computing employs heterogeneous resources which may be installed on different platforms, hardware/software, computer architectures, and perhaps using different computer languages to solve large-scale computational problems. As many more Grids are being developed worldwide, the number of multi-institutional collaborations is growing rapidly. However, to realize Grid computing's full potential, it is expected that Grid participants must be able to share one another's resources. This paper presents a resource broker that employs the multi-site resource allocation (MSRA) strategy and the dynamic domain-based network information model that we propose to allocate Grid resources to submitted jobs, where the Grid resources may be dispersed at different sites, and owned and governed by different organizations or institutes. The jobs and resources may also belong to different clusters/sites. Resource statuses collected by the Ganglia, and network bandwidths gathered by the Network Weather Service, are both considered in the proposed scheduling approach. A dynamic domain-based model for network information measurement is also proposed to choose the most appropriate resources that meet the jobs' execution requirements. Experimental results show that MSRA outperformed the other tested strategies.

show abstract

Section: Dynamic Domain-based Network Information Modelmentioning

confidence: 99%

Resource brokering using a multi‐site resource allocation strategy for computational grids

Yang

Leu

Chen

2010

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…Candidate replica locations are passed to the replica selection service [21], which was presented in a previous work [23,24,25]. This replica selection service provides estimates of candidate transfer performance based on a cost model and chooses appropriate amounts to request from the better locations.…”

Section: The Co-allocation Architecturementioning

confidence: 99%

“…In our previous work [23,24], we proposed a replica selection cost model and a replica selection service to perform replica selection. In [17], the author proposes a co-allocation architecture for co-allocating Grid data transfers across multiple connections by exploiting the partial-copy feature of GridFTP.…”

Section: Fig 1 the Co-allocation Architecture In Data Gridsmentioning

confidence: 99%

“…• Mem : memory free space ratio defined by the user • P i BW : percentage of bandwidth available from server i to client (user node); current bandwidth divided by highest theoretical bandwidth [22,24] • R BW : network bandwidth ratio defined by users.…”

Section: The Dynamic Adjustment Strategymentioning

confidence: 99%

“…This method selects the servers most likely to provide optimum transfer rates because bandwidth quality can vary unpredictably due to the sharing nature of the Internet. Another way is to use co-allocation technology [17,21,23,24,25,26,27,28,30] to download data. Co-allocation of data transfers enables the clients to download data from multiple locations by establishing multiple connections in parallel.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Dynamic Adjustment Strategy for File Transformation in Data Grids

Yang

Wang

2007

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this paper, we propose a dynamic file transfer scheme with coallocation architecture, called Dynamic Adjustment Strategy, a dynamic file transfer scheme with co-allocation architecture that reduce the file transfer times and improves the performance in Data Grid environments. Our approach reduces the idle time faster servers spend waiting for the slowest server, and decreases file transfer completion time. We also present a new toolkit, called Cyber-Transformer, with a friendly graphical user interface interface running on the client side that makes it easy for inexperienced users to manage replicas and download the files in Data Grid environments. We also provide an effective scheme for reducing the cost of reassembling data blocks.

show abstract

Design and Implementation of a Multi-Grid Resource Broker for Grid Computing

Yang

2011

Data Driven E-Science

View full text Add to dashboard Cite

A Domain-Based Model for Efficient Measurement of Network Information on Grid Computing Environments

Cited by 12 publications

References 0 publications

Resource brokering using a multi‐site resource allocation strategy for computational grids

Resource brokering using a multi‐site resource allocation strategy for computational grids

A Dynamic Adjustment Strategy for File Transformation in Data Grids

Design and Implementation of a Multi-Grid Resource Broker for Grid Computing

Contact Info

Product

Resources

About