Sciweavers

Share
PPOPP
2015
ACM
4 years 2 months ago
Automatic scalable atomicity via semantic locking
In this paper, we consider concurrent programs in which the shared nsists of instances of linearizable ADTs (abstract data types). We present an automated approach to concurrency ...
Guy Golan-Gueta, G. Ramalingam, Mooly Sagiv, Eran ...
PPOPP
2015
ACM
4 years 2 months ago
RaftLib: a C++ template library for high performance stream parallel processing
Stream processing or data-flow programming is a compute paradigm that has been around for decades in many forms yet has failed garner the same attention as other mainstream langu...
Jonathan C. Beard, Peng Li, Roger D. Chamberlain
PPOPP
2015
ACM
4 years 2 months ago
MPI+Threads: runtime contention and remedies
Hybrid MPI+Threads programming has emerged as an alternative model to the “MPI everywhere” model to better handle the increasing core density in cluster nodes. While the MPI s...
Abdelhalim Amer, Huiwei Lu, Yanjie Wei, Pavan Bala...
PPOPP
2015
ACM
4 years 2 months ago
Distributed memory code generation for mixed Irregular/Regular computations
Many applications feature a mix of irregular and regular computational structures. For example, codes using adaptive mesh refinement (AMR) typically use a collection of regular b...
Mahesh Ravishankar, Roshan Dathathri, Venmugil Ela...
PPOPP
2015
ACM
4 years 2 months ago
Low-overhead software transactional memory with progress guarantees and strong semantics
Software transactional memory offers an appealing alternative to locks by improving programmability, reliability, and scalability. However, existing STMs are impractical because t...
Minjia Zhang, Jipeng Huang, Man Cao, Michael D. Bo...
PPOPP
2015
ACM
4 years 2 months ago
The lock-free k-LSM relaxed priority queue
We present a new, concurrent, lock-free priority queue that relaxes the delete-min operation to allow deletion of any of the ρ+1 smallest keys instead of only a minimal one, wher...
Martin Wimmer 0003, Jakob Gruber, Jesper Larsson T...
PPOPP
2015
ACM
4 years 2 months ago
The lazy happens-before relation: better partial-order reduction for systematic concurrency testing
We present the lazy happens-before relation (lazy HBR), which ignores mutex-induced edges to provide a more precise notion of state equivalence compared with the traditional happe...
Paul Thomson, Alastair F. Donaldson
PPOPP
2015
ACM
4 years 2 months ago
Towards batched linear solvers on accelerated hardware platforms
As hardware evolves, an increasingly effective approach to develop energy efficient, high-performance solvers, is to design them to work on many small and independent problems. I...
Azzam Haidar, Tingxing Dong, Piotr Luszczek, Stani...
PPOPP
2015
ACM
4 years 2 months ago
Are web applications ready for parallelism?
In recent years, web applications have become pervasive. Their backbone is JavaScript, the only programming language supported by all major web browsers. Most browsers run on desk...
Cosmin Radoi, Stephan Herhut, Jaswanth Sreeram, Da...
PPOPP
2015
ACM
4 years 2 months ago
Thread-level parallelization and optimization of NWChem for the Intel MIC architecture
In the multicore era it was possible to exploit the increase in on-chip parallelism by simply running multiple MPI processes per chip. Unfortunately, manycore processors’ greatl...
Hongzhang Shan, Samuel Williams, Wibe de Jong, Leo...
books