Papers for Student Presentations (6/3/2009)
Choose one paper from the following list for presentation and another (preferably related) one for opposition.
Maged M. Michael, Michael L. Scott:
Non-Blocking Algorithms and Preemption-Safe Locking
on Multiprogrammed Shared Memory Multiprocessors
J. Parallel and Distr. Comput. 51(1): 1-26, May 1998.
Survey of concurrent priority queue data structures
Chapters (14 +) 15 in the Herlihy/Shavit book.
Presenter: Joar Sohl (alt. #1). Opponent: Kristian Stavåker.
Maurice Herlihy, J. Eliot B. Moss:
Transactional memory: Architectural support
for lock-free data structures.
Proc. ISCA'93 20th Int. Symp. on Computer Architecture, pp. 289-300, 1993.
M. Ansari et al.:
Steal-on-Abort: Improving Transactional Memory Performance through Dynamic Transaction Reordering
Proc. HiPEAC-2009
Eduard Ayguade et al.:
The Design of OpenMP Tasks.
IEEE Trans. on Par. and Distr. Syst. 20(3), March 2009.
Presenter: Mikhail Chalabine. Opponent: Erik Hansson.
Kenjiro Taura, Kunio Tabata, Akinoro Yonezawa:
StackThreads/MP: Integrating Futures into Calling Standards
ACM PPoPP'99 Symposium on Principles and Practice of Parallel Programming,
1999.
Presenter: Erik Hansson. Opponent: Joar Sohl.
P. Charles et al.:
X10: An ObjectOriented Approach to NonUniform Cluster Computing
Proc. OOPSLA-2005
Presenter: Dennis Andersson. Opponent: Mikhail Chalabine
Ganesh Bikshandy et al.:
Design and Use of htalib - A Library for Hierarchically Tiled Arrays.
Proc. LCPC-2006, Springer LNCS 4382:17-32, 2008.
Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias:
Provably Efficient Scheduling for Languages
with Fine-Grained Parallelism
J. of the ACM 46(2), March 1999, pp. 281-321.
M. Nijhuis et al.:
Mapping and synchronizing streaming applications on Cell processors
Proc. HiPEAC'09 conference, Jan. 2009
H. Park et al.:
Edge-centric modulo scheduling for coarse-grained reconfigurable architectures.
Proc. 17th int. conference on Parallel architectures and compilation techniques (PACT), 2008.
A. Varbanescu et al.:
Evaluating application mapping scenarios on the Cell/B.E.
Concurrency Computat.: Pract. Exper. 21:85-100, 2009.
Presenter: Erik Kuiper. Opponent: Jian Wang.
L. Benini et al.:
A constraint programming approach for allocation and scheduling on the CELL Broadband Engine.
Proc. CP-2008, LNCS 5202
Presenter: Mattias Eriksson. Opponent: Erik Kuiper
X. Li, M. Garzaran, D. Padua:
A Dynamically Tuned Sorting Library
Proc. CGO-2004
Presenter: Per-Magnus Olsson. Opponent: Mattias Eriksson
N. Thomas et al.:
A Framework for Adaptive Algorithm Selection in STAPL.
Proc. ACM SIGPLAN Symp. Prin. Prac. Par. Prog. (PPOPP), pp. 277-288, Chicago, Illinois, Jun 2005.
Markus Püschel et al.:
SPIRAL: Code Generation for DSP Transforms
Proceedings of the IEEE 93(2):232-275, 2005
S. Williams et al.:
PERI - Auto-tuning memory-intensive kernels for multicore
SciDAC 2008,
Journal of Physics: Conference Series 125 (2008) 012038, IOP Publishing
Scarpazza, Villa, Petrini:
Efficient Breadth-First Search on the Cell/BE Processor
Presenter: Ali Saeed. Opponent: Dennis Andersson.
Gary J. Katz and Joseph T. Kider, Jr:
All-pairs shortest-paths for large graphs on the GPU
23rd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware, 2008.
Presenter: Kristian Stavåker. Opponent: Per-Magnus Olsson
A. Azevedo et al.:
Parallel H.264 Decoding on an Embedded Multicore Processor.
Proc. HiPEAC'09 conference, Jan. 2009
Presenter: Jian Wang. Opponent: Ali Saeed
Task:
Prepare a 20 minutes presentation of your chosen paper and at least 3 questions
on the other paper for opposition.
After the presentation, hand in a written summary of your presented
paper on 2-3 pages.