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

Zhuo Zhen

dblp:227/6864 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none

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

Systems, architecture and hardware · 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
1 paper
Distributed systems · 44% Cloud and datacenter computing · 44% High-performance computing · 13%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › cloud infrastructure
cloud testbed
0.412020
Lessons Learned from the Chameleon Testbed · USENIX ATC 2020
Distributed systems
experimental testbed
0.412020
Lessons Learned from the Chameleon Testbed · USENIX ATC 2020
High-performance computing
scientific computing systems
0.112020
Lessons Learned from the Chameleon Testbed · USENIX ATC 2020
YearPublicationVenuePosition
2020 Lessons Learned from the Chameleon Testbed
Kate Keahey, Zhuo Zhen, Pierre Riteau, Paul Ruth, Daniel C. Stanzione Jr., Mert Cevik, Jacob Colleran, Haryadi S. Gunawi, Cody Hammock, Joe Mambretti, Alexander Barnes, François Halbach, Alex Rocha, Joe Stubbs
USENIX ATC3
2019 Managing Allocatable Resources
abstract
Infrastructure cloud computing allows its clients to allocate on-demand resources, typically consisting of a representation of a compute node. In general however, there is a need for allocating resources other than nodes and managing them in more controlled ways than simply on demand. This paper generalizes the familiar "compute power on demand" pattern by introducing the abstraction of an allocatable resource, describing its properties, and implementation for different types of resources. We further describe architecture for a generic allocatable resource management service that can be extended to manage diverse types of resources as well as the implementation of this architecture in the OpenStack Blazar service to manage resources ranging from bare-metal compute nodes to network segments. Finally, we provide a usage analysis of this service on the Chameleon testbed and use it to illustrate the effectiveness of resource management methods as well as the need for incentives in usage arbitration.
Kate Keahey, Pierre Riteau, Zhuo Zhen
CLOUD4