Research of Hot-Spot Selection Algorithm in Virtual Address Switch

  • Tao Cai
  • ShiGuang Ju
  • JuenJie Zhao
  • DeJiao Niu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3759)


SAN-level buffer cache is an important factor in improving the efficiency of the storage area network (SAN). In this paper, we analyzed the SAN-level access pattern characterization, and designed a new hot spot selection algorithm called maximal access times and oldest access first select (MOFS) and minimal access times and oldest access first eliminate (MOFE) for SAN-level buffer cache. The line size for the hot spot is larger than the line size implemented in disk array caches. The algorithm calls in the block with the highest number of access times and oldest access to SAN-level buffer cache, and eliminates the block with the minimal access times and oldest access from the accessed block list. The algorithm uses the self-adapt mechanism to change the parameter’s algorithm value dynamically. We implemented a virtual address switch in the SAN virtualization system to collect the access request information. Base on this we implemented the hot spot selection algorithm to select a block and send it to the SAN-level buffer cache. Lastly we evaluated the MOFS and MOFE algorithm and proved that this algorithm realizes a low call in ratio and high hit ratios in the SAN-level buffer cache and the self-adapt mechanism makes the MOFS and MOFE work efficiently with different types of workloads.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Muntz, D., Honeyman, P.: Multi-Level Caching in Distributed File Systems-or-Your Cache Ain’t Nuthiní but Trash. In: Proc. Usenix Winter 1992 Technical Conf., pp. 305–314 (Janaury 1991)Google Scholar
  2. 2.
    Chen, Y.Z.Z., Li, K.: Second-Level Buffer Cache Management. IEEE transactions on parallel and distributed systems 15(7) (July 2004)Google Scholar
  3. 3.
    O’Neil, E.J., O’Neill, P.E., Weikum, G.: The LRU-K Page Replacement Algorithm For Database Disk Buffering. In: SIGMOD 1993, Washington, DC, USA. ACM, New York (1993)Google Scholar
  4. 4.
    Robinson, J., Devarakonda, M.: Data Cache Management Using Frequency-Based Replacement,î. In: Proc. ACM SIGMETRICS Conf. Measurement and Modeling of Computer Systems (1990)Google Scholar
  5. 5.
    Lee, D., Choi, J., Kim, J.-H., Min, S.L., Cho, Y., Kim, C.S., Noh, S.H.: On the Existence of a Spectrum of Policies That Subsumes the Least Recently Used (LRU) and Least Frequently Used (LFU) Policies. In: Proc. ACM SIGMETRICS Int’l Conf. Measurement and Modeling of Computing Systems, SIGMETRICS Performance Evaluation Rev., vol. 27(1), pp. 134–143 (May 1999)Google Scholar
  6. 6.
    Johnson, T., Shasha, D.: 2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm. In: Proc. Very Large Databases Conf., pp. 439–450 (1995)Google Scholar
  7. 7.
    Jiang, S., Zhang, X.: ìLIRS: An Efficient Low Inter-Reference Recency Set Replacement Policy to Improve Buffer Cache Performance. In: Proc. SIGMETRICS, pp. 31–42 (2002)Google Scholar
  8. 8.
    Megiddo, N., Modha, D.S.: Arc: A Self-Tuning, Low Overhead Replacement Cache. In: Proc. Second USENIX Conf. File and Storage Technologies (2003)Google Scholar
  9. 9.
    Abdelzaher, T.F., Bhatti, N.: Web Server QoS Management by Adaptive Content Delivery. In: International Workshop on Quality of Service, pp. 216–225 (1999)Google Scholar
  10. 10.
    Golding, R., Bosch, P., Staelin, C., Sullivan, T., Wilkes, J.: Idleness is not Sloth. In: Winter 1995 USENIX Conference, pp. 201–212 (Janaury 1995)Google Scholar
  11. 11.
    Parekh, S., Gandhi, N., Hellerstein, J.L., Tilbury, D., Jayram, T.S., Bigus, J.: Using Control Theory to Achieve Service Level Objectives in Performance Management. In: IFIP/IEEE International Symposium on Integrated Network Management (2001)Google Scholar
  12. 12.
    Lu, Y., Saxena, A., Abdelzaher, T.F.: Differentiated Caching Services; A Control-Theoretical Approach. In: International Conference on Distributed Computing Systems, pp. 615–622 (April 2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Tao Cai
    • 1
  • ShiGuang Ju
    • 1
  • JuenJie Zhao
    • 1
  • DeJiao Niu
    • 1
  1. 1.Department of Computer ScienceJiangSu UniversityJiangSuChina

Personalised recommendations