Abstract
A variety of file replication and replacement algorithms were proposed for the Data Grids in the literature. On the other hand, real-time Grid applications are emerging in many disciplines of science and engineering. Thus, it is natural to ask about the real-time performance of these file replication and replacement algorithms. Based on this motivation, in this study, the performance of three replication algorithms, namely fast spread, cascading, and caching, are evaluated together with three different file replacement policies, including least recently used, least frequently used, and least urgent first, under various Grid settings. For this evaluation, a process oriented and discrete-event driven simulator is developed. A detailed set of simulation studies are conducted using the simulator and the results obtained are presented to elaborate on the real-time performance of the aforementioned replication algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
