Mark Lillibridge

Photo of Mark Lillibridge
Principal research scientist
Systems Research Lab
Palo Alto

Biography

Mark Lillibridge is a principal research scientist at Hewlett Packard Labs, where he currently works on applying hashing and chunking to improve storage and communication, and on transaction processing. Mark joined HP Labs in 2002 when HP acquired Compaq and its research labs. He received his PhD in computer science from Carnegie Mellon in 1997 where he worked on higher-order module systems for programming languages. His research interests include storage, security, peer-to-peer computing, programming languages, and transaction processing.

 

Publications

 

Refereed Journal Publications

Xiaozhou Li, Mark Lillibridge, and Mustafa Uysal. Reliability Analysis of Deduplicated and Erasure-Coded Storage. (abstract) (citeseerx) SIGMETRICS Performance Evaluation Review, 38 (3):4-9, December 2010. (Also available as HPL-2010-146.)

Mark Lillibridge. Unchecked Exceptions Can be Strictly More Powerful Than Call/CC. (abstract) (citeseerx) Higher-Order and Symbolic Computation, 12 (1):75-104, April 1999.

Robert Harper and Mark Lillibridge. Operational interpretations of an extension of F-omega with control operators. (abstract) (citeseerx) Journal of Functional Programming, 6(3):393-418, May 1996.

Robert Harper and Mark Lillibridge. Polymorphic type assignment and CPS conversion. (abstract) (erratum) (citeseerx) LISP and Symbolic Computation, 6(4):361-380, November 1993.

 

Refereed Conference and Workshop Publications

