Volume 1, Issue 1, January 2011 - DROPS - Schloss Dagstuhl

More documents

Recommendations

Info

4 11011 – Multi-Core Memory Models and Concurrency Theory Thursday Morning session (chair: Doug Lea) 9:00 Mark Batty – Mathematizing C++ Concurrency 9:45 James Riely – Generative Operational Semantics for Relaxed Memory Models 10:10 Andreas Lochbihler – A Unified Machine-Checked Model for Multithreaded Java 10:30 Coffee Break 11:15 Stephan Diestelhorst – Extending the AMD64 Memory Model with an Advanced Synchronization Facility 11:55 Erik Hagersten – Selling Your Memory Model Ideas to HW Architects 12:15 Lunch Afternoon session 14:00 Jaroslav Sevcik – Validity of Program Transformations (in the Java Memory Model) 14:45 Michael Kuperstein – Partial Coherence Abstractions 15:05 Laura Effinger-Dean – Simpler Reasoning About Variables in Multithreaded Programs 15:30 Coffee Break 16:15 Paul McKenney – Multi-Core Memory Models and Concurrency Theory: A View from the Linux Community 16:40 Jade Alglave – Fences in Weak Memory Models 17:00 Sela Mador-Haim – Generating Litmus Tests for Contrasting Memory Consistency Models 17:20 Sebastian Burckhardt – Concurrent Revisions: A Strong Alternative to SC 18:00 Dinner Evening session 19:30 Samuel Midkiff – Compilers and Memory Models – Selected Topics Friday Morning session 9:00 Lisa Higham – Specifying Memory Consistency Models for Write-Buffer Multiprocessors and Proving Them Correct 9:20 Gustavo Petri – Speculation for Relaxed Memory: Using “True Concurrency” 9:40 Sibylle Froeschle – True-Concurrency: Foundational Concepts 10:00 Richard Bornat and Mike Dodds – Program Logics: We have come a Long Way, Baby 10:20 Coffee Break 11:00 Open Problem session 12:15 Lunch
Hans J. Boehm, Ursula Goltz, Holger Hermanns, and Peter Sewell 5 2 Table of Contents Executive Summary Hans J. Boehm, Ursula Goltz, Holger Hermanns, Peter Sewell, Christian Eisentraut, and Malte Lochau . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Overview of Talks Rethinking Parallel Languages and Hardware for Disciplined Parallelism Sarita Adve . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 Fences in Weak Memory Models Jade Alglave . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 Commit-Reconcile and Fences (CRF): A Memory Model for Compiler Writers and Architects Arvind . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 Mathematizing C++ Concurrency Mark Batty . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 Memory Models for Threads in Mainstream Programming Languages Hans J. Boehm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 Program Logics: We have come a Long Way, Baby Richard Bornat and Mike Dodds . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 Why is True Concurrency Theory (Possibly) Relevant to the Study of Relaxed Memory Models Gerard Boudol . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 Concurrent Revisions: A Strong Alternative to SC Sebastian Burckhardt . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 A Case for Concurrency Exceptions Luis Ceze . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 Extending the AMD64 Memory Model with an Advanced Synchronization Facility Stephan Diestelhorst . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 Simpler Reasoning About Variables in Multithreaded Programs Laura Effinger-Dean . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 True-Concurrency: Foundational Concepts Sibylle Froeschle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 Modular Verification of Preemptive OS Kernels Alexey Gotsman . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 Selling Your Memory Model Ideas to HW Architects Erik Hagersten . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 Specifying Memory Consistency Models for Write-Buffer Multiprocessors and Proving Them Correct Lisa Higham . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 Calvin: Deterministic or Not? Free Will to Choose Mark D. Hill . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 1 1 0 1 1
Page 1 and 2: Volume 1, Issue 1, January 2011 Mul
Page 3 and 4: Report from Dagstuhl Seminar 11011
Page 5: Hans J. Boehm, Ursula Goltz, Holger
Page 9 and 10: Hans J. Boehm, Ursula Goltz, Holger
Page 29 and 30: Report from Dagstuhl Seminar 11021
Page 31 and 32: Sven Apel, William Cook, Krzysztof
Page 45 and 46: Zhenjiang Hu, Andy Schürr, Perdita
Page 57 and 58:
Zhenjiang Hu, Andy Schürr, Perdita
Page 59 and 60:
Page 61 and 62:
Page 63 and 64:
Page 65 and 66:
Page 67 and 68:
Page 69 and 70:
Page 71 and 72:
Meinard Müller, Masataka Goto, and
Page 73 and 74:
Page 75 and 76:
Page 77 and 78:
Page 79 and 80:
Page 81 and 82:
Page 83 and 84:
Page 85 and 86:
Page 87 and 88:
Page 89 and 90:
Page 91 and 92:
Page 93 and 94:
Page 95 and 96:
Page 97 and 98:
Page 99 and 100:
Page 101 and 102:
Page 103 and 104:
Page 105 and 106:
Gabi Dreo Rodosek, Aiko Pras, Henni
Page 107 and 108:
Page 109 and 110:
Page 111 and 112:
Stephan Dahlke, Michael Elad, Yonin
Page 113 and 114:
Page 115 and 116:
Page 117 and 118:
Page 119 and 120:
Page 121 and 122:
Page 123 and 124:
Page 125 and 126:
Page 127 and 128:
Page 129:
show all

Volume 1, Issue 1, January 2011 - DROPS - Schloss Dagstuhl

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?