A global hierarchical Z space algorithm for cluster parallel graphics architectures

Abram Santilli, Ewa Z. Huebner

    Research output: Chapter in Book / Conference PaperConference Paper

    Abstract

    ![CDATA[In this paper we present a new global hierarchical Z-space sort-last algorithm for cluster parallel graphics architectures that improves upon algorithms used so far for high performance super-graphics. The new algorithm bypasses limitations of sort-last tile based parallelization paradigms, and solves some known Z-space parallelization inefficiencies. The algorithm is implemented as a global hierarchical-Z system which allows GPUs to perform high frequency global intra-frame Z-culling and distributed final frame Z-determination. The new algorithm allows for full one-to-one process-GPU coupling with minimal inter-process and inter-GPU communications. This enables maximal input bandwidth, maximum GPU utilization levels, near optimal load balances and improved efficiency when scaled to larger configurations.]]
    Original languageEnglish
    Title of host publicationProceedings of the 4th International Conference on Computer Graphics and Interactive Techniques in Australasia and Southeast Asia
    PublisherACM Special Interest Group on Computer Graphics and Interactive Techniques
    Number of pages9
    ISBN (Print)1595935649
    Publication statusPublished - 2006
    EventInternational Conference on Computer Graphics and Interactive Techniques in Australasia and Southeast Asia -
    Duration: 1 Jan 2006 → …

    Conference

    ConferenceInternational Conference on Computer Graphics and Interactive Techniques in Australasia and Southeast Asia
    Period1/01/06 → …

    Keywords

    • GPUs
    • Z-space
    • algorithms
    • computer graphics
    • parallel graphics

    Fingerprint

    Dive into the research topics of 'A global hierarchical Z space algorithm for cluster parallel graphics architectures'. Together they form a unique fingerprint.

    Cite this