New answers tagged parallel-computing
0
votes
fastest algorithm to count leaf nodes (i.e. terminal nodes)
Store the tree in an array $A$ so that $A_i$ contains the index of the
parent's node. For example:
A = [-1 0 1 1]
would be a four-node-tree where the root node has ...
0
votes
Work and depth of DAG - problem in understanding exam question
$D = 5$ (and is not a funtion of $n$ here) and goes $1 - 2 -
4 - 5 - 6$.
What is the minimum number of processors that are needed to achieve
depth?
It clearly cannot be achieved with one processor, ...
0
votes
Parallel Algorithm Analysis: Loops
The work $W(n)$ is the total number of nodes in your computation
graph and the span $D(n)$ is the number of nodes on the longest path
of that graph. $T_P(n)$ is the runtime of the algorithm
using $P$ ...
Top 50 recent answers are included
Related Tags
parallel-computing × 337algorithms × 85
distributed-systems × 33
computer-architecture × 32
complexity-theory × 30
concurrency × 28
graphs × 24
reference-request × 21
computation-models × 16
threads × 16
terminology × 13
matrices × 13
algorithm-analysis × 12
performance × 11
optimization × 10
runtime-analysis × 10
multi-tasking × 10
time-complexity × 9
scheduling × 9
programming-languages × 8
sorting × 8
operating-systems × 6
efficiency × 6
numerical-algorithms × 6
turing-machines × 5