VLDB 2026 Research / reviewers in the wild / expert
Roy Bryant
dblp:54/9389
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2011
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 1 first-author
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
2 papers |
Cloud and datacenter computing · 87% Memory systems · 6% Parallel and multicore computing · 6% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cloud and datacenter computing
virtualization |
0.2 | 2 | 2011 | SnowFlock: Virtual Machine Cloning as a First-Class Cloud Primitive · ACM Trans. Comput. Syst. 2011 Kaleidoscope: cloud micro-elasticity via VM state coloring · EuroSys 2011 |
Cloud and datacenter computing › virtualization › virtual machine management
virtual machine cloning |
0.1 | 1 | 2011 | SnowFlock: Virtual Machine Cloning as a First-Class Cloud Primitive · ACM Trans. Comput. Syst. 2011 |
Memory systems › memory management
memory deduplication |
0.0 | 1 | 2011 | Kaleidoscope: cloud micro-elasticity via VM state coloring · EuroSys 2011 |
Parallel and multicore computing › parallel programming models and runtimes
parallel programming frameworks |
0.0 | 1 | 2011 | SnowFlock: Virtual Machine Cloning as a First-Class Cloud Primitive · ACM Trans. Comput. Syst. 2011 |
Methods — techniques the papers use, named apart from their topics
microbenchmarking · 0.1implementation · 0.1cloning · 0.1VM state coloring · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2011 | Kaleidoscope: cloud micro-elasticity via VM state coloringabstractWe introduce cloud micro-elasticity, a new model for cloud Virtual Machine (VM) allocation and management. Current cloud users over-provision long-lived VMs with large memory footprints to better absorb load spikes, and to conserve performance-sensitive caches. Instead, we achieve elasticity by swiftly cloning VMs into many transient, short-lived, fractional workers to multiplex physical resources at a much finer granularity. The memory of a micro-elastic clone is a logical replica of the parent VM state, including caches, yet its footprint is proportional to the workload, and often a fraction of the nominal maximum. We enable micro-elasticity through a novel technique dubbed VM state coloring, which classifies VM memory into sets of semantically-related regions, and optimizes the propagation, allocation and deduplication of these regions. Using coloring, we build Kaleidoscope and empirically demonstrate its ability to create micro-elastic cloned servers. We model the impact of micro-elasticity on a demand dataset from AT&T's cloud, and show that fine-grained multiplexing yields infrastructure reductions of 30% relative to state-of-the art techniques for managing elastic clouds. Roy Bryant, Alexey Tumanov, Olga Irzak, Adin Scannell, Kaustubh R. Joshi, Matti A. Hiltunen, H. Andrés Lagar-Cavilla, Eyal de Lara |
EuroSys | 1 |
| 2011 | SnowFlock: Virtual Machine Cloning as a First-Class Cloud PrimitiveabstractA basic building block of cloud computing is virtualization. Virtual machines (VMs) encapsulate a user’s computing environment and efficiently isolate it from that of other users. VMs, however, are large entities, and no clear APIs exist yet to provide users with programatic, fine-grained control on short time scales. We present SnowFlock, a paradigm and system for cloud computing that introduces VM cloning as a first-class cloud abstraction. VM cloning exploits the well-understood and effective semantics of UNIX fork. We demonstrate multiple usage models of VM cloning: users can incorporate the primitive in their code, can wrap around existing toolchains via scripting, can encapsulate the API within a parallel programming framework, or can use it to load-balance and self-scale clustered servers. VM cloning needs to be efficient to be usable. It must efficiently transmit VM state in order to avoid cloud I/O bottlenecks. We demonstrate how the semantics of cloning aid us in realizing its efficiency: state is propagated in parallel to multiple VM clones, and is transmitted during runtime, allowing for optimizations that substantially reduce the I/O load. We show detailed microbenchmark results highlighting the efficiency of our optimizations, and macrobenchmark numbers demonstrating the effectiveness of the different usage models of SnowFlock. H. Andrés Lagar-Cavilla, Joseph Andrew Whitney, Roy Bryant, Philip Patchin, Michael Brudno, Eyal de Lara, Stephen M. Rumble, Mahadev Satyanarayanan, Adin Scannell |
ACM Trans. Comput. Syst. | 3 |