CONPAR 81: Conference on Analysing Problem Classes and Programming for Parallel Computing, Nürnberg, June 10-12, 1981. Proceedings, Volume 1 |
What people are saying - Write a review
We haven't found any reviews in the usual places.
Contents
I | 1 |
II | 25 |
III | 37 |
IV | 48 |
V | 66 |
VI | 85 |
VII | 101 |
VIII | 115 |
XX | 283 |
XXI | 298 |
XXII | 314 |
XXIII | 328 |
XXIV | 343 |
XXV | 358 |
XXVI | 373 |
XXVII | 395 |
IX | 127 |
X | 141 |
XI | 155 |
XII | 169 |
XIII | 189 |
XIV | 203 |
XV | 217 |
XVI | 231 |
XVII | 245 |
XVIII | 259 |
XIX | 271 |
XXVIII | 414 |
XXIX | 423 |
XXX | 433 |
XXXI | 441 |
XXXII | 453 |
XXXIII | 464 |
XXXIV | 480 |
XXXV | 493 |
XXXVI | |
Other editions - View all
CONPAR 81: Conference on Analysing Problem Classes and Programming for ... W. Händler No preview available - 1981 |
Common terms and phrases
addition algorithm analysis application architecture arithmetic array assignment associated assume binary called cells cellular communication compiler complexity concurrent conditional considered constructs contains corresponding data flow defined definition denote dependence described developed effect efficient elements equations evaluation example execution expression Figure frame function given global graph hardware implementation initial input instruction interval iteration language linear linear system loop machine mapping matrix memory merging method multiplication multiset node obtained operations output parallel parallel algorithms performed possible present problem procedure processing processors produce recurrence reduction References represented respectively result sequence sequential single solution solving sorting specification stage statement steps stored structure synchronization techniques tion transformation tree true units University variable vector