Остановите войну!
for scientists:
default search action
Michael Kaminsky
- > Home > Persons > Michael Kaminsky
Publications
- 2023
- [c73]Thomas Kim, Jekyeom Jeon, Nikhil Arora, Huaicheng Li, Michael Kaminsky, David G. Andersen, Gregory R. Ganger, George Amvrosiadis, Matias Bjørling:
RAIZN: Redundant Array of Independent Zoned Namespaces. ASPLOS (2) 2023: 660-673 - 2021
- [j18]Huanchen Zhang, Hyeontaek Lim, Viktor Leis, David G. Andersen, Michael Kaminsky, Kimberly Keeton, Andrew Pavlo:
Succinct range filters. Commun. ACM 64(4): 166-173 (2021) - 2020
- [j17]Huanchen Zhang, Hyeontaek Lim, Viktor Leis, David G. Andersen, Michael Kaminsky, Kimberly Keeton, Andrew Pavlo:
Succinct Range Filters. ACM Trans. Database Syst. 45(2): 5:1-5:31 (2020) - [c72]Anuj Kalia, David G. Andersen, Michael Kaminsky:
Challenges and solutions for fast remote persistent memory access. SoCC 2020: 105-119 - [c71]Thomas Kim, Daniel Lin-Kit Wong, Gregory R. Ganger, Michael Kaminsky, David G. Andersen:
High availability in cheap distributed key value storage. SoCC 2020: 165-178 - [c70]Huanchen Zhang, Xiaoxuan Liu, David G. Andersen, Michael Kaminsky, Kimberly Keeton, Andrew Pavlo:
Order-Preserving Key Compression for In-Memory Search Trees. SIGMOD Conference 2020: 1601-1615 - [c69]Sol Boucher, Anuj Kalia, David G. Andersen, Michael Kaminsky:
Lightweight Preemptible Functions. USENIX Annual Technical Conference 2020: 465-477 - [c68]Dong Zhou, Huacheng Yu, Michael Kaminsky, David G. Andersen:
Fast Software Cache Design for Network Appliances. USENIX Annual Technical Conference 2020: 657-671 - [i6]Huanchen Zhang, Xiaoxuan Liu, David G. Andersen, Michael Kaminsky, Kimberly Keeton, Andrew Pavlo:
Order-Preserving Key Compression for In-Memory Search Trees. CoRR abs/2003.02391 (2020) - 2019
- [j16]Anuj Kalia, Michael Kaminsky, David G. Andersen:
Datacenter RPCs Can Be General and Fast. login Usenix Mag. 44(2) (2019) - [c67]Christopher Canel, Thomas Kim, Giulio Zhou, Conglong Li, Hyeontaek Lim, David G. Andersen, Michael Kaminsky, Subramanya Dulloor:
Scaling Video Analytics on Constrained Edge Nodes. MLSys 2019 - [c66]Hyeontaek Lim, David G. Andersen, Michael Kaminsky:
3LC: Lightweight and Effective Traffic Compression for Distributed Machine Learning. MLSys 2019 - [c65]Anuj Kalia, Michael Kaminsky, David G. Andersen:
Datacenter RPCs can be General and Fast. NSDI 2019: 1-16 - [i5]Christopher Canel, Thomas Kim, Giulio Zhou, Conglong Li, Hyeontaek Lim, David G. Andersen, Michael Kaminsky, Subramanya R. Dulloor:
Scaling Video Analytics on Constrained Edge Nodes. CoRR abs/1905.13536 (2019) - [i4]Angela H. Jiang, Daniel L.-K. Wong, Giulio Zhou, David G. Andersen, Jeffrey Dean, Gregory R. Ganger, Gauri Joshi, Michael Kaminsky, Michael Kozuch, Zachary C. Lipton, Padmanabhan Pillai:
Accelerating Deep Learning by Focusing on the Biggest Losers. CoRR abs/1910.00762 (2019) - 2018
- [c64]Huanchen Zhang, Hyeontaek Lim, Viktor Leis, David G. Andersen, Michael Kaminsky, Kimberly Keeton, Andrew Pavlo:
SuRF: Practical Range Query Filtering with Fast Succinct Tries. SIGMOD Conference 2018: 323-336 - [c63]Ziqi Wang, Andrew Pavlo, Hyeontaek Lim, Viktor Leis, Huanchen Zhang, Michael Kaminsky, David G. Andersen:
Building a Bw-Tree Takes More Than Just Buzz Words. SIGMOD Conference 2018: 473-488 - [c62]Angela H. Jiang, Daniel L.-K. Wong, Christopher Canel, Lilia Tang, Ishan Misra, Michael Kaminsky, Michael A. Kozuch, Padmanabhan Pillai, David G. Andersen, Gregory R. Ganger:
Mainstream: Dynamic Stem-Sharing for Multi-Tenant Video Processing. USENIX Annual Technical Conference 2018: 29-42 - [c61]Sol Boucher, Anuj Kalia, David G. Andersen, Michael Kaminsky:
Putting the "Micro" Back in Microservice. USENIX Annual Technical Conference 2018: 645-650 - [i3]Hyeontaek Lim, David G. Andersen, Michael Kaminsky:
3LC: Lightweight and Effective Traffic Compression for Distributed Machine Learning. CoRR abs/1802.07389 (2018) - [i2]Anuj Kalia, Michael Kaminsky, David G. Andersen:
Datacenter RPCs can be General and Fast. CoRR abs/1806.00680 (2018) - [i1]Giulio Zhou, Subramanya Dulloor, David G. Andersen, Michael Kaminsky:
EDF: Ensemble, Distill, and Fuse for Easy Video Labeling. CoRR abs/1812.03626 (2018) - 2017
- [c60]Conglong Li, Matthew K. Mukerjee, David G. Andersen, Srinivasan Seshan, Michael Kaminsky, George Porter, Alex C. Snoeren:
Using Indirect Routing to Recover from Network Traffic Scheduling Estimation Error. ANCS 2017: 13-24 - [c59]Hyeontaek Lim, Michael Kaminsky, David G. Andersen:
Cicada: Dependably Fast Multi-Core In-Memory Transactions. SIGMOD Conference 2017: 21-35 - 2016
- [j15]Sheng Li, Hyeontaek Lim, Victor W. Lee, Jung Ho Ahn, Anuj Kalia, Michael Kaminsky, David G. Andersen, Seongil O, Sukhan Lee, Pradeep Dubey:
Achieving One Billion Key-Value Requests per Second on a Single Server. IEEE Micro 36(3): 94-104 (2016) - [j14]Sheng Li, Hyeontaek Lim, Victor W. Lee, Jung Ho Ahn, Anuj Kalia, Michael Kaminsky, David G. Andersen, Seongil O, Sukhan Lee, Pradeep Dubey:
Full-Stack Architecting to Achieve a Billion-Requests-Per-Second Throughput on a Single Key-Value Store Server Platform. ACM Trans. Comput. Syst. 34(2): 5:1-5:30 (2016) - [j13]Anuj Kalia, Michael Kaminsky, David G. Andersen:
Design Guidelines for High Performance RDMA Systems. login Usenix Mag. 41(3) (2016) - [c58]Hyeontaek Lim, David G. Andersen, Michael Kaminsky:
Towards Accurate and Fast Evaluation of Multi-Stage Log-structured Designs. FAST 2016: 149-166 - [c57]Xiaozhou Li, Raghav Sethi, Michael Kaminsky, David G. Andersen, Michael J. Freedman:
Be Fast, Cheap and in Control with SwitchKV. NSDI 2016: 31-44 - [c56]Anuj Kalia, Michael Kaminsky, David G. Andersen:
FaSST: Fast, Scalable and Simple Distributed Transactions with Two-Sided (RDMA) Datagram RPCs. OSDI 2016: 185-201 - [c55]Huanchen Zhang, David G. Andersen, Andrew Pavlo, Michael Kaminsky, Lin Ma, Rui Shen:
Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes. SIGMOD Conference 2016: 1567-1581 - [c54]Anuj Kalia, Michael Kaminsky, David G. Andersen:
Design Guidelines for High Performance RDMA Systems. USENIX Annual Technical Conference 2016: 437-450 - 2015
- [c53]He Liu, Matthew K. Mukerjee, Conglong Li, Nicolas Feltman, George Papen, Stefan Savage, Srinivasan Seshan, Geoffrey M. Voelker, David G. Andersen, Michael Kaminsky, George Porter, Alex C. Snoeren:
Scheduling techniques for hybrid circuit/packet networks. CoNEXT 2015: 41:1-41:13 - [c52]Sheng Li, Hyeontaek Lim, Victor W. Lee, Jung Ho Ahn, Anuj Kalia, Michael Kaminsky, David G. Andersen, Seongil O, Sukhan Lee, Pradeep Dubey:
Architecting to achieve a billion requests per second throughput on a single key-value store server platform. ISCA 2015: 476-488 - [c51]Anuj Kalia, Dong Zhou, Michael Kaminsky, David G. Andersen:
Raising the Bar for Using GPUs in Software Packet Processing. NSDI 2015: 409-423 - [c50]Dong Zhou, Bin Fan, Hyeontaek Lim, David G. Andersen, Michael Kaminsky, Michael Mitzenmacher, Ren Wang, Ajaypal Singh:
Scaling Up Clustered Network Appliances with ScaleBricks. SIGCOMM 2015: 241-254 - 2014
- [j12]Wyatt Lloyd, Michael J. Freedman, Michael Kaminsky, David G. Andersen:
Don't settle for eventual consistency. Commun. ACM 57(5): 61-68 (2014) - [j11]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, H. Colleen Stuart, Daniel Paul Barrett, Aditya Akella, David G. Andersen, John W. Byers, Laura Dabbish, Michael Kaminsky, Sara B. Kiesler, Jon M. Peha, Adrian Perrig, Srinivasan Seshan, Marvin A. Sirbu, Peter Steenkiste:
XIA: architecting a more trustworthy and evolvable internet. Comput. Commun. Rev. 44(3): 50-57 (2014) - [c49]Iulian Moraru, David G. Andersen, Michael Kaminsky:
Paxos Quorum Leases: Fast Reads Without Sacrificing Writes. SoCC 2014: 22:1-22:13 - [c48]Bin Fan, David G. Andersen, Michael Kaminsky, Michael Mitzenmacher:
Cuckoo Filter: Practically Better Than Bloom. CoNEXT 2014: 75-88 - [c47]Xiaozhou Li, David G. Andersen, Michael Kaminsky, Michael J. Freedman:
Algorithmic improvements for fast concurrent Cuckoo hashing. EuroSys 2014: 27:1-27:14 - [c46]Hyeontaek Lim, Dongsu Han, David G. Andersen, Michael Kaminsky:
MICA: A Holistic Approach to Fast In-Memory Key-Value Storage. NSDI 2014: 429-444 - [c45]Anuj Kalia, Michael Kaminsky, David G. Andersen:
Using RDMA efficiently for key-value services. SIGCOMM 2014: 295-306 - 2013
- [j10]Bin Fan, David G. Andersen, Michael Kaminsky:
Cuckoo Filter: Better Than Bloom. login Usenix Mag. 38(4) (2013) - [j9]Wyatt Lloyd, Michael J. Freedman, Michael Kaminsky, David G. Andersen:
A Short Primer on Causal Consistency. login Usenix Mag. 38(4) (2013) - [c44]Hyeontaek Lim, David G. Andersen, Michael Kaminsky:
Practical Batch-Updatable External Hashing with Sorting. ALENEX 2013: 173-182 - [c43]Hrishikesh Amur, Wolfgang Richter, David G. Andersen, Michael Kaminsky, Karsten Schwan, Athula Balachandran, Erik Zawadzki:
Memory-efficient groupby-aggregate using compressed buffer trees. SoCC 2013: 18:1-18:16 - [c42]Dong Zhou, Bin Fan, Hyeontaek Lim, Michael Kaminsky, David G. Andersen:
Scalable, high performance ethernet forwarding with CuckooSwitch. CoNEXT 2013: 97-108 - [c41]Bin Fan, Dong Zhou, Hyeontaek Lim, Michael Kaminsky, David G. Andersen:
When Cycles Are Cheap, Some Tables Can Be Huge. HotOS 2013 - [c40]Wyatt Lloyd, Michael J. Freedman, Michael Kaminsky, David G. Andersen:
Stronger Semantics for Low-Latency Geo-Replicated Storage. NSDI 2013: 313-328 - [c39]Bin Fan, David G. Andersen, Michael Kaminsky:
MemC3: Compact and Concurrent MemCache with Dumber Caching and Smarter Hashing. NSDI 2013: 371-384 - [c38]Iulian Moraru, David G. Andersen, Michael Kaminsky, Niraj Tolia, Parthasarathy Ranganathan, Nathan L. Binkert:
Consistent, durable, and safe memory management for byte-addressable non volatile main memory. TRIOS@SOSP 2013: 1:1-1:17 - [c37]Iulian Moraru, David G. Andersen, Michael Kaminsky:
There is more consensus in Egalitarian parliaments. SOSP 2013: 358-372 - [c36]Dong Zhou, David G. Andersen, Michael Kaminsky:
Space-Efficient, High-Performance Rank and Select Structures on Uncompressed Bit Sequences. SEA 2013: 151-163 - 2012
- [c34]Vijay Vasudevan, Michael Kaminsky, David G. Andersen:
Using vector interfaces to deliver millions of IOPS from a networked key-value storage server. SoCC 2012: 8 - 2011
- [j8]David G. Andersen, Jason Franklin, Michael Kaminsky, Amar Phanishayee, Lawrence Tan, Vijay Vasudevan:
FAWN: a fast array of wimpy nodes. Commun. ACM 54(7): 101-109 (2011) - [j6]Vijay Vasudevan, David G. Andersen, Michael Kaminsky, Jason Franklin, Michael A. Kozuch, Iulian Moraru, Padmanabhan Pillai, Lawrence Tan:
Challenges and opportunities for efficient computing with FAWN. ACM SIGOPS Oper. Syst. Rev. 45(1): 34-44 (2011) - [c33]Bin Fan, Hyeontaek Lim, David G. Andersen, Michael Kaminsky:
Small cache, big effect: provable load balancing for randomly partitioned cluster services. SoCC 2011: 23 - [c32]Hamid Hajabdolali Bazzaz, Malveeka Tewari, Guohui Wang, George Porter, T. S. Eugene Ng, David G. Andersen, Michael Kaminsky, Michael A. Kozuch, Amin Vahdat:
Switching the optical divide: fundamental challenges for hybrid electrical/optical datacenter networks. SoCC 2011: 30 - [c31]Dongsu Han, David G. Andersen, Michael Kaminsky, Konstantina Papagiannaki, Srinivasan Seshan:
Hulu in the neighborhood. COMSNETS 2011: 1-10 - [c30]Vijay Vasudevan, David G. Andersen, Michael Kaminsky:
The Case for VOS: The Vector Operating System. HotOS 2011 - [c29]Anirudh Badam, Michael Kaminsky, Dongsu Han, Konstantina Papagiannaki, David G. Andersen, Srinivasan Seshan:
The hare and the tortoise: taming wireless losses by exploiting wired reliability. MobiHoc 2011: 7 - [c28]Hyeontaek Lim, Bin Fan, David G. Andersen, Michael Kaminsky:
SILT: a memory-efficient, high-performance key-value store. SOSP 2011: 1-13 - [c27]Wyatt Lloyd, Michael J. Freedman, Michael Kaminsky, David G. Andersen:
Don't settle for eventual: scalable causal consistency for wide-area storage with COPS. SOSP 2011: 401-416 - 2010
- [c26]Bin Fan, David G. Andersen, Michael Kaminsky, Konstantina Papagiannaki:
Balancing throughput, robustness, and in-order delivery in P2P VoD. CoNEXT 2010: 10 - [c25]Vijay Vasudevan, David G. Andersen, Michael Kaminsky, Lawrence Tan, Jason Franklin, Iulian Moraru:
Energy-efficient cluster computing with FAWN: workloads and implications. e-Energy 2010: 195-204 - [c24]Kanat Tangwongsan, Himabindu Pucha, David G. Andersen, Michael Kaminsky:
Efficient Similarity Estimation for Systems Exploiting Data Redundancy. INFOCOM 2010: 1487-1495 - [c22]Guohui Wang, David G. Andersen, Michael Kaminsky, Konstantina Papagiannaki, T. S. Eugene Ng, Michael Kozuch, Michael P. Ryan:
c-Through: part-time optics in data centers. SIGCOMM 2010: 327-338 - 2009
- [c21]Guohui Wang, David G. Andersen, Michael Kaminsky, Michael Kozuch, T. S. Eugene Ng, Konstantina Papagiannaki, Madeleine Glick, Lily B. Mummert:
Your Data Center Is a Router: The Case for Reconfigurable Optical Circuit Switched Paths. HotNets 2009 - [c19]Vijay Vasudevan, Jason Franklin, David G. Andersen, Amar Phanishayee, Lawrence Tan, Michael Kaminsky, Iulian Moraru:
FAWNdamentally Power-efficient Clusters. HotOS 2009 - [c17]Dongsu Han, David G. Andersen, Michael Kaminsky, Konstantina Papagiannaki, Srinivasan Seshan:
Access Point Localization Using Local Signal Strength Gradient. PAM 2009: 99-108 - [c15]David G. Andersen, Jason Franklin, Michael Kaminsky, Amar Phanishayee, Lawrence Tan, Vijay Vasudevan:
FAWN: a fast array of wimpy nodes. SOSP 2009: 1-14 - 2008
- [j3]Szymon Jakubczak, David G. Andersen, Michael Kaminsky, Konstantina Papagiannaki, Srinivasan Seshan:
Link-alike: using wireless to share network resources in a neighborhood. ACM SIGMOBILE Mob. Comput. Commun. Rev. 12(4): 1-14 (2008) - [c13]Dongsu Han, Aditiya Agarwala, David G. Andersen, Michael Kaminsky, Konstantina Papagiannaki, Srinivasan Seshan:
Mark-and-sweep: getting the "inside" scoop on neighborhood networks. Internet Measurement Conference 2008: 99-104 - [c11]Himabindu Pucha, Michael Kaminsky, David G. Andersen, Michael Kozuch:
Adaptive File Transfers for Diverse Environments. USENIX Annual Technical Conference 2008: 157-170 - 2007
- [c9]Himabindu Pucha, David G. Andersen, Michael Kaminsky:
Exploiting Similarity for Multi-Source Downloads Using File Handprints. NSDI 2007 - 2006
- [c6]Niraj Tolia, Michael Kaminsky, David G. Andersen, Swapnil Patil:
An Architecture for Internet Data Transfer. NSDI 2006
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint