Integrated Caching and Prefetching on Dynamic Replication to Reduce Access Latency for Distributed Systems

dc.contributor.advisorLibsie, Mulugeta (PhD)
dc.contributor.authorBinalf, Yilkal
dc.date.accessioned2022-03-14T11:51:57Z
dc.date.accessioned2023-11-29T04:06:29Z
dc.date.available2022-03-14T11:51:57Z
dc.date.available2023-11-29T04:06:29Z
dc.date.issued2021-07-13
dc.description.abstractDistributed computing is a rapidly developing IT technology. Every system connects to other systems via the network to improve its performance. Thanks to distributed systems technology, workers from all over the world can collaborate to work for a single company, and customers of these companies can access data and receive service as if they were in the same location. However, as the number of users and organizations requesting and delivering these services grows, there is a problem with access latency. One of the major problems of distributed systems is response time latency. As a result, we developed the integrated Caching and Prefetching on Dynamic Replication (CPDR) algorithm, which reduces access latency in distributed computing environments. Cacher, Prefetcher, and Replicator are the three main components of the developed system. There is one more unique component in the cacher called Notifier, which has the Prefetcher's status and is used to save time when the prefetcher is not active and the requested data is not available. Furthermore, the Cacher, Prefetcher, and Replicator each has a manager component that contains an algorithm for controlling the Cache storage, prefetching data, replicating data, and determining where data should be placed. Moreover, taking various scenarios, which depict the minimum and maximum capacity of the computing environment as well as different requirements of incoming jobs, we evaluated our algorithm With caching, prefetching, dynamic replication, the integration of caching and prefetching, the integration of caching and dynamic replication, integration of prefetching and dynamic replication algorithms. It is observed that the proposed algorithm outperforms the counterparts from the perspective of response time and storage utilizationen_US
dc.identifier.urihttp://etd.aau.edu.et/handle/123456789/30576
dc.language.isoenen_US
dc.publisherAddis Ababa Universityen_US
dc.subjectDistributed Computingen_US
dc.subjectCachingen_US
dc.subjectPrefetchingen_US
dc.subjectReplicationen_US
dc.subjectDynamic Replication Algorithmen_US
dc.subjectCPDR Algorithmen_US
dc.titleIntegrated Caching and Prefetching on Dynamic Replication to Reduce Access Latency for Distributed Systemsen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Yilkal Binalf 2021.pdf
Size:
2.4 MB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Plain Text
Description: