k buffer fragment synchronized k buffer
play

k + -buffer: Fragment Synchronized k-buffer I3D 2014 Andreas A. - PowerPoint PPT Presentation

Jul 31, 2023 •326 likes •782 views

k + -buffer: Fragment Synchronized k-buffer I3D 2014 Andreas A. Vasilakis & Ioannis Fudos { abasilak,fudos } @cs.uoi.gr Department of Computer Science & Engineering, University of Ioannina, Greece 16 March 2014 Introduction

  1. k + -buffer: Fragment Synchronized k-buffer I3D 2014 Andreas A. Vasilakis & Ioannis Fudos { abasilak,fudos } @cs.uoi.gr Department of Computer Science & Engineering, University of Ioannina, Greece 16 March 2014

  2. Introduction Experimental Study Framework Overview Conclusions & Future Work Outline Introduction 1 Framework Overview 2 Experimental Study 3 Conclusions & Future Work 4 k + -buffer: Fragment Synchronized k-buffer A. A. Vasilakis & I. Fudos

  3. Introduction Experimental Study Problem Statement Prior Art - Contribution Framework Overview Conclusions & Future Work Outline Introduction 1 Framework Overview 2 Experimental Study 3 Conclusions & Future Work 4 k + -buffer: Fragment Synchronized k-buffer A. A. Vasilakis & I. Fudos

  4. Introduction Experimental Study Problem Statement Prior Art - Contribution Framework Overview Conclusions & Future Work Visibility Determination A number of image-based applications require operations on more than one (maybe occluded) fragment per pixel: transparency effects 1 - volume & CSG rendering 2 collision detection 3 visualization of coplanar 4 & self-trimming surfaces 5 shadows 6 - hair rendering 7 1 [Maule et al., CG’11],2 [Bavoil et al., I3D’07],3 [Jang et al., VC’08], 4 [Vasilakis et al., TVCG’13],5 [Rossignac et al., CAD’13],6 [Yang et al., CGF’10],7 [Yu et al., I3D’12] k + -buffer: Fragment Synchronized k-buffer A. A. Vasilakis & I. Fudos

  5. Introduction Experimental Study Problem Statement Prior Art - Contribution Framework Overview Conclusions & Future Work Prior Art - Contribution A-buffer 1 & variants (FreePipe 2 ,LL 3 ,LL-Paged 4 ,SB 5 ) capture [all] fragments per pixel �− → sort them by depth 1 [Carpenter, SIGGRAPH’84],2 [Liu et al., I3D’10],3 [Yang et al., CGF’10],4 [Crassin, Icare3D’10],5 [Vasilakis et al., EG’12] k + -buffer: Fragment Synchronized k-buffer A. A. Vasilakis & I. Fudos

  6. Introduction Experimental Study Problem Statement Prior Art - Contribution Framework Overview Conclusions & Future Work Prior Art - Contribution A-buffer 1 & variants (FreePipe 2 ,LL 3 ,LL-Paged 4 ,SB 5 ) capture [all] fragments per pixel �− → sort them by depth suffer from [memory overflow] 2 & [fragment contention] 3,4,5 1 [Carpenter, SIGGRAPH’84],2 [Liu et al., I3D’10],3 [Yang et al., CGF’10],4 [Crassin, Icare3D’10],5 [Vasilakis et al., EG’12] k + -buffer: Fragment Synchronized k-buffer A. A. Vasilakis & I. Fudos

  7. Introduction Experimental Study Problem Statement Prior Art - Contribution Framework Overview Conclusions & Future Work Prior Art - Contribution A-buffer 1 & variants (FreePipe 2 ,LL 3 ,LL-Paged 4 ,SB 5 ) capture [all] fragments per pixel �− → sort them by depth suffer from [memory overflow] 2 & [fragment contention] 3,4,5 k-buffer (KB) 6 & variants (KB-SR 7 ,KB-MDT 8 ,KB-AB LL 9 ,KB-LL 9 ,KB-PS 10 ) capture the [ k -closest] fragments �− → reduce memory & sorting costs 6 [Bavoil et al., I3D’07],7 [Bavoil et al., ShaderX6’08],8 [Maule et al., I3D’13], 9 [Yu et al., I3D’12], 10 [Salvi, SIGGRAPH’13] k + -buffer: Fragment Synchronized k-buffer A. A. Vasilakis & I. Fudos

  8. Introduction Experimental Study Problem Statement Prior Art - Contribution Framework Overview Conclusions & Future Work Prior Art - Contribution A-buffer 1 & variants (FreePipe 2 ,LL 3 ,LL-Paged 4 ,SB 5 ) capture [all] fragments per pixel �− → sort them by depth suffer from [memory overflow] 2 & [fragment contention] 3,4,5 k-buffer (KB) 6 & variants (KB-SR 7 ,KB-MDT 8 ,KB-AB LL 9 ,KB-LL 9 ,KB-PS 10 ) capture the [ k -closest] fragments �− → reduce memory & sorting costs suffer from RMW hazards 6 - k ≤ 32 6,7 - geometry pre-sorting 6,7 1 6 [Bavoil et al., I3D’07],7 [Bavoil et al., ShaderX6’08],8 [Maule et al., I3D’13], 9 [Yu et al., I3D’12], 10 [Salvi, SIGGRAPH’13] k + -buffer: Fragment Synchronized k-buffer A. A. Vasilakis & I. Fudos

  9. Introduction Experimental Study Problem Statement Prior Art - Contribution Framework Overview Conclusions & Future Work Prior Art - Contribution A-buffer 1 & variants (FreePipe 2 ,LL 3 ,LL-Paged 4 ,SB 5 ) capture [all] fragments per pixel �− → sort them by depth suffer from [memory overflow] 2 & [fragment contention] 3,4,5 k-buffer (KB) 6 & variants (KB-SR 7 ,KB-MDT 8 ,KB-AB LL 9 ,KB-LL 9 ,KB-PS 10 ) capture the [ k -closest] fragments �− → reduce memory & sorting costs suffer from RMW hazards 6 - k ≤ 32 6,7 - geometry pre-sorting 6,7 1 additional rendering pass & depth precision conversion 8 2 6 [Bavoil et al., I3D’07],7 [Bavoil et al., ShaderX6’08],8 [Maule et al., I3D’13], 9 [Yu et al., I3D’12], 10 [Salvi, SIGGRAPH’13] k + -buffer: Fragment Synchronized k-buffer A. A. Vasilakis & I. Fudos

  10. Introduction Experimental Study Problem Statement Prior Art - Contribution Framework Overview Conclusions & Future Work Prior Art - Contribution A-buffer 1 & variants (FreePipe 2 ,LL 3 ,LL-Paged 4 ,SB 5 ) capture [all] fragments per pixel �− → sort them by depth suffer from [memory overflow] 2 & [fragment contention] 3,4,5 k-buffer (KB) 6 & variants (KB-SR 7 ,KB-MDT 8 ,KB-AB LL 9 ,KB-LL 9 ,KB-PS 10 ) capture the [ k -closest] fragments �− → reduce memory & sorting costs suffer from RMW hazards 6 - k ≤ 32 6,7 - geometry pre-sorting 6,7 1 additional rendering pass & depth precision conversion 8 2 unbounded memory 9 �− → KB-AB Array & KB-AB SB 3 6 [Bavoil et al., I3D’07],7 [Bavoil et al., ShaderX6’08],8 [Maule et al., I3D’13], 9 [Yu et al., I3D’12], 10 [Salvi, SIGGRAPH’13] k + -buffer: Fragment Synchronized k-buffer A. A. Vasilakis & I. Fudos

  11. Introduction Experimental Study Problem Statement Prior Art - Contribution Framework Overview Conclusions & Future Work Prior Art - Contribution A-buffer 1 & variants (FreePipe 2 ,LL 3 ,LL-Paged 4 ,SB 5 ) capture [all] fragments per pixel �− → sort them by depth suffer from [memory overflow] 2 & [fragment contention] 3,4,5 k-buffer (KB) 6 & variants (KB-SR 7 ,KB-MDT 8 ,KB-AB LL 9 ,KB-LL 9 ,KB-PS 10 ) capture the [ k -closest] fragments �− → reduce memory & sorting costs suffer from RMW hazards 6 - k ≤ 32 6,7 - geometry pre-sorting 6,7 1 additional rendering pass & depth precision conversion 8 2 unbounded memory 9 �− → KB-AB Array & KB-AB SB 3 Our contribution: k + -buffer 1 overcomes all limitations of existing k -buffer alternatives k + -buffer: Fragment Synchronized k-buffer A. A. Vasilakis & I. Fudos

  12. Introduction Experimental Study Problem Statement Prior Art - Contribution Framework Overview Conclusions & Future Work Prior Art - Contribution A-buffer 1 & variants (FreePipe 2 ,LL 3 ,LL-Paged 4 ,SB 5 ) capture [all] fragments per pixel �− → sort them by depth suffer from [memory overflow] 2 & [fragment contention] 3,4,5 k-buffer (KB) 6 & variants (KB-SR 7 ,KB-MDT 8 ,KB-AB LL 9 ,KB-LL 9 ,KB-PS 10 ) capture the [ k -closest] fragments �− → reduce memory & sorting costs suffer from RMW hazards 6 - k ≤ 32 6,7 - geometry pre-sorting 6,7 1 additional rendering pass & depth precision conversion 8 2 unbounded memory 9 �− → KB-AB Array & KB-AB SB 3 Our contribution: k + -buffer 1 overcomes all limitations of existing k -buffer alternatives 2 memory-friendly variation (extra pass needed) k + -buffer: Fragment Synchronized k-buffer A. A. Vasilakis & I. Fudos

  13. Introduction Experimental Study Problem Statement Prior Art - Contribution Framework Overview Conclusions & Future Work Prior Art - Contribution A-buffer 1 & variants (FreePipe 2 ,LL 3 ,LL-Paged 4 ,SB 5 ) capture [all] fragments per pixel �− → sort them by depth suffer from [memory overflow] 2 & [fragment contention] 3,4,5 k-buffer (KB) 6 & variants (KB-SR 7 ,KB-MDT 8 ,KB-AB LL 9 ,KB-LL 9 ,KB-PS 10 ) capture the [ k -closest] fragments �− → reduce memory & sorting costs suffer from RMW hazards 6 - k ≤ 32 6,7 - geometry pre-sorting 6,7 1 additional rendering pass & depth precision conversion 8 2 unbounded memory 9 �− → KB-AB Array & KB-AB SB 3 Our contribution: k + -buffer 1 overcomes all limitations of existing k -buffer alternatives 2 memory-friendly variation (extra pass needed) 3 supports Z-buffer and A-buffer functionalities k + -buffer: Fragment Synchronized k-buffer A. A. Vasilakis & I. Fudos

  14. Introduction Experimental Study k + -buffer Pipeline Extending k + -buffer Framework Overview Conclusions & Future Work Outline Introduction 1 Framework Overview 2 Experimental Study 3 Conclusions & Future Work 4 k + -buffer: Fragment Synchronized k-buffer A. A. Vasilakis & I. Fudos

  15. Introduction Experimental Study k + -buffer Pipeline Extending k + -buffer Framework Overview Conclusions & Future Work k + -buffer Pipeline Store & Sort solution: 1 captures fragments in an unsorted sequence k + -buffer: Fragment Synchronized k-buffer A. A. Vasilakis & I. Fudos

  16. Introduction Experimental Study k + -buffer Pipeline Extending k + -buffer Framework Overview Conclusions & Future Work k + -buffer Pipeline Store & Sort solution: 1 captures fragments in an unsorted sequence 2 reorders stored fragments by their depth 1 [Crassin, Icare3D’10], 2 [Salvi, SIGGRAPH’13] k + -buffer: Fragment Synchronized k-buffer A. A. Vasilakis & I. Fudos

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Buffer Manager Each relation is can be mapped onto many files (each file containing data from one

Buffer Manager Each relation is can be mapped onto many files (each file containing data from one

Buffer Management The database buffer is the mediator between the basic file system and the tuple-oriented file system. The buffer managers task is to make the pages addressable in main memory and to coordinate the writing of pages to disk

1.12k views • 8 slides
Introduction Buffer Overflows Buffer overflows were the most common form of security

Introduction Buffer Overflows Buffer overflows were the most common form of security

Introduction Buffer Overflows Buffer overflows were the most common form of security vulnerability in the 90s. Buffer overflows dominate in the area of remote network penetration vulnerabilities. CS 465 They represent one of the

651 views • 4 slides
Buffer Overflows with Content 2 A Process Stack Buffer Overflow Common Techniques employed

Buffer Overflows with Content 2 A Process Stack Buffer Overflow Common Techniques employed

1 Buffer Overflows with Content 2 A Process Stack Buffer Overflow Common Techniques employed in buffer overflow exploits to create backdoors Execution of additional network services via the INETD daemon The addition of new users

497 views • 30 slides
External buffer Raslan Darawsheh Mellanox External buffer First was introduced by Olivier

External buffer Raslan Darawsheh Mellanox External buffer First was introduced by Olivier

x External buffer Raslan Darawsheh Mellanox External buffer First was introduced by Olivier in his presentation in 2016. The support for External buffer has been there since DPDK 18.05 2 External buffer: Contd 3 External

544 views • 12 slides
Lab 2: Buffer Overflows Fengwei Zhang SUSTech CS 315 Computer Security 1 Buffer Overflows

Lab 2: Buffer Overflows Fengwei Zhang SUSTech CS 315 Computer Security 1 Buffer Overflows

Lab 2: Buffer Overflows Fengwei Zhang SUSTech CS 315 Computer Security 1 Buffer Overflows One of the most common vulnerabilities in software Programming languages commonly associated with buffer overflows including C and C++

1.14k views • 17 slides
Buffer Overflows and Defenses CS 419: Computer Security Lecture 10 and 11 Buffer Overflow a

Buffer Overflows and Defenses CS 419: Computer Security Lecture 10 and 11 Buffer Overflow a

Buffer Overflows and Defenses CS 419: Computer Security Lecture 10 and 11 Buffer Overflow a very common attack mechanism from 1988 Morris Worm to Code Red, Slammer, Sasser and many others prevention techniques known still of major concern

873 views • 53 slides
TinyOS Determine when Fill message Specify Pass buffer message buffer Network Communication

TinyOS Determine when Fill message Specify Pass buffer message buffer Network Communication

Inter-Node Communication General idea: Sender: TinyOS Determine when Fill message Specify Pass buffer message buffer Network Communication buffer with data Recipients to OS can be reused Computer Network Receiver:

176 views • 3 slides
Week 03 Lectures PostgreSQL Buffer Manager 1/95 PostgreSQL buffer manager: provides a shared

Week 03 Lectures PostgreSQL Buffer Manager 1/95 PostgreSQL buffer manager: provides a shared

Week 03 Lectures PostgreSQL Buffer Manager 1/95 PostgreSQL buffer manager: provides a shared pool of memory buffers for all backends all access methods get data from disk via buffer manager Buffers are located in a large region of shared

505 views • 25 slides
Riparian Buffer or Riparian Forest Buffer Equivalency Demonstration and Offsetting Water

Riparian Buffer or Riparian Forest Buffer Equivalency Demonstration and Offsetting Water

Implementation of Act 162 of 2014 Riparian Buffer or Riparian Forest Buffer Equivalency Demonstration and Offsetting Water Resources Advisory Committee August 12, 2015 Tom Wolf, Governor John Quigley, Secretary Agenda 1. Overview of Act 162

530 views • 37 slides
Chapter 10 Buffer Overflow Buffer Overflow Common attack mechanism first wide use by

Chapter 10 Buffer Overflow Buffer Overflow Common attack mechanism first wide use by

Chapter 10 Buffer Overflow Buffer Overflow Common attack mechanism first wide use by the Morris Worm in 1988 Prevention techniques known NX bit, stack canaries, ASLR Still of major concern Recent examples:

354 views • 21 slides
Buffer Trees Lars Arge. The Buffer Tree: A New Technique for Optimal I/O Algorithms . In

Buffer Trees Lars Arge. The Buffer Tree: A New Technique for Optimal I/O Algorithms . In

Buffer Trees Lars Arge. The Buffer Tree: A New Technique for Optimal I/O Algorithms . In Proceedings of Fourth Workshop on Algorithms and Data Structures (WADS), Lecture Notes in Computer Science Vol. 955, Springer-Verlag, 1995, 334-345. 1

518 views • 27 slides
AKC Education Webinar Series: Social Media Resources Buffer: What Is It? Buffer is a software

AKC Education Webinar Series: Social Media Resources Buffer: What Is It? Buffer is a software

AKC Education Webinar Series: Social Media Resources Buffer: What Is It? Buffer is a software application for the web and mobile, designed to manage accounts in social networks, by providing the means for a user to schedule posts to Twitter,

506 views • 35 slides
More Vulnerabilities (buffer overreads, format string, integer overflow, heap overflows) Chester

More Vulnerabilities (buffer overreads, format string, integer overflow, heap overflows) Chester

More Vulnerabilities (buffer overreads, format string, integer overflow, heap overflows) Chester Rebeiro Indian Institute of Technology Madras Buffer Overreads 2 Buffer Overread Example 3 Buffer Overread Example len read from command line

906 views • 76 slides
Buffer Software Security overflows and other memory safety vulnerabilities Buffer overflow

Buffer Software Security overflows and other memory safety vulnerabilities Buffer overflow

Last time We continued By launching our 1st section: Buffer Software Security overflows and other memory safety vulnerabilities Buffer overflow fundamentals This time We will finish up By looking at Buffer Overflow overflows

1.33k views • 103 slides
Database Systems IIB: DBMS-Implementation Chapter 5: The Buffer Cache Prof. Dr. Stefan Brass

Database Systems IIB: DBMS-Implementation Chapter 5: The Buffer Cache Prof. Dr. Stefan Brass

Storage Hierarchy, Buffer Manager Disk/Buffer Performance in Oracle Database Systems IIB: DBMS-Implementation Chapter 5: The Buffer Cache Prof. Dr. Stefan Brass Martin-Luther-Universit at Halle-Wittenberg Wintersemester 2019/20

623 views • 50 slides
Delta Pointers: Buffer Overflow Checks Without the Checks Tadde us Kroes & Koen Koning

Delta Pointers: Buffer Overflow Checks Without the Checks Tadde us Kroes & Koen Koning

Delta Pointers: Buffer Overflow Checks Without the Checks Tadde us Kroes & Koen Koning Erik van der Kouwe Herbert Bos Cristiano Giuffrida June 19, 2018 Preview buffer[10] secret 2 Preview buffer[10] secret buffer[5] 2 Preview

934 views • 74 slides
Ruakura Variation Landscape + Urban Design Gavin Lister 3 rd and 4 th August 2016 Introduction

Ruakura Variation Landscape + Urban Design Gavin Lister 3 rd and 4 th August 2016 Introduction

Ruakura Variation Landscape + Urban Design Gavin Lister 3 rd and 4 th August 2016 Introduction Qualifications and relevant experience Attached to my rebuttal evidence Documents Percival Road Buffer Consolidated Report

260 views • 22 slides
Minnesota Buffers Initiative September 16, 2015 Legislative Citizen Commission on Minnesota

Minnesota Buffers Initiative September 16, 2015 Legislative Citizen Commission on Minnesota

9/15/2015 Minnesota Buffers Initiative September 16, 2015 Legislative Citizen Commission on Minnesota Resources John Jaschke, BWSR Executive Director Sarah Strommen, DNR Assistant Commissioner Nutrient Reduction Strategy Priority Areas

362 views • 9 slides
Questions to Guide our Thinking Look at other Village Guidelines Mammoth Lakes: In large

Questions to Guide our Thinking Look at other Village Guidelines Mammoth Lakes: In large

Questions to Guide our Thinking Look at other Village Guidelines Mammoth Lakes: In large buildings, ease the effect of a single large mass. Building heights shall be stepped from high centers to lower ends. Buildings shall allow

511 views • 27 slides
CITY OF TACOMA BILLBOARDS REGULATIONS Proposed Amendment to TMC 13.06.521M General Sign

CITY OF TACOMA BILLBOARDS REGULATIONS Proposed Amendment to TMC 13.06.521M General Sign

CITY OF TACOMA BILLBOARDS REGULATIONS Proposed Amendment to TMC 13.06.521M General Sign Regulations Presented to: Planning Commission July 15, 2015 John Harrington, Planning and Development S ervices Presentation Today Core Issues

370 views • 16 slides
Residential Trip to Seoul Year 7/8/9 Day 1 Ulsan KTX Station The National Museum of Korea 24

Residential Trip to Seoul Year 7/8/9 Day 1 Ulsan KTX Station The National Museum of Korea 24

Residential Trip to Seoul Year 7/8/9 Day 1 Ulsan KTX Station The National Museum of Korea 24 Guest House Day 2 Lotte Sky Tower Day 2 Lotte World Aquarium Day 2 Lotte world Day 3 Gyeongbokgung Palace National Folk

429 views • 15 slides
Greenline presents fine bulgur products from Turkish Anatolia. Greenline is a greek

Greenline presents fine bulgur products from Turkish Anatolia. Greenline is a greek

Greenline presents fine bulgur products from Turkish Anatolia. Greenline is a greek company dedicated in promoting Mediterranean Gastronomy and fine quality products in the Food Markets worldwide. We act as importers and

333 views • 6 slides
Tactical Network Planning for Food Aid Distribution in Kenya M.-. Rancourt, J.-F. Cordeau, G.

Tactical Network Planning for Food Aid Distribution in Kenya M.-. Rancourt, J.-F. Cordeau, G.

Tactical Network Planning for Food Aid Distribution in Kenya M.-. Rancourt, J.-F. Cordeau, G. Laporte and B. Watkins, Computers & Operations Research , 56: 68-83, 2015 Transportation Center Seminar Northwesterns McCormick School of

667 views • 54 slides
Food Response to EVD in Liberia Aug 2014 to May 2015 April 2015 WFP Sub Offices in Liberia

Food Response to EVD in Liberia Aug 2014 to May 2015 April 2015 WFP Sub Offices in Liberia

Food Response to EVD in Liberia Aug 2014 to May 2015 April 2015 WFP Sub Offices in Liberia Project duration and objective Duration: 25 August 2014 to 31 May 2015- 9 months Objective : Contribute to meeting the urgent food and nutrition needs

954 views • 14 slides

More recommend