Daniel ("Danner") Stodolsky

Former PhD candidate in the Carnegie Mellon University School of Computer Science.

Where is Danner?

Currently at Google in Cambrige, MA. Employment opportunities are available in locations world-wide for both new graduates and experienced personnel.

Public profile at LinkedIn

Past Research Areas

  • Network-Attached Storage, Disk Arrays and Filesystems (Parallel Data Lab)
  • Multicomputing
  • Operating Systems ( Mach )
  • Operations Research (particularly combinatorial optimization)

    • Publications

  • Postscript and Abstract of "Informed Prefetching and Caching", 15th SOSP, Dec 1995.
  • Postscript and HTML of "The Scotch Parallel Storage Systems," IEEE Compcon Conference, May 5-8, 1995.
  • "Parity-Logging Disk Arrays", ACM Transactions on Computer Systems, 12(3):206-235, August 1994. ( Postscript and abstract of an expanded tech report version.)
  • Postscript for "Fast Interrupt Priority Management in Operating System Kernels," USENIX Symposium on Microkernels and Other Kernel Architectures, 1993.
  • Postscript for "Parity Logging: Overcoming the Small Write Problem in Redundant Disk Arrays," Proceedings of the 20th Annual International Symposium on Computer Architecture, 1993.
  • Postscript for "A Redundant Disk Array Architecture for Efficient Small Writes," CMU-CS-93-200, 1993.
  • "A Note on Exploiting the Hamiltonian Cycle Problem Substructure of the Asymmetric Traveling Salesman Problem," Operations Research Letters, 10(3):173-6, April, 1991.

    • Talks

  • "Initial SPFS design rationale", Multicomputer lunch series, Jan 31, 1995. 23 Slides (188K of GIFs). Local access only

    • Prior Education

  • M.S. Mathematics, Carnegie Mellon University, 1990.
  • B.S. Mathematics, Carnegie Mellon University, 1990.
  • B.S. Chemistry, Carnegie Mellon University, 1990.
    • Email: danner at google.com

    danner+@cs.cmu.edu