Seller: HPB-Red, Dallas, TX, U.S.A.
Hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
Published by Boston: Kluwer Academic, 1987
ISBN 10: 0898382394 ISBN 13: 9780898382396
Language: English
Seller: Zubal-Books, Since 1961, Cleveland, OH, U.S.A.
Condition: Good. 139 pp., hardcover, ex library else text clean & binding tight. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.
Seller: GuthrieBooks, Spring Branch, TX, U.S.A.
Hardcover. Condition: Very Good. Ex-library hardcover in very nice condition with the usual library markings and attachments. Text block clean and unmarked. Tight binding.
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
US$ 59.16
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
US$ 67.80
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. In.
US$ 68.23
Convert currencyQuantity: 1 available
Add to basketTaschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
US$ 56.52
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
US$ 96.59
Convert currencyQuantity: 10 available
Add to basketPF. Condition: New.
Seller: Mispah books, Redhill, SURRE, United Kingdom
US$ 113.63
Convert currencyQuantity: 1 available
Add to basketPaperback. Condition: Like New. Like New. book.
Published by Springer-Verlag New York Inc., 2011
ISBN 10: 1461291941 ISBN 13: 9781461291947
Language: English
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
US$ 76.78
Convert currencyQuantity: Over 20 available
Add to basketPaperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 257.
Published by Springer US Dez 2011, 2011
ISBN 10: 1461291941 ISBN 13: 9781461291947
Language: English
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
US$ 99.98
Convert currencyQuantity: 2 available
Add to basketTaschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 156 pp. Englisch.