data prefetching
Recently Published Documents


TOTAL DOCUMENTS

193
(FIVE YEARS 26)

H-INDEX

18
(FIVE YEARS 2)

2021 ◽  
Vol 11 (2) ◽  
pp. 35-39
Author(s):  
S. Selvam

This paper presents a creativity data prefetching scheme on the loading servers in distributed file systems for cloud computing. The server will get and piggybacked the frequent data from the client system, after analyzing the fetched data is forward to the client machine from the server. To place this technique to work, the data about client nodes is piggybacked onto the real client I/O requests, and then forwarded to the relevant storage server. Next, dual prediction algorithms have been proposed to calculation future block access operations for directing what data should be fetched on storage servers in advance. Finally, the prefetching data can be pressed to the relevant client device from the storage server. Over a series of evaluation experiments with a group of application benchmarks, we have demonstrated that our presented initiative prefetching technique can benefit distributed file systems for cloud environments to achieve better I/O performance. In particular, configuration-limited client machines in the cloud are not answerable for predicting I/O access operations, which can certainly contribute to preferable system performance on them.


Author(s):  
Zhan Shi ◽  
Akanksha Jain ◽  
Kevin Swersky ◽  
Milad Hashemi ◽  
Parthasarathy Ranganathan ◽  
...  

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Ihsan Ullah ◽  
Muhammad Sajjad Khan ◽  
Marc St-Hilaire ◽  
Mohammad Faisal ◽  
Junsu Kim ◽  
...  

The rapid evolution of the Internet of Things (IoT) and the development of cloud computing have endorsed a new computing paradigm called edge computing, which brings the computing resources to the edge of the network. Due to low computing power and small data storage at the edge nodes, the task must be assigned to the computing nodes, where their associated data is available, to reduce overheads caused by data transmissions in the network. The proposed scheme named task priority-based data-prefetching scheduler (TPDS) tries to improve the data locality through available cached and prefetching data for offloading tasks to the edge computing nodes. The proposed TPDS prioritizes the tasks in the queue based on the available cached data in the edge computing nodes. Consequently, it increases the utilization of cached data and reduces the overhead caused by data eviction. The simulation results show that the proposed TPDS can be effective in terms of task scheduling and data locality.


2021 ◽  
Vol 1827 (1) ◽  
pp. 012136
Author(s):  
Yunda Chai ◽  
Mengyao Chen ◽  
Jianan Li ◽  
Lin Han
Keyword(s):  

Author(s):  
Haichuan Ding ◽  
Ying Ma ◽  
Chi Zhang ◽  
Xuanheng Li ◽  
Bin Lin ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document