Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/800250.807467acmconferencesArticle/Chapter ViewAbstractPublication PagessiggraphConference Proceedingsconference-collections
Article
Free access

Simulation and expected performance analysis of multiple processor Z-buffer systems

Published: 01 July 1980 Publication History

Abstract

The results of expected performance analysis and simulation of three multiple processor Z-buffer architectures are presented. These architectures have been proposed as approaches to applying many processors, working in parallel, to the task of rapidly creating shaded raster images. These architectures are attractive since they offer potentially high performance, in terms of image update rate, at modest cost. All three approaches make use of multiple instances of identical processor modules.
The analyses and simulations indicate that substantial gain is possible by applying multiple processors to the task. But, as more and more processors are added, additional gains in performance become smaller and smaller. This result suggests optimal system sizes. The performance of these architectures depends on the processors used, the number of processors, and certain characteristics of the image environments. Each architecture has its own performance characteristics and limitations.

References

[1]
I. E. Sutherland, R. F. Sproull, R. A. Schumacker, "A Characterization of Ten Hidden Surface Algorithms," Computing Surveys, March 1974.
[2]
W. M. Newman and R. F. Sproull, Principles of Interactive Computer Graphics, McGraw-Hill, 2nd Ed., 1979.
[3]
H. Fuchs, "Distributing a Visible Surface Algorithm Over Multiple Processors," Proc. ACM '77, Seattle, Oct. 1977.
[4]
H. Fuchs and B. Johnson, "An Expandable Architecture for Video Graphics," Proc. 6th Symp. on Comp. Arch., April 1979.
[5]
F. I. Parke, "A Parallel Architecture for Shaded Graphics," Tech. Rep., Computer Engineering Dept., Case Western Reserve Univ., Jan. 1979.
[6]
I. E. Sutherland and G. W. Hodgeman, "Reentrant Polygon Clipping," CACM, June 1974.
[7]
F. C. Crow, "The Aliasing Problem in Computer Synthesized Shaded Images," CACM, Nov. 1977. Also Tech. Rep. UTEC-CSc-76-015, Univ. of Utah, March 1976.
[8]
F. I. Parke, "Performance Analysis of Z-buffer Convex Tiler Based Shaded Image Generation," Tech. Rep. CES 79-15, Computer Engineering, Case Institute of Technology, Oct. 1979.
[9]
F. I. Parke, "An Introduction to the N.mPc Design Environment," Proc. 16th Design Automation Conf., San Diego, June 1979.

Cited By

View all
  • (2021)Improved Point Transformation Methods For Self-Supervised Depth Prediction2021 18th Conference on Robots and Vision (CRV)10.1109/CRV52889.2021.00023(111-118)Online publication date: May-2021
  • (2018)Subatomic Proof SystemsACM Transactions on Computational Logic10.1145/317354419:1(1-33)Online publication date: 27-Jan-2018
  • (2018)Formal Verification of Medical CPSACM Transactions on Cyber-Physical Systems10.1145/31402372:4(1-29)Online publication date: 5-Jul-2018
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGGRAPH '80: Proceedings of the 7th annual conference on Computer graphics and interactive techniques
July 1980
336 pages
ISBN:0897910214
DOI:10.1145/800250
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1980

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Acceptance Rates

SIGGRAPH '80 Paper Acceptance Rate 52 of 140 submissions, 37%;
Overall Acceptance Rate 1,822 of 8,601 submissions, 21%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)62
  • Downloads (Last 6 weeks)14
Reflects downloads up to 10 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2021)Improved Point Transformation Methods For Self-Supervised Depth Prediction2021 18th Conference on Robots and Vision (CRV)10.1109/CRV52889.2021.00023(111-118)Online publication date: May-2021
  • (2018)Subatomic Proof SystemsACM Transactions on Computational Logic10.1145/317354419:1(1-33)Online publication date: 27-Jan-2018
  • (2018)Formal Verification of Medical CPSACM Transactions on Cyber-Physical Systems10.1145/31402372:4(1-29)Online publication date: 5-Jul-2018
  • (2017)XProACM SIGARCH Computer Architecture News10.1145/3140659.308021945:2(69-80)Online publication date: 24-Jun-2017
  • (2017)Regaining Lost Cycles with HotCallsACM SIGARCH Computer Architecture News10.1145/3140659.308020845:2(81-93)Online publication date: 24-Jun-2017
  • (2017)IndoTrackProceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies10.1145/31309401:3(1-22)Online publication date: 11-Sep-2017
  • (2017)GaztureProceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies10.1145/31309391:3(1-17)Online publication date: 11-Sep-2017
  • (2017)Mining User Reviews for Mobile App ComparisonsProceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies10.1145/31309351:3(1-15)Online publication date: 11-Sep-2017
  • (2003)Algorithms columnACM SIGACT News10.1145/954092.95410334:4(57-67)Online publication date: 1-Dec-2003
  • (2003)SIGACT news complexity theory column 42ACM SIGACT News10.1145/954092.95410134:4(38-52)Online publication date: 1-Dec-2003
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media