Hyeontaek Lim

Hyeontaek Lim is a Research Scientist at Google Brain. He received a Ph.D. in Computer Science from Carnegie Mellon University in 2015 and a B.S. in Computer Science from KAIST in 2009. During his Ph.D. study, he was advised by Professor David G. Andersen and supported in part by the Facebook Fellowship (2012-2013) and the Korea Foundation for Advanced Studies Scholarship (2009-2012). He was a Post Doctoral Fellow in Computer Science Department at Carnegie Mellon University (2015-2018).

• Email: hl_at_cs.cmu.edu
• Google Scholar
• Curriculum Vitae (updated in 2018)

• 3LC: Lightweight and Effective Traffic Compression for Distributed Machine Learning.
  Hyeontaek Lim, David G. Andersen, Michael Kaminsky
  In Proc. SysML 2019.
• Scaling Video Analytics on Constrained Edge Nodes.
  Christopher Canel, Thomas Kim, Giulio Zhou, Conglong Li, Hyeontaek Lim, David G. Andersen, Michael Kaminsky, Subramanya R. Dulloor
  In Proc. SysML 2019.
• Building a Bw-Tree Takes More Than Just Buzz Words.
  Ziqi Wang, Andrew Pavlo, Hyeontaek Lim, Viktor Leis, Huanchen Zhang, Michael Kaminsky, David G. Andersen
  In Proc. ACM SIGMOD 2018. [source code]
• SuRF: Practical Range Query Filtering with Fast Succinct Tries.
  Huanchen Zhang, Hyeontaek Lim, Viktor Leis, David G. Andersen, Michael Kaminsky, Kimberly Keeton, Andrew Pavlo
  In Proc. ACM SIGMOD 2018. Best Paper Award [source code] [demo]
• Cicada: Dependably Fast Multi-Core In-Memory Transactions.
  Hyeontaek Lim, Michael Kaminsky, David G. Andersen.
  In Proc. ACM SIGMOD 2017. [source code]
• Achieving One Billion Key-Value Requests per Second on a Single Server.
  Sheng Li, Hyeontaek Lim, Victor W. Lee, Jung Ho Ahn, Anuj Kalia, Michael Kaminsky, David G. Andersen, Seongil O, Sukhan Lee, Pradeep Dubey.
  In MICRO Top Picks 2016.
• Full-Stack Architecting to Achieve a Billion-Requests-Per-Second Throughput on a Single Key-Value Store Server Platform.
  Sheng Li, Hyeontaek Lim, Victor W. Lee, Jung Ho Ahn, Anuj Kalia, Michael Kaminsky, David G. Andersen, Seongil O, Sukhan Lee, Pradeep Dubey.
  In ACM TOCS 2016.
• Towards Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs.
  Hyeontaek Lim, David G. Andersen, Michael Kaminsky.
  In Proc. USENIX FAST 2016. [source code]
• Scaling Up Clustered Network Appliances with ScaleBricks.
  Dong Zhou, Bin Fan, Hyeontaek Lim, David G. Andersen, Michael Kaminsky, Michael D. Mitzenmacher, Ren Wang, Ajaypal Singh.
  In Proc. ACM SIGCOMM 2015.
• Architecting to Achieve a Billion Requests per Second Throughput on a Single Key-Value Store Server Platform.
  Sheng Li, Hyeontaek Lim, Victor W. Lee, Jung Ho Ahn, Anuj Kalia, Michael Kaminsky, David G. Andersen, Seongil O, Sukhan Lee, Pradeep Dubey.
  In Proc. ACM/IEEE ISCA 2015. Selected as one of IEEE Micro Top Picks. Invited to appear as an extended version at ACM TOCS. [source code]
• XIA: Architecting a More Trustworthy and Evolvable Internet.
  David Naylor, Matthew K. Mukerjee, Patrick Agyapong, Robert Grandl, Ruogu Kang, Michel Machado, Stephanie Brown, Cody Doucette, Hsu-Chun Hsiao, Dongsu Han, Tiffany Hyun-Jin Kim, Hyeontaek Lim, Carol Ovon, Dong Zhou, Soo Bum Lee, Yue-Hsun Lin, Colleen Stuart, Dan Barrett, Aditya Akella, David Andersen, John Byers, Laura Dabbish, Michael Kaminsky, Sara Kiesler, Jon Peha, Adrian Perrig, Srini Seshan, Marvin Sirbu, Peter Steenkiste.
  In ACM SIGCOMM CCR 2014.
• MICA: A Holistic Approach to Fast In-Memory Key-Value Storage.
  Hyeontaek Lim, Dongsu Han, David G. Andersen, and Michael Kaminsky.
  In Proc. USENIX NSDI 2014. [source code (v1)] [source code (v2)]
• Scalable, High Performance Ethernet Forwarding with CuckooSwitch.
  Dong Zhou, Bin Fan, Hyeontaek Lim, Dave Andersen, Michael Kaminsky.
  In Proc. ACM CoNEXT 2013.
• When Cycles Are Cheap, Some Tables Can Be Huge.
  Bin Fan, Dong Zhou, Hyeontaek Lim, Michael Kaminsky, David G. Andersen.
  In Proc. USENIX HotOS 2013.
• Practical Batch-Updatable External Hashing with Sorting.
  Hyeontaek Lim, David G. Andersen, and Michael Kaminsky.
  In Proc. SIAM ALENEX 2013.
• XIA: Efficient Support for Evolvable Internetworking.
  Dongsu Han, Ashok Anand, Fahad Dogar, Boyan Li, Hyeontaek Lim, Michel Machado, Arvind Mukundan, Wenfei Wu, Aditya Akella, David G. Andersen, John W. Byer, Srinivasan Seshan, and Peter Steenkiste.
  In Proc. USENIX NSDI 2012.
• XIA: An Architecture for an Evolvable and Trustworthy Internet.
  Ashok Anand, Fahad Dogar, Dongsu Han, Boyan Li, Hyeontaek Lim, Michel Machado, Wenfei Wu, Aditya Akella, David G. Andersen, John W. Byer, Srinivasan Seshan, and Peter Steenkiste.
  In Proc. ACM HotNets 2011.
• SILT: A Memory-Efficient, High-Performance Key-Value Store.
  Hyeontaek Lim, Bin Fan, David G. Andersen, and Michael Kaminsky.
  In Proc. ACM SOSP 2011. [source code]
• Small Cache, Big Effect: Provable Load Balancing for Randomly Partitioned Cluster Services.
  Bin Fan, Hyeontaek Lim, David G. Andersen, and Michael Kaminsky.
  In Proc. ACM SoCC 2011.
• Transparently Bridging Semantic Gap in CPU Management for Virtualized Environments.
  Hwanju Kim, Hyeontaek Lim, Jinkyu Jeong, Heeseung Jo, Joonwon Lee, and Seungryoul Maeng.
  In Elsevier JPDC 2011.
• Task-Aware Virtual Machine Scheduling for I/O Performance.
  Hwanju Kim, Hyeontaek Lim, Jinkyu Jeong, Heeseung Jo, and Joonwon Lee.
  In Proc. ACM VEE 2009.

• NetMemex: Providing Full-Fidelity Traffic Archival.
  Hyeontaek Lim, Vyas Sekar, Yoshihisa Abe, David G. Andersen.
  Technical Report.
• Resource-Efficient Data-Intensive System Designs for High Performance and Capacity.
  Hyeontaek Lim.
  Ph.D. Thesis.