Sciweavers

PLDI
2012
ACM
13 years 7 months ago
Sound and precise analysis of parallel programs through schedule specialization
Parallel programs are known to be difficult to analyze. A key reason is that they typically have an enormous number of execution interleavings, or schedules. Static analysis over...
Jingyue Wu, Yang Tang, Gang Hu, Heming Cui, Junfen...
PLDI
2012
ACM
13 years 7 months ago
Diderot: a parallel DSL for image analysis and visualization
Research scientists and medical professionals use imaging technology, such as computed tomography (CT) and magnetic resonance imaging (MRI) to measure a wide variety of biological...
Charisee Chiw, Gordon Kindlmann, John Reppy, Lamon...
PLDI
2012
ACM
13 years 7 months ago
Dynamic synthesis for relaxed memory models
Modern architectures implement relaxed memory models which may reorder memory operations or execute them non-atomically. Special instructions called memory fences are provided, al...
Feng Liu, Nayden Nedev, Nedyalko Prisadnikov, Mart...
161
Voted
PLDI
2012
ACM
13 years 7 months ago
Speculative separation for privatization and reductions
Automatic parallelization is a promising strategy to improve application performance in the multicore era. However, common programming practices such as the reuse of data structur...
Nick P. Johnson, Hanjun Kim, Prakash Prabhu, Ayal ...
PLDI
2012
ACM
13 years 7 months ago
Self-stabilizing Java
Self-stabilizing programs automatically recover from state corruption caused by software bugs and other sources to reach the correct state. A number of applications are inherently...
Yong Hun Eom, Brian Demsky
PLDI
2012
ACM
13 years 7 months ago
Concurrent data representation synthesis
We describe an approach for synthesizing data representations for concurrent programs. Our compiler takes as input a program written using concurrent relations and synthesizes a r...
Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin...
PLDI
2012
ACM
13 years 7 months ago
Understanding and detecting real-world performance bugs
Developers frequently use inefficient code sequences that could be fixed by simple patches. These inefficient code sequences can cause significant performance degradation and ...
Guoliang Jin, Linhai Song, Xiaoming Shi, Joel Sche...
PLDI
2012
ACM
13 years 7 months ago
RockSalt: better, faster, stronger SFI for the x86
Software-based fault isolation (SFI), as used in Google’s Native Client (NaCl), relies upon a conceptually simple machine-code analysis to enforce a security policy. But for com...
Greg Morrisett, Gang Tan, Joseph Tassarotti, Jean-...
201
Voted
MOBIHOC
2012
ACM
13 years 7 months ago
Channel width assignment using relative backlog: extending back-pressure to physical layer
With recent advances in Software-defined Radios (SDRs), it has indeed became feasible to dynamically adapt the channel widths at smaller time scales. Even though the advantages o...
Parth H. Pathak, Sankalp Nimbhorkar, Rudra Dutta
MOBIHOC
2012
ACM
13 years 7 months ago
Oblivious low-congestion multicast routing in wireless networks
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
Antonio Carzaniga, Koorosh Khazaei, Fabian Kuhn