File:Pipelined Binary Tree Prefix Sum Communication.svg
Summary
| Description |
English: The graph represents the subtree local prefix sums of the left and right subtree of a processing element (PE) which are passed to higher level PEs during the upward phase and the partial prefix sums which are passed down during the downward phase.
Русский: Обмен информацией между обрабатывающими элементами (PE) во время восходящей (синей) и нисходящей (красной) фазы для нахождения префиксной суммы в алгоритме конвейерного двоичного дерева. Символом обозначен двоичный ассоциативный оператор. |
| Date | |
| Source | File:Pipelined Binary Tree Prefix Sum Communication.png by David Schneider |
| Author | Д.Ильин: vectorization |
| Other versions |
|
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
  |
This file is made available under the Creative Commons CC0 1.0 Universal Public Domain Dedication. |
| The person who associated a work with this deed has dedicated the work to the public domain by waiving all of their rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law. You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
|
