Abstract
Parallel computing on clusters of workstations is receiving much attention from the research community. Unfortunately, many aspects of parallel computing over this parallel computing engine is not very well understood. Some of these issues include the workstation architectures, the network protocols, the communication-to-computation ratio, the load balancing strategies, and the data partitioning schemes. The aim of this paper is to assess the strengths and limitations of a cluster of workstations by capturing the effects of the above issues. This has been achieved by evaluating the performance of this computing environment in the execution of a parallel ray tracing application through analytical modeling and extensive experimentation. We were successful in illustrating the effect of major factors on the performance and scalability of a cluster of workstations connected by an Ethernet network. Moreover, our analytical model was accurate enough to agree closely with the experimental results. Thus, we feel that such an investigation would be helpful in understanding the strengths and weaknesses of an Ethernet cluster of workstation in the execution of parallel applications.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H. R. Arabnia and S. M. Bhandarkar, “Parallel stereo-correlation on a Reconfigurable Multi-Ring Network,” The Journal of Supercomputing, Vol. 10, No. 3, pp. 243–270, 1996.
D. Badouel and T. Priol, “Ray tracing on distributed memory parallel computers: Strategies for distributing computations and data,” In ACM SIGGRAPH '90, Course Note no. 28, pp. 185–198, 1990.
H. C. Delany, “Ray tracing on a Connection Machine,” In Int. Conf. on Supercomputing, pp. 272–278, 1988.
A. S. Glassner, An Introduction to ray tracing. Academic Press, 1989.
S. Green, Parallel Processing for Computer Graphics, Addison Wesley, 1991.
A. Gupta and V. Kumar, “The scalability of FFT on parallel computers,” IEEE Transactions on Parallel and Distributed Systems, Vol. 4, No.8, August 1993.
M. Hamdi and C. K. Lee, “Parallel image processing on a network of workstations computing environment,” Parallel Computing, Vol. 21., pp. 137–160, Jan. 1995.
S. F. Hummel, E. Schonberg, and L. E. Flynn, “Factoring: A practical and robust method for scheduling parallel loops,” In Proc. Supercomputing Conference, pp. 610–619, 1991.
T. Y. Lee, C. S. Raghavendra, J. B. Nicholas, “A fully distributed parallel ray tracings Scheme on the Delta Touchstone machine,” In Proc. 2nd Int. Symp. High Performance Distributed Computing, pp. 129–134, 1993.
T. Y. Lin and M. Slater, “Stochastic ray tracing using SIMD processor arrays,” The Visual Computer, Vol. 7, pp. 187–199, 1991.
P. Krueger and R. Chawla, “The stealth distributed scheduler, “in Proc. 11th Int. Conf. Distributed Computing Systems, pp. 336–343, 1991.
C. Montani, R. Perego and R. Scopigno, “Parallel rendering of volumetric data set on distributed-memory architectures,” Concurrency: Practice and Experience, Vol. 5, pp. 153–167, 1993.
13. Parasoft Corporation. An overview of the Express system, 1992.
D. J. Plunkett and M. J. Bailey, “The vectorization of a ray tracing algorithm for improved execution speed,” IEEE Comput. Graph. Appl., Vol. 8, pp. 52–60, 1985.
C. Polychronopoulos and D. Kuck, “Guided Self-Scheduling: A Practical Self-Scheduling Scheme for Parallel Supercomputers,” IEEE Transactions on Computers, Vol. C-36, pp. 1425–1439, December 1987.
T. Priol and K. Bouatouch, “Static load balancing for a parallel ray tracing on a MIMD hypercube,” The Visual Computer, Vol. 5, pp. 109–119, 1989.
J. Salmon and J. Goldsmith, “A hypercube ray tracer,” In Proc. Third Conf. on Hypercube Concurrent Computers and Applications, pp. 1194–1206, 1988.
M. Schwartz, Telecommunication Networks: Protocols, Modeling and Analysis. Addison Wesley: Reading, MA, 1987.
P. Tang and P. C. Yew, “Processor self-scheduling for multiple-nested parallel loops,” In Proc. 1986 International Conference on Parallel Processing, pp. 528–535, August 1986.
T. H. Tzen and L. M. Ni, “Trapezoid self-scheduling: A practical scheduling scheme for parallel compilers,” IEEE Transactions on Parallel and Distributed Systems, Vol. 4, No. 1, pp. 87–98, January 1993.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hamdi, M., Pan, Y., Hamidzadeh, B. et al. Parallel Computing on an Ethernet Cluster of Workstations: Opportunities and Constraints. The Journal of Supercomputing 13, 111–132 (1999). https://doi.org/10.1023/A:1008006827002
Issue Date:
DOI: https://doi.org/10.1023/A:1008006827002