Name
Abstract | ||
|---|---|---|
Memory models are used in concurrent systems to specify visibility properties of shared data. A practical memory model, however, must permit code optimization as well as provide a useful semantics for programmers. Here we extend recent observations that the current Java memory model imposes significant restrictions on the ability to optimize code. Beyond the known and potentially correctable proof concerns illustrated by others we show that major constraints on code generation and optimization can in fact be derived from fundamental properties and guarantees provided by the memory model. To address this and accommodate a better balance between programmability and optimization we present ideas for a simple concurrency semantics for Java that avoids basic problems at a cost of backward compatibility. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1145/1988915.1988917 | MSPC |
Keywords | DocType | Citations |
compiler optimization,simple concurrency semantics,code optimization,concurrent system,memory model,basic problem,useful semantics,practical memory model,current java memory model,code generation,better balance,java memory model | Conference | 1 |
PageRank | References | Authors |
0.35 | 22 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Clark Verbrugge | 1 | 411 | 39.15 |
| Allan Kielstra | 2 | 531 | 32.31 |
| Yi Zhang | 3 | 1 | 0.35 |