Contact
Cum să cumpăr
Livrare
Consilier de cumpărături
Memory Storage Patterns in Parallel Processing
engleză
132 b
30 de zile pentru retur bunuri
Clienții au cumpărat de asemenea
/
Carte broșată
13.02
lei
/
Carte broșată
138.78
lei
/
Carte broșată
124.81
lei
This project had its beginnings in the Fall of 1980. At that time Robert Wagner suggested that I investigate compiler optimi zation of data organization, suitable for use in a parallel or vector machine environment. We developed a scheme in which the compiler, having knowledge of the machine's access patterns, does a global analysis of a program's operations, and automatically determines optimum organization for the data. For example, for certain architectures and certain operations, large improvements in performance can be attained by storing a matrix in row major order. However a subsequent operation may require the matrix in column major order. A determination must be made whether or not it is the best solution globally to store the matrix in row order, column order, or even have two copies of it, each organized differently. We have developed two algorithms for making this determination. The technique shows promise in a vector machine environ ment, particularly if memory interleaving is used. Supercomputers such as the Cray, the CDC Cyber 205, the IBM 3090, as well as superminis such as the Convex are possible environments for implementation.
Informații despre carte
engleză
Dăruiește această carte chiar astăzi
Este foarte ușor
1 Adaugă cartea în coș și selectează Livrează ca un cadou 2 Îți vom trimite un voucher în schimb 3 Cartea va ajunge direct la adresa destinataruluiAr putea de asemenea, să te intereseze
/
Carte broșată
75.80
lei
/
Carte broșată
132.84
lei
/
Carte broșată
62.76
lei
/
Carte broșată
59.74
lei
