Calin Cascaval, Pen-Chung Yew
Proceedings of the 16th Symposium on Principles and Practice of Parallel Programming
PPoPP, 2011.
@proceedings{PPoPP-2011, acmid = "1941553", address = "San Antonio, Texas, USA", editor = "Calin Cascaval and Pen-Chung Yew", isbn = "978-1-4503-0119-0", publisher = "{ACM}", title = "{Proceedings of the 16th Symposium on Principles and Practice of Parallel Programming}", year = 2011, }
Contents (41 items)
- PPoPP-2011-Larus #programming
- Programming the cloud (JRL), pp. 1–2.
- PPoPP-2011-HassaanBP #algorithm #comparison #order #parallel
- Ordered vs. unordered: a comparison of parallelism and work-efficiency in irregular algorithms (MAH, MB, KP), pp. 3–12.
- PPoPP-2011-BauerCSA #memory management #parallel #programming
- Programming the memory hierarchy revisited: supporting irregular parallelism in sequoia (MB, JC, ES, AA), pp. 13–24.
- PPoPP-2011-MurarasuWBBP #algorithm #data type #grid #scalability
- Compact data structure and scalable algorithms for the sparse grid technique (AFM, JW, GB, DB, DP), pp. 25–34.
- PPoPP-2011-ChafiSBLAO #approach #parallel
- A domain-specific approach to heterogeneous parallelism (HC, AKS, KJB, HL, ARA, KO), pp. 35–46.
- PPoPP-2011-CatanzaroGK #compilation #embedded #named #parallel
- Copperhead: compiling an embedded data parallel language (BCC, MG, KK), pp. 47–56.
- PPoPP-2011-JenistaED #execution #named
- OoOJava: software out-of-order execution (JCJ, YHE, BD), pp. 57–68.
- PPoPP-2011-FengGH #commit #named #parallel #scalability
- SpiceC: scalable parallelism via implicit copying and explicit commit (MF, RG, YH), pp. 69–80.
- PPoPP-2011-NegaraKA #message passing #performance
- Inferring ownership transfer for efficient message passing (SN, RKK, GAA), pp. 81–90.
- PPoPP-2011-XiangBBDC #composition #modelling #profiling
- All-window profiling and composable models of cache sharing (XX, BB, TB, CD, TMC), pp. 91–102.
- PPoPP-2011-DingWZ #multi #named #optimisation #performance
- ULCC: a user-level facility for optimizing shared cache performance on multicores (XD, KW, XZ), pp. 103–112.
- PPoPP-2011-WuM #communication #named #source code
- ScalaExtrap: trace-based communication extrapolation for spmd programs (XW, FM), pp. 113–122.
- PPoPP-2011-McKinley #how #parallel #question
- How’s the parallel computing revolution going? (KSM), pp. 123–124.
- PPoPP-2011-KarmaniMM #concurrent #contract #parallel #thread
- Thread contracts for safe parallelism (RKK, PM, BMM), pp. 125–134.
- PPoPP-2011-ZhengRQA #detection #gpu #named #source code
- GRace: a low-overhead mechanism for detecting data races in GPU programs (MZ, VTR, FQ, GA), pp. 135–146.
- PPoPP-2011-YiSF #execution #reasoning
- Cooperative reasoning for preemptive execution (JY, CS, CF), pp. 147–156.
- PPoPP-2011-LesaniP #communication #memory management #transaction
- Communicating memory transactions (ML, JP), pp. 157–168.
- PPoPP-2011-LuchangcoM #concurrent #transaction
- Transaction communicators: enabling cooperation among concurrent transactions (VL, VJM), pp. 169–178.
- PPoPP-2011-FernandesC #memory management #multi #scalability #transaction
- Lock-free and scalable multi-version software transactional memory (SMF, JPC), pp. 179–188.
- PPoPP-2011-TianLFG #incremental #parallel
- Enhanced speculative parallelization via incremental recovery (CT, CL, MF, RG), pp. 189–200.
- PPoPP-2011-SaraswatKKGK
- Lifeline-based global load balancing (VAS, PK, SBK, DG, SK), pp. 201–212.
- PPoPP-2011-WangLCWCZZ #named #parallel #scalability
- COREMU: a scalable and portable parallel full-system emulator (ZW, RL, YC, XW, HC, WZ, BZ), pp. 213–222.
- PPoPP-2011-KoganP #multi
- Wait-free queues with multiple enqueuers and dequeuers (AK, EP), pp. 223–234.
- PPoPP-2011-TanaseBFHPPSTXMVBAR #framework #parallel
- The STAPL parallel container framework (GT, AAB, AF, H, IP, OP, TGS, NT, XX, NM, JV, MB, NMA, LR), pp. 235–246.
- PPoPP-2011-KourtisKGK #memory management #named
- CSX: an extended compression format for spmv on shared memory systems (KK, VK, GIG, NK), pp. 247–256.
- PPoPP-2011-DotsenkoBLG #fourier #performance
- Auto-tuning of fast fourier transform on graphics processors (YD, SSB, BL, NKG), pp. 257–266.
- PPoPP-2011-HongKOO #algorithm #graph
- Accelerating CUDA graph algorithms at maximum warp (SH, SKK, TO, KO), pp. 267–276.
- PPoPP-2011-KimKLL #image #multi
- Achieving a single compute device image in OpenCL for multiple GPUs (JK, HK, JHL, JL), pp. 277–288.
- PPoPP-2011-PrabhakarSGK #multi
- QoS aware storage cache management in multi-server environments (RP, SS, RG, MTK), pp. 289–290.
- PPoPP-2011-RoyHH #consistency #memory management
- Weak atomicity under the x86 memory consistency model (AR, SH, TLH), pp. 291–292.
- PPoPP-2011-JeonGLVT #named #parallel
- Kremlin: like gprof, but for parallelization (DJ, SG, CML, SKV, MBT), pp. 293–294.
- PPoPP-2011-StrzodkaSP
- Time skewing made simple (RS, MS, DP), pp. 295–296.
- PPoPP-2011-GrossetZLVH #graph
- Evaluating graph coloring on GPUs (AVPG, PZ, SL, SV, MWH), pp. 297–298.
- PPoPP-2011-Ding #concurrent #parallel #programming
- Two examples of parallel programming without concurrency constructs (PP-CC) (CD), pp. 299–300.
- PPoPP-2011-StellwagSKS #constraints #library #parallel
- A wait-free NCAS library for parallel applications with timing constraints (PS, FS, JK, WSP), pp. 301–302.
- PPoPP-2011-DaviesCKL
- Algorithm-based recovery for HPL (TD, ZC, CK, HL), pp. 303–304.
- PPoPP-2011-WillcockHEL #data-driven #fine-grained #parallel #programming
- Active pebbles: a programming model for highly parallel fine-grained data-driven computations (JW, TH, NGE, AL), pp. 305–306.
- PPoPP-2011-FischerMR #concurrent #modelling
- Symbolically modeling concurrent MCAPI executions (TF, EM, NR), pp. 307–308.
- PPoPP-2011-SiegelZ #automation #parallel #source code #verification
- Automatic formal verification of MPI-based parallel programs (SFS, TKZ), pp. 309–310.
- PPoPP-2011-DonaldsonKR #analysis #automation #named
- SCRATCH: a tool for automatic analysis of dma races (AFD, DK, PR), pp. 311–312.
- PPoPP-2011-BotincanDDP #automation #memory management #proving #safety
- Automatic safety proofs for asynchronous memory operations (MB, MD, AFD, MJP), pp. 313–314.
15 ×#parallel
10 ×#named
6 ×#memory management
5 ×#multi
4 ×#concurrent
4 ×#programming
4 ×#scalability
3 ×#algorithm
3 ×#automation
3 ×#performance
10 ×#named
6 ×#memory management
5 ×#multi
4 ×#concurrent
4 ×#programming
4 ×#scalability
3 ×#algorithm
3 ×#automation
3 ×#performance