WOW: Wise Ordering for Writes – Combining spatial and temporal locality in non-volatile caches

FAST 2005 - 4th USENIX Conference on File and Storage Technologies

Volumn , Issue , 2005, Pages 129-142

  Gill, Binny S ^a   Modha, Dharmendra S ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTER OPERATING SYSTEMS; SCHEDULING ALGORITHMS;

CACHING ALGORITHM; DISK SCHEDULING ALGORITHMS; EFFECTIVE ALGORITHMS; EXPERIMENTAL SET UP; SPATIAL AND TEMPORAL LOCALITY; STORAGE PERFORMANCE COUNCIL; TEMPORAL AND SPATIAL; TEMPORAL LOCALITY;

DIGITAL STORAGE;

EID: 84863406545     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)

1. J. Gray and P. J. Shenoy, “Rules of thumb in data engineering,” in ICDE, pp. 3–12, 2000.
2. N. Megiddo and D. S. Modha, “Outperforming LRU with an adaptive replacement cache algorithm,” IEEE Computer, vol. 37, no. 4, pp. 58–65, 2004.
3. B. S. Gill and D. S. Modha, “SARC: Sequential prefetching in adaptive replacement cache,” in USENIX, 2005.
4. S. Bansal and D. S. Modha, “CAR: Clock with adaptive replacement,” in FAST 04, pp. 142–163, 2004.
5. Y. Zhou, Z. Chen, and K. Li, “Second-level buffer cache management,” IEEE Trans. Parallel Distrib. Syst, vol. 15, no. 6, pp. 505–519, 2004.
6. J. Menon and M. Hartung, “The IBM 3990 disk cache,” in Proc. IEEE Comput. Soc. Int. COMPCON Conf., 1988.
7. G. P. Copeland, T. Keller, R. Krishnamurthy, and M. Smith, “The case for safe RAM,” in VLDB, pp. 327–335, 1989.
8. J. Menon, “Performance of RAID5 disk arrays with read and write caching,” Distributed and Parallel Databases, vol. 2, no. 3, pp. 261–293, 1994.
9. J. Menon and J. Cortney, “The architecture of a fault-tolerant cached RAID controller,” in ISCA, pp. 76–86, 1993.
10. K. Treiber and J. Menon, “Simulation study of cached RAID5 designs,” in HPCA, pp. 186–197, 1995.
11. A. Varma and Q. Jacobson, “Destage algorithms for disk arrays with nonvolatile caches,” IEEE Trans. Computers, vol. 47, no. 2, pp. 228–235, 1998.
12. P. Biswas, K. K. Ramakrishnan, and D. Towsley, “Trace driven analysis of write caching policies for disk,” Performance Evaluation Review, vol. 21, no. 1, pp. 12–23, Jun 1993.
13. Y. J. Nam and C. Park, “An adaptive high-low water mark destage algorithm for cached RAID5,” in PRDC, pp. 177–184, 2002.
14. J. K. Ousterhout and F. Douglis, “Beating the I/O bottleneck: A case for log-structured file systems,” Operating Systems Review, vol. 23, no. 1, pp. 11–28, 1989.
15. M. Rosenblum and J. K. Ousterhout, “The design and implementation of a log-structured file system,” ACM Transactions on Computer Systems, vol. 10, no. 1, pp. 26–52, 1992.
16. B. McNutt and S. Johnson, “A standard test of I/O cache,” in Proc. Comput. Measurements Group’s 2001 Int. Conf., 2001.
17. S. A. Johnson, B. McNutt, and R. Reich, “The making of a standard benchmark for open system storage,” J. Comput. Resource Management, no. 101, pp. 26–32, Winter 2001.
18. M. Baker, S. Asami, E. Deprit, J. Ousterhout, and M. Seltzer, “Non-volatile memory for fast, reliable file systems,” in Operating Systems Review, vol. 26, pp. 10–22, October 1992.
19. P. Biswas, K. Ramakrishnan, D. Towsley, and C. Krishna, “Performance analysis of distributed file systems with nonvolatile caches,” in Proc. 2nd Int. Symp. High Perf. Distributed Computing, pp. 252–262, 1993.
20. W. W. Hsu, A. J. Smith, and H. C. Young, “I/O reference behavior of production database workloads and the TPC benchmarks - an analysis at the logical level,” ACM Trans. Database Syst., vol. 26, no. 1, pp. 96–143, 2001.
21. L. Huang and T. Chiueh, “Experiences in building a software-based SATF scheduler,” Tech. Rep. ECSL-TR81, SUNY at Stony Brook, July 2001.
22. F. J. Corbató, “A paging experiment with the multics system,” in In Honor of P. M. Morse, pp. 217–228, MIT Press, 1969.
23. Also as MIT Project MAC Report MAC-M-384, May 1968.
24. E. G. Coffman and P. J. Denning, Operating Systems Theory. Englewood Cliffs, NJ: Prentice-Hall, 1973.
25. M. Seltzer, P. Chen, and J. Ousterhout, “Disk scheduling revisited,” in Proc. USENIX Winter Tech. Conf., pp. 313–324, 1990.
26. D. M. Jacobson and J. Wilkes, “Disk scheduling algorithms based on rotational position,” tech. rep., HPL-CSP-91-7, HP Labs, Mar 1991.
27. B. L. Worthington, G. R. Ganger, and Y. N. Patt, “Scheduling algorithms for modern disk drives,” in SIGMETRICS, pp. 241–251, 1994.
28. E. G. Coffman, L. A. Klimko, and B. Ryan, “Analysis of scanning policies for reducing disk seek times,” SIAM J. Comput., vol. 1, no. 3, pp. 269–279, 1972.
29. P. J. Denning, “Effects of scheduling on file memory operations,” in Proc. AFIPS Spring Joint Comput. Conf., pp. 9–21, 1967.
30. P. H. Seaman, R. A. Lind, and T. L. Wilson, “An analysis of auxiliary-storage activity,” IBM Systems Journal, vol. 5, no. 3, pp. 158–170, 1966.
31. A. G. Merten, Some quantitative techniques for file organization. PhD thesis, University of Wisconsin, 1970.
32. R. Geist and S. Daniel, “A continuum of disk scheduling algorithms,” ACM Trans. Comput. Syst., vol. 5, no. 1, pp. 77–92, 1987.
33. T. R. Haining, Non-volatile Cache Management For Improving Write Response Time with Rotating Magnetic Media. PhD thesis, Ph.D. Dissertation, University of California, Santa Cruz, 2000.
34. J.-F. Paris, T. R. Haining, and D. D. E. Long, “A stack model based replacement policy for a non-volatile cache,” in Proc. IEEE Sym. Mass Storage Sys., pp. 217–224, March 2000.