Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleAugust 2024
Lotto: secure participant selection against adversarial servers in federated learning
SEC '24: Proceedings of the 33rd USENIX Conference on Security SymposiumArticle No.: 20, Pages 343–360In Federated Learning (FL), many privacy-enhancing techniques, such as secure aggregation and distributed differential privacy, provide security guarantees under the assumption of having an honest majority among participants. However, an adversarial ...
- research-articleApril 2024
Noctua: Towards Automated and Practical Fine-grained Consistency Analysis
EuroSys '24: Proceedings of the Nineteenth European Conference on Computer SystemsPages 704–719https://doi.org/10.1145/3627703.3629570Relaxing strong consistency plays a vital role in achieving scalability and availability for geo-replicated web applications. However, making relaxation correct in modern implementations, typically written in dynamic languages and utilizing high-level ...
Dordis: Efficient Federated Learning with Dropout-Resilient Differential Privacy
EuroSys '24: Proceedings of the Nineteenth European Conference on Computer SystemsPages 472–488https://doi.org/10.1145/3627703.3629559Federated learning (FL) is increasingly deployed among multiple clients to train a shared model over decentralized data. To address privacy concerns, FL systems need to safeguard the clients' data from disclosure during training and control data leakage ...
- research-articleNovember 2021
Citadel: Protecting Data Privacy and Model Confidentiality for Collaborative Learning
- Chengliang Zhang,
- Junzhe Xia,
- Baichen Yang,
- Huancheng Puyang,
- Wei Wang,
- Ruichuan Chen,
- Istemi Ekin Akkus,
- Paarijaat Aditya,
- Feng Yan
SoCC '21: Proceedings of the ACM Symposium on Cloud ComputingPages 546–561https://doi.org/10.1145/3472883.3486998Many organizations own data but have limited machine learning expertise (data owners). On the other hand, organizations that have expertise need data from diverse sources to train truly generalizable models (model owners). With the advancement of ...
- research-articleOctober 2021
Gradient Compression Supercharged High-Performance Data Parallel DNN Training
SOSP '21: Proceedings of the ACM SIGOPS 28th Symposium on Operating Systems PrinciplesPages 359–375https://doi.org/10.1145/3477132.3483553Gradient compression is a promising approach to alleviating the communication bottleneck in data parallel deep neural network (DNN) training by significantly reducing the data volume of gradients for synchronization. While gradient compression is being ...
-
- research-articleAugust 2021
Lessons learned from migrating complex stateful applications onto serverless platforms
APSys '21: Proceedings of the 12th ACM SIGOPS Asia-Pacific Workshop on SystemsPages 89–96https://doi.org/10.1145/3476886.3477510Serverless computing is increasingly seen as a pivot cloud computing paradigm that has great potential to simplify application development while removing the burden of operational tasks from developers. Despite these advantages, the use of serverless ...
- research-articleJune 2021
Efficient GPU Sharing for Serverless Workflows
- Klaus Satzke,
- Istemi Ekin Akkus,
- Ruichuan Chen,
- Ivica Rimac,
- Manuel Stein,
- Andre Beck,
- Paarijaat Aditya,
- Manohar Vanga,
- Volker Hilt
HiPS '21: Proceedings of the 1st Workshop on High Performance Serverless ComputingPages 17–24https://doi.org/10.1145/3452413.3464785Serverless computing has emerged as a new cloud computing paradigm, where an application consists of individual functions that can be separately managed and executed. However, the function development environment of all serverless computing frameworks ...
- research-articleOctober 2018
ApproxJoin: Approximate Distributed Joins
- Do Le Quoc,
- Istemi Ekin Akkus,
- Pramod Bhatotia,
- Spyros Blanas,
- Ruichuan Chen,
- Christof Fetzer,
- Thorsten Strufe
SoCC '18: Proceedings of the ACM Symposium on Cloud ComputingPages 426–438https://doi.org/10.1145/3267809.3267834A distributed join is a fundamental operation for processing massive datasets in parallel. Unfortunately, computing an equi-join over such datasets is very resource-intensive, even when done in parallel. Given this cost, the equi-join operator becomes a ...
- ArticleJuly 2018
SAND: towards high-performance serverless computing
- Istemi Ekin Akkus,
- Ruichuan Chen,
- Ivica Rimac,
- Manuel Stein,
- Klaus Satzke,
- Andre Beck,
- Paarijaat Aditya,
- Volker Hilt
USENIX ATC '18: Proceedings of the 2018 USENIX Conference on Usenix Annual Technical ConferencePages 923–935Serverless computing has emerged as a new cloud computing paradigm, where an application consists of individual functions that can be separately managed and executed. However, existing serverless platforms normally isolate and execute functions in ...
- research-articleDecember 2017
StreamApprox: approximate computing for stream analytics
Middleware '17: Proceedings of the 18th ACM/IFIP/USENIX Middleware ConferencePages 185–197https://doi.org/10.1145/3135974.3135989Approximate computing aims for efficient execution of workflows where an approximate output is sufficient instead of the exact output. The idea behind approximate computing is to compute over a representative sample instead of the entire input dataset. ...
- research-articleDecember 2017
Sieve: actionable insights from monitored metrics in distributed systems
- Jörg Thalheim,
- Antonio Rodrigues,
- Istemi Ekin Akkus,
- Pramod Bhatotia,
- Ruichuan Chen,
- Bimal Viswanath,
- Lei Jiao,
- Christof Fetzer
Middleware '17: Proceedings of the 18th ACM/IFIP/USENIX Middleware ConferencePages 14–27https://doi.org/10.1145/3135974.3135977Major cloud computing operators provide powerful monitoring tools to understand the current (and prior) state of the distributed systems deployed in their infrastructure. While such tools provide a detailed monitoring mechanism at scale, they also pose ...
- research-articleNovember 2017
Towards Reliable Application Deployment in the Cloud
CoNEXT '17: Proceedings of the 13th International Conference on emerging Networking EXperiments and TechnologiesPages 464–477https://doi.org/10.1145/3143361.3143388A common practice to increase the reliability of a cloud application is to deploy redundant instances. Unfortunately such redundancy efforts can be undermined if the application's instances share common dependencies. This paper presents ReCloud, a novel ...
- ArticleJuly 2017
PrivApprox: privacy-preserving stream analytics
USENIX ATC '17: Proceedings of the 2017 USENIX Conference on Usenix Annual Technical ConferencePages 659–672How to preserve users' privacy while supporting high-utility analytics for low-latency stream processing?
To answer this question: we describe the design, implementation and evaluation of PRIVAPPROX, a data analytics system for privacy-preserving stream ...
- research-articleApril 2017
Building and Analyzing a Global Co-Authorship Network Using Google Scholar Data
WWW '17 Companion: Proceedings of the 26th International Conference on World Wide Web CompanionPages 1219–1224https://doi.org/10.1145/3041021.3053056By publishing papers together, academic authors can form a co-authorship network, modeling the collaboration among them. This paper presents a data-driven study by crawling and analyzing the vast majority of author profiles of Google Scholar. We make ...
- ArticleJune 2016
Online Algorithm for Approximate Quantile Queries on Sliding Windows
SEA 2016: Proceedings of the 15th International Symposium on Experimental Algorithms - Volume 9685Pages 369–384https://doi.org/10.1007/978-3-319-38851-9_25Estimating statistical information about the most recent parts of a stream is an important problem in network and cloud monitoring. Modern cloud infrastructures generate in high volume and high velocity various measurements on CPU, memory and storage ...
- ArticleMarch 2016
AnonRep: towards tracking-resistant anonymous reputation
NSDI'16: Proceedings of the 13th Usenix Conference on Networked Systems Design and ImplementationPages 583–596Reputation systems help users evaluate information quality and incentivize civilized behavior, often by tallying feedback from other users such as "likes" or votes and linking these scores to a user's long-term identity. This identity linkage enables ...
- ArticleOctober 2014
Heading off correlated failures through independence-as-a-service
OSDI'14: Proceedings of the 11th USENIX conference on Operating Systems Design and ImplementationPages 317–334Today's systems pervasively rely on redundancy to ensure reliability. In complex multi-layered hardware/software stacks, however - especially in the clouds where many independent businesses deploy interacting services on common infrastructure - ...
- research-articleNovember 2013
An untold story of redundant clouds: making your service deployment truly reliable
HotDep '13: Proceedings of the 9th Workshop on Hot Topics in Dependable SystemsArticle No.: 3, Pages 1–6https://doi.org/10.1145/2524224.2524231To enhance the reliability of cloud services, many application providers leverage multiple cloud providers for redundancy. Unfortunately, such techniques fail to recognize that seemingly independent redundant clouds may share third-party infrastructure ...
- research-articleAugust 2013
SplitX: high-performance private analytics
SIGCOMM '13: Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMMPages 315–326https://doi.org/10.1145/2486001.2486013There is a growing body of research on mechanisms for preserving online user privacy while still allowing aggregate queries over private user data. A common approach is to store user data at users' devices, and to query the data in such a way that a ...
Also Published in:
ACM SIGCOMM Computer Communication Review: Volume 43 Issue 4 - ArticleJanuary 2013
A holistic immune system against active P2P worms
ICOIN '13: Proceedings of the 2013 International Conference on Information Networking (ICOIN)Pages 24–29https://doi.org/10.1109/ICOIN.2013.6496346Active Peer-to-Peer (P2P) worms present serious threats to the global Internet by exploiting popular P2P applications to perform rapid topological self-propagation. Active P2P worms pose more deadly threats than normal scanning worms because they do not ...