Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...
We describe three new Jacobi orderings for parallel computation of SVD problems on tree architectures. The rst ordering uses the high bandwidth of a perfect binary fat-tree to min...
The systolic array paradigm has low communication demand because it does not use costly global communication and each processor communicates with few other processors. It is thus s...
With the advance of global computer networks, a dramatic shift in computing metaphors has begun: from team to community. Understanding that the team metaphor has created various re...
Abstract – The storage requirements in data-dominant signal processing systems, whose behavior is described by arraybased, loop-organized algorithmic specifications, have an imp...
Florin Balasa, Per Gunnar Kjeldsberg, Martin Palko...