Goetz Graefe, Mark Lillibridge, Harumi Kuno, Joseph Tucek, and Alistair Veitch. Controlled Lock Violation. (abstract) In Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data (SIGMOD '13), pp. 85-96, New York, NY, USA, June 2013.

Mark Lillibridge, Kave Eshghi, and Deepavali Bhagwat. Improving Restore Speed for Backup Systems that Use Inline Chunk-Based Deduplication. (abstract) In Proceedings of the 11nd USENIX Conference on File and Storage Technologies (FAST'13), pp. 183-197, San Jose, California, February 2013. (Also available as HPL-2013-41.)

Mai Zheng, Joseph Tucek, Feng Qin, and Mark Lillibridge. Understanding the Robustness of SSDs under Power Fault. (abstract) In Proceedings of the 11nd USENIX Conference on File and Storage Technologies (FAST'13), pp. 271-284, San Jose, California, February 2013.

Xiaozhou Li, Mark Lillibridge, and Mustafa Uysal. Reliability Analysis of Deduplicated and Erasure-Coded Storage. (abstract) (draft distributed before workshop) Presented at the Third Workshop on Hot Topics in Measurement and Modeling of Computer Systems (HotMetrics 2010), New York City, NY, USA, June 18, 2010. (A revised version of the paper was published in the December 2010 issue of SIGMETRICS's Performance Evaluation Review.)

Deepavali Bhagwat, Kave Eshghi, Darrell Long, and Mark Lillibridge. Extreme Binning: Scalable, Parallel Deduplication for File Backup. (abstract) (citeseerx) In Proceedings of the 17th IEEE/ACM International Symposium on Modelling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS'2009), pp. 237-245, London, UK, September 21-23, 2009. (Also available as HPL-2009-10R2.)

Mark Lillibridge, Kave Eshghi, Deepavali Bhagwat, Vinay Deolalikar, Gregory Trezise, and Peter Camble. Sparse Indexing: Large Scale, Inline Deduplication Using Sampling and Locality. (abstract) (citeseerx) In Proceedings of the 7nd USENIX Conference on File and Storage Technologies (FAST'09), pp. 111-124, San Francisco, California, February 2009. (Also available as HPL-2009-122.)

Marcos Aguilera, Mark Lillibridge, and Xiaozhou Li. Transaction rate limiters for peer-to-peer systems. (abstract) In Proceedings of the International Conference on Peer-to-Peer Computing 2008, pp. 3-11, Aachen, Germany, September 2008. (Also available as HPL-2008-142.)

Kave Eshghi, Mark Lillibridge, Lawrence Wilcock, Guillaume Belrose, and Rycharde Hawkes. Jumbo Store: Providing Efficient Incremental Upload and Versioning for a Utility Rendering Service. (abstract) (citeseerx) In Proceedings of the 5nd USENIX Conference on File and Storage Technologies (FAST'07), pp. 123-138, San Jose, California, February 2007. (Also available as HPL-2006-144R1.)

Mark Lillibridge, Sameh Elnikety, Andrew Birrell, Mike Burrows, and Michael Isard. A Cooperative Internet Backup Scheme. (abstract) (citeseerx) In Proceedings of the 2003 Usenix Annual Technical Conference (General Track), pp. 29-41, San Antonio, Texas, June 2003.

Marcos K. Aguilera, Minwen Ji, Mark Lillibridge, John MacCormick, Erwin Oertli, Dave Anderson, Mike Burrows, Timothy Mann, and Chandramohan A. Thekkath. Block-Level Security for Network-Attached Disks. (abstract) (citeseerx) In Proceedings of the 2nd USENIX Conference on File and Storage Technologies (FAST'03), pp. 159-174, San Francisco, California, March 2003.

Cormac Flanagan, K. Rustan M. Leino, Mark Lillibridge, Greg Nelson, James B. Saxe, and Raymie Stata. Extended static checking for Java. (abstract) (citeseerx) In Proceedings of the ACM SIGPLAN 2002 Conference on Programming Language Design and Implementation (PLDI), pp. 234-245, Berlin, Germany, June 2002. [Most Influential 2002 PLDI Paper Award; judged after 10 years.]

Philippe Golle, Kevin Leyton-Brown, Ilya Mironov, and Mark Lillibridge. Incentives for Sharing in Peer-to-Peer Networks. (abstract) (citeseerx) In Proceedings of the Second International Workshop on Electronic Commerce (WELCOM'01), volume 2232 of Springer-Verlag lecture notes in computer science. Springer-Verlag, November 2001.

Robert Harper and Mark Lillibridge. A type-theoretic approach to higher-order modules with sharing. (abstract) (citeseerx) In Proceedings of the Twenty-First ACM Symposium on Principles of Programming Languages, pp. 123-137, Portland, OR, January 1994. (Also available as CMU-CS-93-197.)

Robert Harper and Mark Lillibridge. Explicit polymorphism and CPS conversion. (abstract) (citeseerx) In Proceedings of the Twentieth ACM Symposium on Principles of Programming Languages, pp. 206-219, Charleston, SC, January 1993. (Also available as CMU-CS-92-210.)

Robert Harper and Mark Lillibridge. Polymorphic type assignment and CPS conversion. (abstract) In Oliver Danvy and Carolyn Talcott, editors, Proceedings of the ACM SIGPLAN Workshop on Continuations CW92, pp. 13-22, Stanford, CA, June 1992. (Also available as CMU-CS-92-122.)

 

Unrefereed Publications

Rajan M. Lukose and Mark Lillibridge. DataBank: An Economics Based Privacy Preserving System for Distributing Relevant Advertising and Content. (abstract) Technical report HPL-2006-95, HP Labs, Hewlett-Packard Co., June 26, 2006.

Minwen Ji, Tom Rodeheffer, Marcos Aguilera, and Mark Lillibridge. Generating Unforgeable Evidence for Secure Communications. (abstract) Technical report HPL-2005-71, HP Labs, Hewlett-Packard Co., April 2005.

Mark Lillibridge. Translucent Sums: A Foundation for Higher-Order Module Systems. (abstract, 14 page summary, .dvi version, .ps version, citeseerx) Ph.D. Thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, May 1997. (Also available as CMU-CS-97-122.)

Mark Lillibridge. Exceptions are strictly more powerful than Call/CC. (abstract) (citeseerx) Technical Report CMU-CS-95-178, School of Computer Science, Carnegie Mellon University, July 1995.

Robert Harper and Mark Lillibridge. ML with callcc is unsound. Announcement on the TYPES electronic forum, July 1991.

 

Patents

Mark has 31 issued patents.