1 / 23

CSL 859: Advanced Computer Graphics

CSL 859: Advanced Computer Graphics. Dept of Computer Sc. & Engg. IIT Delhi. Adrianne Demo. Skin shader 1,400 instructions per pixel 15 render passes Five bump maps Physically-based lighting with sub-surface scattering Three skin layers with different scattering properties.

mikkel
Download Presentation

CSL 859: Advanced Computer Graphics

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CSL 859: Advanced Computer Graphics Dept of Computer Sc. & Engg. IIT Delhi

  2. Adrianne Demo • Skin shader • 1,400 instructions per pixel • 15 render passes • Five bump maps • Physically-based lighting with sub-surface scattering • Three skin layers with different scattering properties. • Complex anisotropic hair shader • Real geometry • GPU-accelerated character skinning • Blendshapes • Sculpt deformers • Skeletal-driven bump maps

  3. Transform Light Clip Setup Framebuffer Rasterize Blend Texture Z-test Graphics Pipeline Geometry Picture

  4. Framebuffer Graphics Pipeline Vertex Connectivity Textures Texture Vertex Shader Clip & Setup Primitive Assembly Rasterize Blend Raster OPs Fragment Shader Picture

  5. Bottlenecks • Too many operations • Parallelize • Too many memory accesses • Parallelize SCREEN TILE FRAGMENT OPERATIONS GEOMETRY OPERATIONS XBAR SCREEN TILE SCREEN TILE

  6. Parallelization • Distribute computation to processors • Work allocation • Distribute texture to memory banks • Tile Screen-pixels into memory banks • Do all processors have access to all memory • Distribute access/Replicate data

  7. Sorting Taxonomy • Sort first • Allocate to processor, which is responsible for only a given area of the screen • Sort middle • Optimally perform geometry ops and then distribute to the responsible processor • Sort last • No-screen subdivision. • Optimally perform geometry and fragment ops and then compose results

  8. Memory Considerations • Highly pipelined • Guard against stalls • Memory bandwidth • How many accesses per second? • Latency • Latency hiding buffers • Larger memory atoms • e.g., 32 byte atoms

  9. Graphics Architecture: A Brief History • Evans & Sutherland • Ikonas • UNC Chapel Hill • Silicon Graphics (Mushroom: Smart VGA controllers) • nVIDIA, AMD

  10. IKONAS • 32 bit data, 24 bit address bus backbone • Everything memory mapped • Host interface = address registers to access anything on the bus. • Frame buffer resolution and timing could be set via control registers. • Graphics processor • (micro)Programmable • 32 bit integer ALU and 16x16 bit integer multiplier • Address counters, Loop counters and • 64 bit instruction word. • Plug-in boards • 16 bit graphics processor with 16 pixel-at-once parallel write • microprogrammed 16x16 bit matrix multiplier • microprogrammed floating point matrix multiplier • hardware Z-buffer • real-time alpha-blend hardware for two RGB images • real-time RGB video frame grabber

  11. IKONAS 1981

  12. Pixel-planes 5 1989 2 GPs per board 1 128x128 array per board Upto 32 GPs, i860, and upto 8 Renderers

  13. Pixel-planes 5 Renderer 1 board had 64 mini-chips: Each with 2 columns of 128 pixel processors (w/memory)

  14. Renderer • 64 chips of • 256 pixel processing elements (PE • Each PE has 208 bits of memory, the chip contains a • Quadratic expression evaluator (QEE) • Ax+By+C+Dx2+Exy+Fy2 simultaneously at each pixel

  15. Basic Algorithm • Host app transmits model database and new frame requests to MGP • Screen divided statically into bins of 128x128 pixels • MGP allocates Renderers to screen regions • MGP broadcasts database commands to all GPs. • GPs generate Renderer commands for each prim • Commands inserted into appropriate bins • GPs send the bins Round-robin • The Renderers send computed pixels to the frame buffer.

  16. SGI RealityEngine • Kurt Akely 1993: The implementation is near-massively parallel, employing 353 independent processors in its fullest configuration, resulting in a measured fill rate of over 240 million antialiased, texture mapped pixels per second. Rendering performance exceeds 1 million antialiased, texture mapped triangles per second.

  17. RealityEngine Architecture Input FIFO, Command Processor 6, 8, or 12 Geom Engines 1, 2, or 4 raster boards 5 Fragment Generators (Each has texture replica) 80 Image Engines 1280x1024 Framebuffer 256 bits/pixel

  18. RealityEngine Algorithm • FIFO geometry distributed by CP to GEs • GEs do geometry ops including setup • GEs broadcast triangles to FG (Raster) • Finely interleaved pixel assignment • FG distribute fragments to IE • IEs do raster ops • IEs are the framebuffer

  19. RealityEngine GE FG IE

  20. PC Architecture (Upto 2.5Gbps bi-directional per lane) PCI Express North Bridge MEM BUS CPU FSB South Bridge ATA BUS PCI BUS

  21. nVIDIA 8800

  22. Texture

More Related