NDLI: Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures (SPAA '11)

Please wait, while we are loading the content...

Graph expansion and communication costs of fast matrix multiplication: regular submission

A study of transactional memory vs. locks in practice

Filtering: a method for solving graph problems in MapReduce

Brief announcement: full reversal routing as a linear dynamical system

A tight runtime bound for synchronous gathering of autonomous robots with limited visibility

Approximation algorithms for secondary spectrum auctions

Online packet-routing in grids with bounded buffers

Brief announcement: distributed shared memory based on computation migration

On a local protocol for concurrent file transfers

Brief announcement: a partitioned ticket lock

Tight bounds for anonymous adopt-commit objects

Scheduling irregular parallel computations on hierarchical caches

Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs

Optimizing hybrid transactional memory: the importance of nonspeculative operations

Parallelism and data movement characterization of contemporary application classes

Brief announcement: better speedups for parallel max-flow

Stabilizing consensus with the power of two choices

Maximising lifetime for fault-tolerant target coverage in sensor networks

Sparse spanners vs. compact routing

Brief announcement: communication bounds for heterogeneous architectures

On multi-processor speed scaling with migration: extended abstract

Brief announcement: transaction polymorphism

A highly-efficient wait-free universal construction

Sharing-aware algorithms for virtual machine colocation

Linear-work greedy parallel approximate set cover and variants

Flat-combining NUMA locks

Work-stealing for mixed-mode parallelism by deterministic team-building

Brief announcement: reclaiming the energy of a schedule, models and algorithms

Convergence of local communication chain strategies via linear transformations: or how to trade locality for speed

Convergence to equilibrium of logit dynamics for strategic games

Re-Chord: a self-stabilizing chord overlay network

Brief announcement: large-scale multimaps

On scheduling in map-reduce and flow-shops

Brief announcement: multilane - a concurrent blocking multiset

A lock-free algorithm for concurrent bags

Data-oblivious external-memory algorithms for the compaction, selection, and sorting of outsourced data

Parallelism in dynamic well-spaced point sets

Location-based memory fences

The pochoir stencil compiler

Brief announcement: paging for multicore processors

The car sharing problem

On a bounded budget network creation game

Recommender systems with non-binary grades

Brief announcement: processor allocation for optimistic parallelization of irregular programs

Finding heavy distinct hitters in data streams

Brief announcement: read invisibility, virtual world consistency and permissiveness are compatible

Understanding bloom filter intersection for lazy address-set disambiguation

Brief announcement: locality-enhancing loop transformations for tree traversal algorithms

Brief announcement: program regularization in verifying memory consistency

Brief announcement: RedRem: a parallel redundancy remover

Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures (SPAA '11)

Content Provider	ACM Digital Library
Editor	Rajaraman, Rajmohan Albers, Susanne Aguilera, Marcos K. Meyer auf der Heide, Friedhelm Pandurangan, Gopal Pucci, Geppino Fraignaiud, Pierre Luchangco, Victor Welch, Jennifer Khandekar, Rohit
Copyright Year	2011
Abstract	This volume consists of papers that were presented at the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'11), held on June 4-6, 2011, in San Jose, USA. It was sponsored by the ACM Special Interest Groups on Algorithms and Computation Theory (SIGACT) and Computer Architecture (SIGARCH) and organized in cooperation with the European Association for Theoretical Computer Science (EATCS). SPAA'11 is part of the Federated Computing Research Conference (FCRC'11). Financial support was provided by Akamai and IBM Research. The program committee selected the 35 SPAA'11 regular presentations following electronic discussions and a day-long phone conference on March 4, 2011 that was graciously arranged by IBM Research. Of these papers, the paper "Graph Expansion and Communication Costs of Fast Matrix Multiplication" by Grey Ballard, James Demmel, Olga Holtz and Oded Schwartz was selected to receive the best paper award. The regular presentations were selected out of 116 submitted abstracts. The mix of selected papers reflects the unique nature of SPAA in bringing together the theory and practice of parallel computing. SPAA defines parallelism very broadly to encompass any computational device or scheme that can perform multiple operations or tasks simultaneously or concurrently. The technical papers in this volume are to be considered preliminary versions, and authors are generally expected to publish polished and complete versions in archival scientific journals. In addition to the regular presentations, this volume includes 15 brief announcements. The committee's decisions in accepting brief announcements were based on the perceived interest of these contributions, with the goal that they serve as bases for further significant advances in parallelism in computing. Extended versions of the SPAA brief announcements and posters may be published later in other conferences or journals. Finally, this year's program also included a panel discussion on teaching parallelism, featuring panelists Guy Blelloch, Charles Leiserson, Paul Petersen, Nir Shavit, and Uzi Vishkin, with Christian Scheideler as moderator.
ISBN	9781450307437
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2011-06-04
Access Restriction	Subscribed
Content Type	Text
Resource Type	Conference Proceedings

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures (SPAA '13)

Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures (SPAA '12)

Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures (SPAA '10)

Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures (SPAA '06)

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (SPAA '04)

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures (SPAA '05)

Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures (SPAA '09)

Proceedings of the third annual ACM symposium on Parallel algorithms and architectures (SPAA '91)

Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures (SPAA '15)

Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures (SPAA '11)

Similar Documents

Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures (SPAA '13)

Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures (SPAA '12)

Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures (SPAA '10)

Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures (SPAA '06)

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (SPAA '04)

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures (SPAA '05)

Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures (SPAA '09)

Proceedings of the third annual ACM symposium on Parallel algorithms and architectures (SPAA '91)

Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures (SPAA '15)

Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures (SPAA '11)