Self-similarity of parallel machines

✍ Scribed by Robert W. Numrich; Michael A. Heroux

• Publisher: Elsevier Science
• Year: 2011
• Tongue: English
• Weight: 640 KB
• Volume: 37
• Category: Article
• ISSN: 0167-8191
• DOI: 10.1016/j.parco.2010.11.003

✦ Synopsis

Self-similarity is a property of physical systems that describes how to scale parameters such that dissimilar systems appear to be similar. Computer systems are self-similar if certain ratios of computational forces, also known as computational intensities, are equal. Two machines with different computational power, different network bandwidth and different inter-processor latency behave the same way if they have the same ratios of forces. For the parallel conjugate gradient algorithm studied in this paper, two machines are self-similar if and only if the ratio of one force describing latency effects to another force describing bandwidth effects is the same for both machines. For the two machines studied in this paper, this ratio, which we call the mixing coefficient, is invariant as problem size and processor count change. The two machines have the same mixing coefficient and belong to the same equivalence class.