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

More documents

Recommendations

Info

24 11011 – Multi-Core Memory Models and Concurrency Theory That brings us to “DRF and abort” models, which are similar except that one has a guarantee that any such race (or, in some cases, any race that matters) will force termination or raise an exception; there was discussion of how this can be implemented. Statically, one might instead have type systems that exclude races altogether, or even that establish determinacy, but that are flexible enough for a wide range of code, and in general one might establish better concurrent programming models, perhaps with explicit ownership transfer and explicit treatment of data and computation locality. DRF and catch-fire is at the heart of the C++0x/C1x memory model, a formal development of which was presented at the meeting; an open technical question here is how one should allow close-to-the-hardware non-SC synchronization, and yet still forbid causal cycles and thin-air reads. The Java Memory Model was also discussed. Java aims to provide SC behaviour for race-free code, but additionally (and in contrast to C++/C) to guarantee some basic security properties for arbitrary code. The current JMM is flawed in the sense that it prohibits certain compiler optimisations that implementations do in fact perform; how best to admit those optimisations while still ensuring the security properties is an open question. Semantics, Verification, and Reasoning Basic Semantic Questions For any well-motivated relaxed memory model, we should ask some basic questions: how to characterise observational congruences; whether we can make effective use of noninterleaving semantics; what the expressiveness of various sublanguages is; and the decidability and complexity of various problems. Concurrent Algorithm Verification For algorithm verification, several directions are being pursued: interactive proof (directly above a semantics), program logics, automatic methods, and linearisability proofs. There is a great need for effective compositional methods in this domain, especially to show that libraries using weakly ordered atomic operations can encapsulate that weakness, giving SC behaviour as far as any client can observe. Compiler Verification We heard in the meeting of first steps in verifying complete compilers, e.g., from a Clike language with TSO semantics to x86 with its TSO-based semantics, and of verifying compilation of executions from C++0x to x86. There is much more to be done, on verifying optimisations w.r.t. particular models, targetting the weaker and more subtle hardware models, and extending these results to full-scale languages. Dynamic Verification There are many properties that are difficult to prove but useful to check, especially if this can be done with reasonable performance: better dynamic race detection, atomicity, and more general concurrency error detection.
Hans J. Boehm, Ursula Goltz, Holger Hermanns, and Peter Sewell 25 Radical models Finally, when one looks beyond the largest conventional coherent shared-memory machine that one can reasonably build, one can simultaneously ask about the (co)design of hardware, programming model and language, compilation techniques, algorithms, and semantics. 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 and 6: Hans J. Boehm, Ursula Goltz, Holger
Page 25: 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 71 and 72: Meinard Müller, Masataka Goto, and
Page 77 and 78:
Meinard Müller, Masataka Goto, and
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?