A rigorous examination of sequentially expressed algorithms to reveal their concurrency hierarchies
<p>The methods of Scott-Strachey semantics are applied to the problem of writing programs for parallel computers, using serial languages such as are in common use, with compilers which attempt to discover and exploit potential parallelism in independent sections of program.</p> <p>...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
1977
|
| Subjects: |