A Study of File Replacement Policy in Data Grid Environments 


Vol. 13,  No. 6, pp. 511-516, Dec.  2006
10.3745/KIPSTA.2006.13.6.511


PDF
  Abstract

The data grid computing provides geographically distributed storage resources to solve computational problems with large-scale data. Unlike cache replacement policies in virtual memory or web-caching replacement, an optimal file replacement policy for data grids is the one of the important problems by the fact that file size is very large. The traditional file replacement policies such as LRU(Least Recently Used), LCB-K(Least Cost Beneficial based on K), EBR(Economic-based cache replacement), LVCT(Least Value-based on Caching Time) have the problem that they have to predict requests or need additional resources to file replacement. To solve theses problems, this paper propose SBR-k(Sized-based replacement-k) that replaces files based on file size. The results of the simulation show that the proposed policy performs better than traditional policies.

  Statistics
  Cite this article

[IEEE Style]

H. J. Park, "A Study of File Replacement Policy in Data Grid Environments," The KIPS Transactions:PartA, vol. 13, no. 6, pp. 511-516, 2006. DOI: 10.3745/KIPSTA.2006.13.6.511.

[ACM Style]

Hong Jin Park. 2006. A Study of File Replacement Policy in Data Grid Environments. The KIPS Transactions:PartA, 13, 6, (2006), 511-516. DOI: 10.3745/KIPSTA.2006.13.6.511.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals