Interconnecting networks and the performance of multithreaded
multiprocessors
Zuberek, W.M.
Proc. SSGRR Summer Conference on Infrastructure for e-Business,
e-Education, e-Science and e-Medicine;
L'Aquila, Italy; 30 July - 4 August 2002.
Abstract:
The effects of interconnecting networks on the performance of
distributed-memory multiprocessor systems are studied in this paper.
The paper shows that the interconnecting networks can be
characterized by a small number of modeling parameters, and that networks
with different topologies are equivalent with respect to their performance
if the values of their critical parameters satisfy certain relations. This
equivalence can be used to simplify the simulation-based performance
evaluation by analyzing systems which are equivalent with respect to
performance to the original ones, but are significantly simpler.
Keywords:
Multiprocessor systems, distributed-memory systems,
interconnecting networks, multithreaded systems, performance bottlenecks,
discrete-event simulation.
References:
-
Agarwal, A., "Performance tradeoffs in multithreaded processors"; IEEE Trans.
on Parallel and Distributed Systems, vol.3, no.5, pp.525-539, 1992.
-
Boothe, B. and Ranade, A., "Improved multithreading techniques for
hiding communication latency in multiprocessors";
Proc. 19-th Annual Int. Symp. on Computer Architecture, Gold Coast, Australia,
pp.214-223, 1992.
-
Burger, D., Goodman, J.R., Kaegi, A., "Memory bandwidth limitations of future
microprocessors"; Proc. 23-rd Annual Int. Symp. on Computer Architecture,
Philadelphia, PA, pp.78-89, 1996.
-
Byrd, G.T. and Holliday, M.A., "Multithreaded processor architecture"; IEEE
Spectrum, vol.32, no.8, pp.38-46, 1995.
-
Chen, T-F. and Baer, J-L., "A performance study of software and hardware data
prefetching scheme"; Proc. 21-st Annual Int. Symp. on Computer Architecture,
Chicago, IL, pp.223-232, 1994.
-
Hamilton, S., "Taking Moore's law into the next century"; IEEE Computer
Magazine, vol.32, no.1, pp.43-48, 1999.
-
Hwang, K., Advanced computer architecture - parallelism, scalability,
programmability; McGraw-Hill 1993.
-
Jain, R., The art of computer systems performance analysis;
J. Wiley & Sons 1991.
-
Klaiber, A.C. and Levy, H.M., "An architecture for software-controlled data
prefetching"; Proc. 18-th Annual Int. Symp. on Computer Architecture,
Toronto, Canada, pp.43-53, 1991.
-
Loh, K.S. and Wong, W.F., "Multiple context multithreaded superscalar
processor architecture"; Journal of Systems Architecture, vol.46, pp.243-258,
2000.
-
Rixner, S., Dally, W.J., Kapasi, U.J., Mattson, P. and Ovens, J.D., "Memory
access scheduling"; Proc. 27-th Annual Int. Symp. on Computer Architecture,
Vancouver, Canada, pp.128-138, 2000.
-
Rogers, A. and Li, K., "Software support for speculative loads"; Proc. 5-th
Symp. on Architectural Support for Programming Languages and Operating
Systems, pp.38-50, 1992.
-
Wilkinson, B., Computer architecture - design and performance;
Prentice Hall 1996.
-
Zuberek, W.M.,
"Performance modeling of multithreaded distributed memory
architectures", Proc. 2-nd Workshop on Hardware Design and Petri Nets,
Williamsburg, VA, pp.63-82, 1999.
-
Zuberek, W.M.,
"Approximate simulation of distributed-memory multithreaded
multiprocessors"; Proc. 35-th Annual Simulation Symposium,
San Diego, CA, pp.107-114, 2002.
Available in pdf
and postscript.