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

Adin Scannell

dblp:09/3159 · also Adin Matthew Scannell · DBLP profile ↗
← Back
6ranked-venue papers
0as 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 · 3Computer networks · 1Software engineering, systems software and programming languages · 1Human-computer interaction and ubiquitous 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 · 87% Memory systems · 5% Parallel and multicore computing · 5%
Computer networks
2 papers
Wireless sensing and localization · 100%
Network and information security
2 papers
Authentication and access control · 100%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
virtualization
0.222011
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.222011
SnowFlock: Virtual Machine Cloning as a First-Class Cloud Primitive · ACM Trans. Comput. Syst. 2011
SnowFlock: rapid virtual machine cloning for cloud computing · EuroSys 2009
Authentication and access control
proximity-based authentication
0.222010
Ensemble: cooperative proximity-based authentication · MobiSys 2010
Amigo: Proximity-Based Authentication of Mobile Devices · UbiComp 2007
Wireless sensing and localization
proximity detection
0.122010
Ensemble: cooperative proximity-based authentication · MobiSys 2010
Amigo: Proximity-Based Authentication of Mobile Devices · UbiComp 2007
Wireless sensing and localization
received signal strength
0.112010
Ensemble: cooperative proximity-based authentication · MobiSys 2010
Cloud and datacenter computing
resource provisioning
0.112009
SnowFlock: rapid virtual machine cloning for cloud computing · EuroSys 2009
Memory systems › memory management
memory deduplication
0.012011
Kaleidoscope: cloud micro-elasticity via VM state coloring · EuroSys 2011
Parallel and multicore computing › parallel programming models and runtimes
parallel programming frameworks
0.012011
SnowFlock: Virtual Machine Cloning as a First-Class Cloud Primitive · ACM Trans. Comput. Syst. 2011
Ubiquitous computing and smart environments
device pairing
0.012010
Ensemble: cooperative proximity-based authentication · MobiSys 2010

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

diffie-hellman key exchange · 0.3microbenchmarking · 0.1implementation · 0.1cloning · 0.1VM state coloring · 0.1copy-on-write cloning · 0.1VM fork · 0.1
YearPublicationVenuePosition
2011 Kaleidoscope: cloud micro-elasticity via VM state coloring
abstract
We 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
EuroSys4
2011 SnowFlock: Virtual Machine Cloning as a First-Class Cloud Primitive
abstract
A 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.9
2010 Ensemble: cooperative proximity-based authentication
abstract
Ensemble is a system that uses a collection of trusted personal devices to provide proximity-based authentication in pervasive environments. Users are able to securely pair their personal devices with previously unknown devices by simply placing them close to each other (e.g., users can pair their phones by just bringing them into proximity). Ensemble leverages a user's growing collection of trusted devices, such as phones, music players, computers and personal sensors to observe transmissions made by pairing devices. These devices analyze variations in received signal strength (RSS) in order to determine whether the pairing devices are in physical proximity to each other. We show that, while individual trusted devices can not properly distinguish proximity in all cases, a collection of trusted devices can do so reliably. Our Ensemble prototype extends Diffie-Hellman key exchange with proximity-based authentication. Our experiments show that an Ensemble-enabled collection of Nokia N800 Internet Tablets can detect devices in close proximity and can reliably detect attackers as close as two meters away.
Andre Kalamandeen, Adin Scannell, Eyal de Lara, Anmol Sheth, Anthony LaMarca
MobiSys2
2009 SnowFlock: rapid virtual machine cloning for cloud computing
abstract
Virtual Machine (VM) fork is a new cloud computing abstraction that instantaneously clones a VM into multiple replicas running on different hosts. All replicas share the same initial state, matching the intuitive semantics of stateful worker creation. VM fork thus enables the straightforward creation and efficient deployment of many tasks demanding swift instantiation of stateful workers in a cloud environment, e.g. excess load handling, opportunistic job placement, or parallel computing. Lack of instantaneous stateful cloning forces users of cloud computing into ad hoc practices to manage application state and cycle provisioning. We present SnowFlock, our implementation of the VM fork abstraction. To evaluate SnowFlock, we focus on the demanding scenario of services requiring on-the-fly creation of hundreds of parallel workers in order to solve computationally-intensive queries in seconds. These services are prominent in fields such as bioinformatics, finance, and rendering. SnowFlock provides sub-second VM cloning, scales to hundreds of workers, consumes few cloud I/O resources, and has negligible runtime overhead.
H. Andrés Lagar-Cavilla, Joseph Andrew Whitney, Adin Scannell, Philip Patchin, Stephen M. Rumble, Eyal de Lara, Michael Brudno, Mahadev Satyanarayanan
EuroSys3
2007 Amigo: Proximity-Based Authentication of Mobile Devices
Alex Varshavsky, Adin Scannell, Anthony LaMarca, Eyal de Lara
UbiComp2
2007 Correlation-Based Content Adaptation for Mobile Web Browsing
Iqbal Mohomed, Adin Scannell, Nilton Bila, Eyal de Lara
Middleware2