The Strict Time Lower Bound and Optimal Schedules for Parallel Prefix with Resource Constraints

Abstract

Preex computation is a fundamental operation at the core of many important applications, e.g., some of the Grand Challenge problems, circuit design, digital signal processing, graph optimizations, and computational geometry. Given a 0 ; : : :; a N?1 , preex computation evaluates a 0 a 1 : : : a k , for 0 k < N, with associative operation. In this paper, we… (More)
DOI: 10.1109/12.544482

Topics

1 Figure or Table