PPoPP 2016 Welcome Reception and Poster Session

Please note: For the posters presentation at the PPoPP 2016 conference, poster boards accommodating A0 paper size will be provided. Please either print out your poster in A0 format (recommended), or print your material on 16 tiles, being each one a sheet of 8.3x11.7" (or A4) standard paper, which you will attach to the poster board to compose the final poster. Please bring your own materials for attaching your slides or poster to the boards (e.g., Velcro self-adhesive pads, double-stick tape, quick-dry glue, etc. –tacks or pins are not allowed–). The poster boards will be numbered as per the list of accepted posters below (PPoPP 01, PPoPP 02, …, PPoPP 26). Please, correctly identify the board corresponding to your paper before attaching it.

Set up will be on Sunday, 13 March 2016 from 17h to 18h. The Poster Session will be held with the Welcoming Reception from 18:00-20:00h, authors are encouraged to leave their posters on display during Monday morning coffee break. Due to space constraints, poster boards should be dismantled after Monday morning coffee break.

The following posters were accepted:

1. Affinity-aware work-stealing for integrated CPU-GPU processors.
   Naila Farooqui, Rajkishore Barik, Brian T. Lewis, Tatiana Shpeisman, Karsten Schwan.
   DOI: 10.1145/2851141.2851194.


2. An interval constrained memory allocator for the Givy GAS runtime
   François Gindraud, Fa/liice Rastello, Albert Cohen, François Broquedis.
   DOI: 10.1145/2851141.2851195.


3. A programming system for future proofing performance critical libraries
   Li-Wen Chang, Izzat El Hajj, Hee-Seok Kim, Juan Gómez-Luna, Abdul Dakkak, Wen-mei Hwu .
   DOI: 10.1145/2851141.2851178.


4. A scalable lock-free hash table with open addressing
   Jesper Puge Nielsen, Sven Karlsson.
   DOI: 10.1145/2851141.2851196.


5. Concurrent hash tables: fast and general?(!)
   Tobias Maier, Peter Sanders, Roman Dementiev.
   DOI: 10.1145/2851141.2851188.


6. CUDA acceleration for Xen virtual machines in infiniband clusters with rCUDA
   Javier Prades, Carlos Reaño, Federico Silla.
   DOI: 10.1145/2851141.2851181.


7. Effect of portable fine-grained locality on energy efficiency and performance in concurrent search trees
   Ibrahim Umar, Otto J. Anshus, Phuong H. Ha
   DOI: 10.1145/2851141.2851186.


8. Efficient distributed workstealing via matchmaking
   Hrushit Parikh, Vinit Deodhar, Ada Gavrilovska, Santosh Pande.
   DOI: 10.1145/2851141.2851175.


9. Data-centric combinatorial optimization of parallel code
   Hao Luo, Guoyang Chen, Pengcheng Li, Chen Ding, Xipeng Shen.
   DOI: 10.1145/2851141.2851182.


10. DSMR: a shared and distributed memory algorithm for single-source shortest path problem
    Saeed Maleki, Donald Nguyen, Andrew Lenharth, María Garzarán, David Padua, Keshav Pingali.
    DOI: 10.1145/2851141.2851183.


11. Generic messages: capability-based shared memory parallelism for event-loop systems
    Luca Salucci, Daniele Bonetta, Stefan Marr, Walter Binder.
    DOI: 10.1145/2851141.2851184.


12. Hybrid CPU-GPU scheduling and execution of tree traversals
    Jianqiao Liu, Nikhil Hegde, Milind Kulkarni.
    DOI: 10.1145/2851141.2851174.


13. Improving efficacy of internal binary search trees using local recovery
    Arunmoezhi Ramachandran, Neeraj Mittal.
    DOI: 10.1145/2851141.2851173.


14. Merge-based sparse matrix-vector multiplication (SpMV) using the CSR storage format
    Duane Merrill, Michael Garland.
    DOI: 10.1145/2851141.2851190.


15. NUMA-aware scheduling and memory allocation for data-flow task-parallel applications
    Andi Drebes, Antoniu Pop, Karine Heydemann, Nathalie Drach, Albert Cohen.
    DOI: 10.1145/2851141.2851193.


16. On designing NUMA-aware concurrency control for scalable transactional memory
    Mohamed Mohamedin, Roberto Palmieri, Sebastiano Peluso, Binoy Ravindran.
    DOI: 10.1145/2851141.2851189.


17. On ordering transaction commit
    Mohamed M. Saad, Roberto Palmieri, Binoy Ravindran.
    DOI: 10.1145/2851141.2851191.


18. OPR: deterministic group replay for one-sided communication
    Xuehai Qian, Koushik Sen, Paul Hargrove, Costin Iancu.
    DOI: 10.1145/2851141.2851179.


19. Preemption-aware planning on big-data systems
    Marco Rabozzi, Matteo Mazzucchelli, Roberto Cordone, Giovanni Matteo Fumarola, Marco D. Santambrogio.
    DOI: 10.1145/2851141.2851187.


20. Samsara parallel: a non-BSP parallel-in-time model
    Yifeng Chen, Kun Huang, Bei Wang, Guohui Li, Xiang Cui.
    DOI: 10.1145/2851141.2851185.


21. Scalable adaptive NUMA-aware lock: combining local locking and remote locking for efficient concurrency
    Mingzhe Zhang, Francis C. M. Lau, Cho-Li Wang, Luwei Cheng, Haibo Chen.
    DOI: 10.1145/2851141.2851176.


22. SPIRIT: a runtime system for distributed irregular tree applications
    Nikhil Hegde, Jianqiao Liu, Milind Kulkarni.
    DOI: 10.1145/2851141.2851177.


23. Tidex: a mutual exclusion lock
    Pedro Ramalhete, Andreia Correia.
    DOI: 10.1145/2851141.2851171.


24. Unifying fixed code and fixed data mapping of load-imbalanced pipelined loops
    Aristeidis Mastoras, Thomas R. Gross.
    DOI: 10.1145/2851141.2851172.


25. User-assisted storage reuse determination for dynamic task graphs
    Mehmet Can Kurt, Bin Ren, Sriram Krishnamoorthy, Gagan Agrawal.
    DOI: 10.1145/2851141.2851180.


26. Verification of MPI Java programs using software model checking
    Waqas Ur Rehman, Muhammad Sohaib Ayub, Junaid Haroon Siddiqui
    DOI: 10.1145/2851141.2851192.