Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tian Zhang 0005

dblp:13/2913-5 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 2Systems, architecture and hardware · 1 · 1 first-authorComputer networks · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
3 papers
Cloud and datacenter computing · 43% Storage systems · 43% Distributed systems · 14%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%
Computer networks
1 paper
Cellular and mobile networks · 100%

Topics — the 9 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
gene expression analysis
0.312018
anexVis: visual analytics framework for analysis of RNA expression · Bioinform. 2018
Distributed systems
fault tolerance
0.312018
ECHO: A Reliable Distributed Cellular Core Network for Hyper-scale Public Clouds · MobiCom 2018
Storage systems › storage performance
low-latency storage
0.312018
Splinter: Bare-Metal Extensions for Multi-Tenant Low-Latency Storage · OSDI 2018
Cloud and datacenter computing
cluster resource management and scheduling
0.312017
Rocksteady: Fast Migration for Low-latency In-memory Storage · SOSP 2017
Storage systems › key-value storage
in-memory key-value store
0.312017
Rocksteady: Fast Migration for Low-latency In-memory Storage · SOSP 2017
Storage systems
key-value storage
0.312017
Rocksteady: Fast Migration for Low-latency In-memory Storage · SOSP 2017
Cloud and datacenter computing › virtualization › virtual machine migration
live migration
0.312017
Rocksteady: Fast Migration for Low-latency In-memory Storage · SOSP 2017
Cloud and datacenter computing › multi-tenancy
multi-tenant storage
0.112018
Splinter: Bare-Metal Extensions for Multi-Tenant Low-Latency Storage · OSDI 2018
Storage systems
storage reliability
0.112017
Rocksteady: Fast Migration for Low-latency In-memory Storage · SOSP 2017

Methods — techniques the papers use, named apart from their topics

public cloud deployment · 0.7distributed state machine · 0.7visualization techniques · 0.3visual analytics · 0.3
YearPublicationVenuePosition
2019 Narrowing the Gap Between Serverless and its State with Storage Functions
abstract
Serverless computing has gained attention due to its fine-grained provisioning, large-scale multi-tenancy, and on-demand scaling. However, it also forces applications to externalize state in remote storage, adding substantial overheads. To fix this "data shipping problem" we built Shredder, a low-latency multi-tenant cloud store that allows small units of computation to be performed directly within storage nodes. Storage tenants provide Shredder with JavaScript functions (or WebAssembly programs), which can interact directly with data without moving them over the network.
Tian Zhang 0005, Dong Xie 0001, Feifei Li 0001, Ryan Stutsman
SoCC1
2018 ECHO: A Reliable Distributed Cellular Core Network for Hyper-scale Public Clouds
abstract
Economies of scale associated with hyper-scale public cloud platforms offer flexibility and cost-effectiveness, resulting in various services and businesses moving to the cloud. One area with little progress in this direction is cellular core networks. A cellular core network manages the state of cellular clients; it is essentially a large distributed state machine with very different virtualization challenges compared to typical cloud services. In this paper we present a novel cellular core network architecture, called ECHO, particularly suited to public cloud deployments, where the availability guarantees might be an order of magnitude worse compared to existing (redundant) hardware platforms. We present the design and implementation of our approach and evaluate its functionality on a public cloud platform. Analysis shows ECHO promises higher availability than existing telco solutions.
Binh Nguyen 0003, Tian Zhang 0005, Bozidar Radunovic, Ryan Stutsman, Thomas Karagiannis, Jakub Kocur, Jacobus E. van der Merwe
MobiCom2
2018 Splinter: Bare-Metal Extensions for Multi-Tenant Low-Latency Storage
Chinmay Kulkarni 0002, Sara Moore, Mazhar Naqvi, Tian Zhang 0005, Robert Ricci, Ryan Stutsman
OSDI4
2018 anexVis: visual analytics framework for analysis of RNA expression
abstract
Summary: Although RNA expression data are accumulating at a remarkable speed, gaining insights from them still requires laborious analyses, which hinder many biological and biomedical researchers. This report introduces a visual analytics framework that applies several well-known visualization techniques to leverage understanding of an RNA expression dataset. Our analyses on glycosaminoglycan-related genes have demonstrated the broad application of this tool, anexVis (analysis of RNA expression), to advance the understanding of tissue-specific glycosaminoglycan regulation and functions, and potentially other biological pathways. Availability and implementation: The application is accessible at https://anexvis.chpc.utah.edu/, source codes deposited on GitHub. Supplementary information: Supplementary data are available at Bioinformatics online.
Diem-Trang T. Tran, Tian Zhang 0005, Ryan Stutsman, Matthew Might, Umesh R. Desai, Balagurunathan Kuberan
Bioinform.2
2017 Rocksteady: Fast Migration for Low-latency In-memory Storage
abstract
Scalable in-memory key-value stores provide low-latency access times of a few microseconds and perform millions of operations per second per server. With all data in memory, these systems should provide a high level of reconfigurability. Ideally, they should scale up, scale down, and rebalance load more rapidly and flexibly than disk-based systems. Rapid reconfiguration is especially important in these systems since a) DRAM is expensive and b) they are the last defense against highly dynamic workloads that suffer from hot spots, skew, and unpredictable load. However, so far, work on in-memory key-value stores has generally focused on performance and availability, leaving reconfiguration as a secondary concern.
Chinmay Kulkarni 0002, Aniraj Kesavan, Tian Zhang 0005, Robert Ricci, Ryan Stutsman
SOSP3