activity
20132023
most citedServerless Computing: One Step Forward, Two Steps Back

232 citations · 685 across the 13 of their papers we have counts for

collaborators

14 papers

cs.CR2023★ 1 cited

SPECWANDS: An Efficient Priority-based Scheduler Against Speculation Contention Attacks

Bowen Tang, Chenggang Wu, Pen-Chung Yew +7

Transient Execution Attacks (TEAs) have gradually become a major security threat to modern high-performance processors. They exploit the vulnerability of speculative execution to i…

cs.CR2023

Khaos: The Impact of Inter-procedural Code Obfuscation on Binary Diffing Techniques

Peihua Zhang, Chenggang Wu, Mingfan Peng +6

Software obfuscation techniques can prevent binary diffing techniques from locating vulnerable code by obfuscating the third-party code, to achieve the purpose of protecting embedd…

cs.CR2022★ 5 cited

FuncFooler: A Practical Black-box Attack Against Learning-based Binary Code Similarity Detection Methods

Lichen Jia, Bowen Tang, Chenggang Wu +6

The binary code similarity detection (BCSD) method measures the similarity of two binary executable codes. Recently, the learning-based BCSD methods have achieved great success, ou…

cs.CV2021

DVHN: A Deep Hashing Framework for Large-scale Vehicle Re-identification

Yongbiao Chen, Sheng Zhang, Fangxin Liu +3

In this paper, we make the very first attempt to investigate the integration of deep hash learning with vehicle re-identification. We propose a deep hash-based vehicle re-identific…

cs.CR2021

SpecBox: A Label-Based Transparent Speculation Scheme Against Transient Execution Attacks

Bowen Tang, Chenggang Wu, Zhe Wang +6

Speculative execution techniques have been a cornerstone of modern processors to improve instruction-level parallelism. However, recent studies showed that this kind of techniques…

cs.DC2020★ 6 cited

Optimizing Prediction Serving on Low-Latency Serverless Dataflow

Vikram Sreekanti, Harikaran Subbaraj, Chenggang Wu +2

Prediction serving systems are designed to provide large volumes of low-latency inferences machine learning models. These systems mix data processing and computationally intensive…

cs.DC2020

A Fault-Tolerance Shim for Serverless Computing

Vikram Sreekanti, Chenggang Wu, Saurav Chhatrapati +3

Serverless computing has grown in popularity in recent years, with an increasing number of applications being built on Functions-as-a-Service (FaaS) platforms. By default, FaaS pla…

cs.DC2020★ 227 cited

Cloudburst: Stateful Functions-as-a-Service

Vikram Sreekanti, Chenggang Wu, Xiayue Charles Lin +5

Function-as-a-Service (FaaS) platforms and "serverless" cloud computing are becoming increasingly popular. Current FaaS offerings are targeted at stateless functions that do minima…

cs.DB2019★ 207 cited

Deep Unsupervised Cardinality Estimation

Zongheng Yang, Eric Liang, Amog Kamsetty +7

Cardinality estimation has long been grounded in statistical tools for density estimation. To capture the rich multivariate distributions of relational tables, we propose the use o…

cs.DC2018★ 232 cited

Serverless Computing: One Step Forward, Two Steps Back

Joseph M. Hellerstein, Jose Faleiro, Joseph E. Gonzalez +4

Serverless computing offers the potential to program the cloud in an autoscaling, pay-as-you go manner. In this paper we address critical gaps in first-generation serverless comput…

cs.DB2018★ 2 cited

Eliminating Boundaries in Cloud Storage with Anna

Chenggang Wu, Vikram Sreekanti, Joseph M. Hellerstein

In this paper, we describe how we extended a distributed key-value store called Anna into an elastic, multi-tier service for the cloud. In its extended form, Anna is designed to ov…

cs.GT2016★ 4 cited

Approximation of barter exchanges with cycle length constraints

Suiqian Luo, Pingzhong Tang, Chenggang Wu +1

We explore the clearing problem in the barter exchange market. The problem, described in the terminology of graph theory, is to find a set of vertex-disjoint, length-restricted cyc…

cs.CC2014

Hardness of robust graph isomorphism, Lasserre gaps, and asymmetry of random graphs

Ryan O'Donnell, John Wright, Chenggang Wu +1

Building on work of Cai, Fürer, and Immerman \cite{CFI92}, we show two hardness results for the Graph Isomorphism problem. First, we show that there are pairs of nonisomorphic -…

cs.CC2013★ 1 cited

Decision Trees, Protocols, and the Fourier Entropy-Influence Conjecture

Andrew Wan, John Wright, Chenggang Wu

Given , define the \emph{spectral distribution} of to be the distribution on subsets of in which the set is sampled with probabil…