Performance of File Replication Policies for Real-time File Access in Data Grids

Author(s):  
Atakan Dogan
Author(s):  
ChenHan Liao ◽  
Na Helian ◽  
Sining Wu ◽  
Mamunur M. Rashid

Most replication methods either monitor the popularity of files or use complicated functions to calculate the overall cost of whether or not a replication decision or a deletion decision should be issued. However, once the replication decision is issued, the popularity of the files is changed and may have already impacted access latency and resource usage. This article proposes a decision-tree-based predictive file replication strategy that forecasts files’ future popularity based on their characteristics on the Grids. The proposed strategy has shown superb performance in terms of mean job time and effective network usage compared with the other two replication strategies, LRU and Economic under OptorSim simulation environment.


2010 ◽  
Vol 2 (1) ◽  
pp. 69-86 ◽  
Author(s):  
ChenHan Liao ◽  
Na Helian ◽  
Sining Wu ◽  
Mamunur M. Rashid

Most replication methods either monitor the popularity of files or use complicated functions to calculate the overall cost of whether or not a replication decision or a deletion decision should be issued. However, once the replication decision is issued, the popularity of the files is changed and may have already impacted access latency and resource usage. This article proposes a decision-tree-based predictive file replication strategy that forecasts files’ future popularity based on their characteristics on the Grids. The proposed strategy has shown superb performance in terms of mean job time and effective network usage compared with the other two replication strategies, LRU and Economic under OptorSim simulation environment.


2009 ◽  
Vol 53 (3) ◽  
pp. 411-439 ◽  
Author(s):  
Chao-Tung Yang ◽  
Chun-Pin Fu ◽  
Ching-Hsien Hsu

2014 ◽  
Vol 668-669 ◽  
pp. 1064-1067
Author(s):  
Dai Hong Jiang

This paper presents a Fast display Algorithm of large Map File based on memory mapping file technique, designing for reducing the number of pointer moves and the data in memory scheduling ,The algorithm uses a memory-mapped file access operation of a large-scale map file to resolve the problem of traditional file processing methods, which can not read more than 2G map image file; combined image pyramid technology to apply different resolutions depending on the display requirements map image, in order to achieve the purpose of roaming quickly. The experiment and analysis results show that the algorithm is able to achieve the best resolution real-time roaming of large-scale digital map.


Sign in / Sign up

Export Citation Format

Share Document