0
Your cart

Your cart is empty

Browse All Departments
  • All Departments
Price
  • R2,500 - R5,000 (1)
  • -
Status
Brand

Showing 1 - 1 of 1 matches in All Departments

Stream Processor Architecture (Hardcover, 2001 ed.): Scott Rixner Stream Processor Architecture (Hardcover, 2001 ed.)
Scott Rixner
R2,698 Discovery Miles 26 980 Ships in 18 - 22 working days

Media processing applications, such as three-dimensional graphics, video compression, and image processing, currently demand 10-100 billion operations per second of sustained computation. Fortunately, hundreds of arithmetic units can easily fit on a modestly sized 1cm2 chip in modern VLSI. The challenge is to provide these arithmetic units with enough data to enable them to meet the computation demands of media processing applications. Conventional storage hierarchies, which frequently include caches, are unable to bridge the data bandwidth gap between modern DRAM and tens to hundreds of arithmetic units. A data bandwidth hierarchy, however, can bridge this gap by scaling the provided bandwidth across the levels of the storage hierarchy. The stream programming model enables media processing applications to exploit a data bandwidth hierarchy effectively. Media processing applications can naturally be expressed as a sequence of computation kernels that operate on data streams. This programming model exposes the locality and concurrency inherent in these applications and enables them to be mapped efficiently to the data bandwidth hierarchy. Stream programs are able to utilize inexperience local data bandwidth when possible and consume expensive global data bandwidth only when necessary. Stream Processor Architecture presents the architecture of the Imagine streaming media processor, which delivers a peak performance of 20 billion floating-point operations per second. Imagine efficiently supports 48 arithmetic units with a three-tiered data bandwidth hierarchy. At the base of the hierarchy, the streaming memory system employs memory access scheduling to maximize the sustained bandwidth of external DRAM. At the center of the hierarchy, the global stream register file enables streams of data to be recirculated directly from one computation kernel to the next without returning data to memory. Finally, local distributed register files that directly feed the arithmetic units enable temporary data to be stored locally so that it does not need to consume costly global register bandwidth. The bandwidth hierarchy enables Imagine to achieve up to 96% of the performance of a stream processor with infinite bandwidth from memory and the global register file.

Free Delivery
Pinterest Twitter Facebook Google+
You may like...
Pearson Edexcel GCSE (9-1) Mathematics…
Katherine Pate, Naomi Norman Paperback  (1)
R611 Discovery Miles 6 110
Drawn to Life: 20 Golden Years of Disney…
Walt Stanchfield Hardcover R5,141 Discovery Miles 51 410
The Legend of Sleepy Hollow
Washington Irving Hardcover R409 Discovery Miles 4 090
Branching Story, Unlocked Dialogue…
Toiya Kristen Finley Paperback R1,131 Discovery Miles 11 310
Einsterns Schwester - Sprache und Lesen…
Paperback R437 Discovery Miles 4 370
Pearson REVISE Edexcel GCSE Maths Higher…
Jean Linksy, Navtej Marwaha Paperback  (1)
R291 Discovery Miles 2 910
OKI 44173406 Black Ribbon
R1,453 Discovery Miles 14 530
Epson S015086 Black Ribbon…
R183 Discovery Miles 1 830
Rexel Momentum X308 Cross-Cut P3…
R2,513 Discovery Miles 25 130
Cambridge IGCSE Mathematics Core and…
Ric Pimentel, Terry Wall Paperback R441 Discovery Miles 4 410

 

Partners