Content deleted Content added
request review |
|||
Line 1:
{{AFC submission|||ts=20190331192304|u=Daniel Seemaier|ns=118}}
The <math>d</math>-dimensional '''[[hypercube]]''' is a network topology for parallel computers with <math>2^d</math> processing elements. The topology allows for an efficient implementation of some basic communication primitives such as [[Broadcasting_(networking)|Broadcast]], All-[[Reduce_(parallel_pattern)|Reduce]] and [[Prefix sum]].<ref>Grama, A.(2003). Introduction to Parallel Computing. Addison Wesley; Auflage: 2 ed. ISBN: 978-0201648652.</ref> The processing elements are numbered from <math>0</math> to <math>2^d - 1</math>. Each processing elements is then adjacent to processing elements whose numbers differ in exactly one bit. The algorithms described on this page utilize this structure efficiently.
| |||