A communication architecture for multiprocessor networks

作者: Roberto Bisiani , Andreas Georg Nowatzyk

DOI:

关键词:

摘要: The system described in this thesis explores the territory between two classical multiprocessor families: shared memory and message passing machines. Like systems, proposed architecture presents user a logically uniform address space by all processors. This programming model is supported directly dedicated communication hardware that translating references into messages are exchanged over network of point to channels. key parts work its integration with contemporary processor components form homogeneous, general purpose multiprocessor. The based on an adaptive routing heuristic independent actual topology. High priority was given optimal use physical bandwidth even under heavy or saturated load conditions. can be extended small incremental upgrades supports medium haul channels link more clusters together transparent fashion. Integration model. avoids overhead explicitly sending receiving but introduces problem maintaining consistent state. Memory coherence achieved through notion time. A wide clock sufficient precision sequentialize concurrent access maintained hardware. As measure avoid unnecessary synchronizations, relaxed allow transient inconsistencies. Application code resort strongly coherent at expense higher latency. The primary tool for assessing performance simulator execute application programs target system. Nonintrusive instrumentation provided down individual cycles. trace-based visualization aided both debugging benchmarks.

参考文章(116)
Bjarne Stroustrup, Jonathan E. Shopiro, A set of c++ classes for co-routine style programming ,(1987)
Nian-Feng Tzeng, Design of a Novel Combining Structure for Shared-Memory Multiprocessors. international conference on parallel processing. pp. 1- 8 ,(1989)
Thomas E. Anderson, The Performance Implications of Spin-Waiting Alternatives for Shared-Memory Multiprocessors. international conference on parallel processing. pp. 170- 174 ,(1989)
Bruce Jay Nelson, Remote procedure call Carnegie Mellon University. ,(1981)
Alexander V. Veidenbaum, A Compiler-Assisted Cache Coherence Solution for Multiprcessors. international conference on parallel processing. pp. 1029- 1036 ,(1986)
Quentin F. Stout, Trevor N. Mudge, John P. Hayes, ARCHITECTURE OF A HYPERCUBE SUPERCOMPUTER. international conference on parallel processing. pp. 653- 660 ,(1986)
Burton J. Smith, Architecture and applications of the HEP mulitprocessor computer system Society of Photo-Optical Instrumentation Engineers (SPIE) Conference Series. ,vol. 298, pp. 342- 349 ,(2000) , 10.1117/12.932535
Ted H. Szymanski, On the Permutation Capability of a Circuit-Switched Hypercube. international conference on parallel processing. pp. 103- 110 ,(1989)
Frederick Wieland, Leo Blume, Mike Di Loreto, L. Van Warren, John J. Wedel, Brian Beckman, Pierre Laroche, Steve Bellenot, David R. Jefferson, Herb Younger, Jack Tupman, Phil Hontalas, Kathy Sturdevant, Distributed Simulation and the Time Wrap Operating System. symposium on operating systems principles. pp. 77- 93 ,(1987)
M. Yousef Amin Khalidi, Mustaque Ahamad, Umakishore Ramachandran, Coherence of Distributed Shared Memory: Unifying Synchronization and Data Transfer. international conference on parallel processing. pp. 160- 169 ,(1989)