What people are saying - Write a review
We haven't found any reviews in the usual places.
AND ARRAY PROCESSING
SOME LIMITATION TO CONCURRENCY
CLASSIFICATION AND PERFORMANCE
19 other sections not shown
Other editions - View all
adaptive quadrature adder algorithm allocation problem allow application architecture array binary bits Byzantine Generals Problem coefficients computer systems concurrency coordinator cost data base data structure data-flow graphs defined discussed distributed elements error evaluation example execution sites failure FIGURE file server flow FORTRAN Fourier fragment Hadamard matrix Hadamard transform hardware hierarchical Illiac IV image processing implementation input insane node instruction integer iteration knapsack problem label language lieutenants linear loop machine memory method multiple operands operator tree optimal output parallel parameters performed picture pipeline pixels procedure processors quadrant quadtree Rademacher functions received recursive reduced regular decomposition reliable represent representation result scheme segments sequence SISAL solution solved speed stage STARAN storage stream subpicture subproblems subquadrants supercomputing task techniques tion token transform coding transmission transmitted two-dimensional vector Walsh functions Walsh-Hadamard transform