Proceedings of the IEEK Conference (대한전자공학회:학술대회논문집)
- 2000.11c
- /
- Pages.51-54
- /
- 2000
A Study on the Block Lookup and Replacement in Global Memory
전역적 메모리에서의 블록 룩업과 재배치에 관한 연구
Abstract
Due to the emerging of high-speed network, lots of interests of access to remote data have increased. Those interests motivate using of Cooperative Caching that uses remote cache like local cache by sharing other clients' cache. The conventional algorithm like GMS(Global Memory Service) has some disadvantages that occurred bottleneck and decreasing performance because of exchanges of many messages to server or manager. On the other hand, Hint-based algorithm resolves a GMS's server bottleneck as each client has hint information of all blocks. But Hint-based algorithm also causes some problems such as inaccurate information in it, if it has too old hint information. In this paper, we offer the policy that supplement bottleneck and inaccuracy; by using file identifier that can search for the lookup table and by exchanging oldest block information between each client periodically.
Keywords