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.
- 1.I. E. Sutherland, R. F. Sproull, R. A. Schumacker, "A Characterization of Ten Hidden Surface Algorithms," Computing Surveys, March 1974. Google Scholar
Digital Library
- 2.W. M. Newman and R. F. Sproull, Principles of Interactive Computer Graphics, McGraw-Hill, 2nd Ed., 1979. Google Scholar
Digital Library
- 3.H. Fuchs, "Distributing a Visible Surface Algorithm Over Multiple Processors," Proc. ACM '77, Seattle, Oct. 1977. Google Scholar
Digital Library
- 4.H. Fuchs and B. Johnson, "An Expandable Architecture for Video Graphics," Proc. 6th Symp. on Comp. Arch., April 1979. Google Scholar
Digital Library
- 5.F. I. Parke, "A Parallel Architecture for Shaded Graphics," Tech. Rep., Computer Engineering Dept., Case Western Reserve Univ., Jan. 1979.Google Scholar
- 6.I. E. Sutherland and G. W. Hodgeman, "Reentrant Polygon Clipping," CACM, June 1974. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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.Google Scholar
- 9.F. I. Parke, "An Introduction to the N.mPc Design Environment," Proc. 16th Design Automation Conf., San Diego, June 1979. Google Scholar
Digital Library
Index Terms
Simulation and expected performance analysis of multiple processor Z-buffer systems
Recommendations
Simulation and expected performance analysis of multiple processor Z-buffer systems
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 ...
A Performance Analysis of Pentium Processor Systems
This paper describes the architecture of the Pentium processor and provides a performance analysis of Pentium based systems. The paper presents the utilization of different architectural features of the Pentium processor under different software ...
Performance estimation in a simultaneous multithreading processor
MASCOTS '96: Proceedings of the 4th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications SystemsWe present a model to estimate the performance of dynamically interleaving instruction streams in super-scalar architectures. Instructions executed per cycle (IPC) are calculated from simple descriptions of the workload and hardware. We compare ...





Comments