skip to main content
research-article
Free Access

Immutability Changes Everything: We need it, we can afford it, and the time is now.

Published:21 November 2015Publication History
Skip Abstract Section

Abstract

There is an inexorable trend toward storing and sending immutable data. We need immutability to coordinate at a distance, and we can afford immutability as storage gets cheaper. This article is an amuse-bouche sampling the repeated patterns of computing that leverage immutability. Climbing up and down the compute stack really does yield a sense of déjà vu all over again.

References

  1. Apache Hadoop; http://en.wikipedia.org/wiki/Apache_ Hadoop.Google ScholarGoogle Scholar
  2. Bernstein, P., Hadzilacos, V., Goodman, N. 1987. Concurrency Control and Recovery in Database Systems. Addison Wesley. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Dean, J., Ghemawat, S. 2004. MapReduce: simplified data processing on large clusters. Sixth Annual Symposium on Operating System Design and Implementation. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vosshall, P., Vogels, W. 2007. Dynamo: Amazon's highly available key-value store. Proceedings of the 21st Annual ACM Symposium on Operating Systems Principles. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Ghemawat, S., Gobioff, H., Leung, S. 2003. The Google File System. Proceedings of the 19th Annual ACM Symposium on Operating Systems Principles. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Gibson, G., Ganger, G. 2011. Principles of operation for shingled disk devices. Carnegie Mellon University Parallel Data Lab Technical Report CMU-PDL-11-107.Google ScholarGoogle Scholar
  7. Helland, P. 2005. Data on the outside versus data on the inside. Proceedings of the Conference on Innovative Database Research.Google ScholarGoogle Scholar
  8. Helland, P. 2014. Heisenberg was on the write track. Abstract: Proceedings of the Conference on Innovative Database Research.Google ScholarGoogle Scholar
  9. Isard, M., Budiu, M., Yu, Y., Birrell, A., Fetterly, D. 2007. Dryad: distributed data-parallel programs from sequential building blocks. Proceedings of the European Conference on Computer Systems. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Karger, D., Lehman, E., Leighton, T., Panigraphy, R., Levine, M., Lewin, D. 1997. Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web. Proceedings of the 29th Annual ACM Symposium on Theory of Computing. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Lamport, L. 1998. The part-time parliament. ACM Transactions on Computer Systems 16(2): 133-169. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Lofgren, K., Normal, R., Thelin, G., Gupta, A. 2003. Wearleveling techniques for flash EEPROM systems. US Patent #6850443 (SanDisk, Western Digital).Google ScholarGoogle Scholar
  13. McKusick, M. Quinlan, S. 2009. GFS: evolution on fast forward. ACM Queue 7(7). Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. New, R., Williams, M. 2003. Log-structured file system for disk drives with shingled writing. US Patent #7996645 (Hitachi).Google ScholarGoogle Scholar
  15. O'Neil, P., Cheng, E., Gawlick, D., O'Neil, E. 1996. The logstructured merge-tree (LSM-tree). Acta Informatica 33(4). Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Rosenblum, M., Ousterhout, J. 1992. The design and implementation of a log-structured file system. ACM Transactions on Computer Systems 10(1): 26-52. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Wikipedia. Turtles all the way down; http://en.wikipedia.org/wiki/Turtles_all_the_way_down.Google ScholarGoogle Scholar
  18. Wikipedia. Write amplification; http://en.wikipedia.org/wiki/Write_amplification.Google ScholarGoogle Scholar

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

  • Published in

    cover image Queue
    Queue  Volume 13, Issue 9
    Structured Data
    November-December 2015
    156 pages
    ISSN:1542-7730
    EISSN:1542-7749
    DOI:10.1145/2857274
    Issue’s Table of Contents

    Copyright © 2015 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 21 November 2015

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • research-article
    • Popular
    • Editor picked

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format .

View HTML Format