skip to main content
10.1145/2391229acmconferencesBook PagePublication PagesmodConference Proceedingsconference-collections
SoCC '12: Proceedings of the Third ACM Symposium on Cloud Computing
ACM2012 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
SOCC '12: ACM Symposium on Cloud Computing San Jose California October 14 - 17, 2012
ISBN:
978-1-4503-1761-0
Published:
14 October 2012
Sponsors:

Reflects downloads up to 17 Oct 2024Bibliometrics
Skip Abstract Section
Abstract

Welcome to the Third ACM Symposium of Cloud Computing (SoCC'12). This annual symposium is co-sponsored by the ACM Special Interest Group on Management of Data (SIGMOD) and the ACM Special Interest Group on Operating Systems (SIGOPS). Both these communities share a common interest in the rapidly developing field of Cloud Computing, i.e., large scale distributed systems that can manage massive volumes of data and yet deliver reliable and efficient service. As a result, they co-sponsor this symposium with active participation and shared responsibilities from both the communities. In its first year, SoCC was held in conjunction with ACM SIGMOD, the flagship conference of the database community. In the second year, SoCC was held in conjunction with ACM SOSP, the premier conference for operating systems. The goal for co-location was to facilitate effective networking across the two communities, and the symposium was successfully born. This year's edition is being held, for the first time, as an independent event. This year SoCC is being hosted in San Jose, California, a.k.a. Silicon Valley, due to the high level of industrial activity there in the Cloud Computing arena.

Skip Table Of Content Section
research-article
Logic and lattices for distributed programming
Article No.: 1, Pages 1–14https://doi.org/10.1145/2391229.2391230

In recent years there has been interest in achieving application-level consistency criteria without the latency and availability costs of strongly consistent storage infrastructure. A standard technique is to adopt a vocabulary of commutative operations;...

research-article
vBalance: using interrupt load balance to improve I/O performance for SMP virtual machines
Article No.: 2, Pages 1–14https://doi.org/10.1145/2391229.2391231

A Symmetric MultiProcessing (SMP) virtual machine (VM) enables users to take advantage of a multiprocessor infrastructure in supporting scalable job throughput and request responsiveness. It is known that hypervisor scheduling activities can heavily ...

research-article
Improving large graph processing on partitioned graphs in the cloud
Article No.: 3, Pages 1–13https://doi.org/10.1145/2391229.2391232

As the study of large graphs over hundreds of gigabytes becomes increasingly popular for various data-intensive applications in cloud computing, developing large graph processing systems has become a hot and fruitful research area. Many of those ...

research-article
Sailfish: a framework for large scale data processing
Article No.: 4, Pages 1–14https://doi.org/10.1145/2391229.2391233

In this paper, we present Sailfish, a new Map-Reduce framework for large scale data processing. The Sailfish design is centered around aggregating intermediate data, specifically data produced by map tasks and consumed later by reduce tasks, to improve ...

research-article
OS-Sommelier: memory-only operating system fingerprinting in the cloud
Article No.: 5, Pages 1–13https://doi.org/10.1145/2391229.2391234

Precise fingerprinting of an operating system (OS) is critical to many security and virtual machine (VM) management applications in the cloud, such as VM introspection, penetration testing, guest OS administration (e.g., kernel update), kernel dump ...

research-article
How consistent is your cloud application?
Article No.: 6, Pages 1–14https://doi.org/10.1145/2391229.2391235

Current cloud datastores usually trade consistency for performance and availability. However, it is often not clear how an application is affected when it runs under a low level of consistency. In fact, current application designers have basically no ...

research-article
Heterogeneity and dynamicity of clouds at scale: Google trace analysis
Article No.: 7, Pages 1–13https://doi.org/10.1145/2391229.2391236

To better understand the challenges in developing effective cloud-based resource schedulers, we analyze the first publicly available trace data from a sizable multi-purpose cluster. The most notable workload characteristic is heterogeneity: in resource ...

research-article
Using vector interfaces to deliver millions of IOPS from a networked key-value storage server
Article No.: 8, Pages 1–13https://doi.org/10.1145/2391229.2391237

The performance of non-volatile memories (NVM) has grown by a factor of 100 during the last several years: Flash devices today are capable of over 1 million I/Os per second. Unfortunately, this incredible growth has put strain on software storage ...

research-article
Chronos: predictable low latency for data center applications
Article No.: 9, Pages 1–14https://doi.org/10.1145/2391229.2391238

In data center applications, predictability in service time and controlled latency, especially tail latency, are essential for building performant applications. This is especially true for applications or services built by accessing data across ...

research-article
Bridging the tenant-provider gap in cloud services
Article No.: 10, Pages 1–14https://doi.org/10.1145/2391229.2391239

The disconnect between the resource-centric interface exposed by today's cloud providers and tenant goals hurts both entities. Tenants are encumbered by having to translate their performance and cost goals into the corresponding resource requirements, ...

research-article
Using batteries to reduce the power costs of internet-scale distributed networks
Article No.: 11, Pages 1–14https://doi.org/10.1145/2391229.2391240

Modern Internet-scale distributed networks have hundreds of thousands of servers deployed in hundreds of locations and networks around the world. Canonical examples of such networks are content delivery networks (called CDNs) that we study in this ...

research-article
Zeta: scheduling interactive services with partial execution
Article No.: 12, Pages 1–14https://doi.org/10.1145/2391229.2391241

This paper presents a scheduling model for a class of interactive services in which requests are time bounded and lower result quality can be traded for shorter execution time. These applications include web search engines, finance servers, and other ...

research-article
Themis: an I/O-efficient MapReduce
Article No.: 13, Pages 1–14https://doi.org/10.1145/2391229.2391242

"Big Data" computing increasingly utilizes the MapReduce programming model for scalable processing of large data collections. Many MapReduce jobs are I/O-bound, and so minimizing the number of I/O operations is critical to improving their performance. ...

research-article
Cake: enabling high-level SLOs on shared storage systems
Article No.: 14, Pages 1–14https://doi.org/10.1145/2391229.2391243

Cake is a coordinated, multi-resource scheduler for shared distributed storage environments with the goal of achieving both high throughput and bounded latency. Cake uses a two-level scheduling scheme to enforce high-level service-level objectives (SLOs)...

research-article
Generalized resource allocation for the cloud
Article No.: 15, Pages 1–12https://doi.org/10.1145/2391229.2391244

Resource allocation is an integral, evolving part of many data center management problems such as virtual machine placement in data centers, network virtualization, and multi-path network routing. Since the problems are inherently NP-Hard, most existing ...

research-article
Balancing reducer skew in MapReduce workloads using progressive sampling
Article No.: 16, Pages 1–14https://doi.org/10.1145/2391229.2391245

The elapsed time of a parallel job depends on the completion time of its longest running constituent. We present a static load balancing algorithm that distributes work evenly across the reducers in a MapReduce job resulting in significant elapsed time ...

research-article
Probabilistic deduplication for cluster-based storage systems
Article No.: 17, Pages 1–14https://doi.org/10.1145/2391229.2391246

The need to backup huge quantities of data has led to the development of a number of distributed deduplication techniques that aim to reproduce the operation of centralized, single-node backup systems in a cluster-based environment. At one extreme, ...

research-article
All aboard the Databus!: Linkedin's scalable consistent change data capture platform
Article No.: 18, Pages 1–14https://doi.org/10.1145/2391229.2391247

In Internet architectures, data systems are typically categorized into source-of-truth systems that serve as primary stores for the user-generated writes, and derived data stores or indexes which serve reads and other complex queries. The data in these ...

research-article
Untangling cluster management with Helix
Article No.: 19, Pages 1–13https://doi.org/10.1145/2391229.2391248

Distributed data systems systems are used in a variety of settings like online serving, offline analytics, data transport, and search, among other use cases. They let organizations scale out their workloads using cost-effective commodity hardware, while ...

research-article
More for your money: exploiting performance heterogeneity in public clouds
Article No.: 20, Pages 1–14https://doi.org/10.1145/2391229.2391249

Infrastructure-as-a-system compute clouds such as Amazon's EC2 allow users to pay a flat hourly rate to run their virtual machine (VM) on a server providing some combination of CPU access, storage, and network. But not all VM instances are created equal:...

research-article
Romano: autonomous storage management using performance prediction in multi-tenant datacenters
Article No.: 21, Pages 1–14https://doi.org/10.1145/2391229.2391250

Workload consolidation is a key technique in reducing costs in virtualized datacenters. When considering storage consolidation, a key problem is the unpredictable performance behavior of consolidated workloads on a given storage system. In practice, ...

research-article
The potential dangers of causal consistency and an explicit solution
Article No.: 22, Pages 1–7https://doi.org/10.1145/2391229.2391251

Causal consistency is the strongest consistency model that is available in the presence of partitions and provides useful semantics for human-facing distributed services. Here, we expose its serious and inherent scalability limitations due to write ...

research-article
A case for dual stack virtualization: consolidating HPC and commodity applications in the cloud
Article No.: 23, Pages 1–7https://doi.org/10.1145/2391229.2391252

With the growth of Infrastructure as a Service (IaaS) cloud providers, many have begun to seriously consider cloud services as a substrate for HPC applications. While the cloud promises many benefits for the HPC community, it currently does not come ...

research-article
True elasticity in multi-tenant data-intensive compute clusters
Article No.: 24, Pages 1–7https://doi.org/10.1145/2391229.2391253

Data-intensive computing (DISC) frameworks scale by partitioning a job across a set of fault-tolerant tasks, then diffusing those tasks across large clusters. Multi-tenanted clusters must accommodate service-level objectives (SLO) in their resource ...

research-article
alsched: algebraic scheduling of mixed workloads in heterogeneous clouds
Article No.: 25, Pages 1–7https://doi.org/10.1145/2391229.2391254

As cloud resources and applications grow more heterogeneous, allocating the right resources to different tenants' activities increasingly depends upon understanding tradeoffs regarding their individual behaviors. One may require a specific amount of RAM,...

research-article
Designing good algorithms for MapReduce and beyond
Article No.: 26, Pages 1–2https://doi.org/10.1145/2391229.2391255

As MapReduce/Hadoop grows in importance, we find more exotic applications being written this way. Not every program written for this platform performs as well as we might wish. There are several reasons why a MapReduce program can underperform ...

research-article
Distributed programming and consistency: principles and practice
Article No.: 27, Pages 1–2https://doi.org/10.1145/2391229.2391256

In recent years, distributed programming has become a topic of widespread interest among developers. However, writing reliable distributed programs remains stubbornly difficult. In addition to the inherent challenges of distribution---asynchrony, ...

research-article
Open source cloud technologies
Article No.: 28, Pages 1–2https://doi.org/10.1145/2391229.2391257

Open source cloud technologies such as OpenStack, CloudStack, OpenNebula, Eucalyptus, OpenShift, and Cloud Foundry have gained significant momentum in the last few years. For a researcher and practitioner, they present a unique opportunity to analyze, ...

Contributors
  • Google LLC

Recommendations

Acceptance Rates

Overall Acceptance Rate 169 of 722 submissions, 23%
YearSubmittedAcceptedRate
SoCC '201433524%
SoCC '191573925%
SoCC '161513825%
SoCC '151573422%
SOCC '131142320%
Overall72216923%