Sciweavers

9 search results - page 1 / 2
» Automatic Processor Lower Bound Formulas for Array Computati...
Sort
View
ISPAN
2002
IEEE
13 years 9 months ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu
IPPS
1998
IEEE
13 years 8 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu
PAAPP
2000
118views more  PAAPP 2000»
13 years 3 months ago
Processor-time-optimal systolic arrays
Minimizing the amount of time and number of processors needed to perform an application reduces the application's fabrication cost and operation costs. A directed acyclic gra...
Peter R. Cappello, Ömer Egecioglu, Chris J. S...
CAV
2009
Springer
169views Hardware» more  CAV 2009»
14 years 4 months ago
Automatic Verification of Integer Array Programs
We provide a verification technique for a class of programs working on integer arrays of finite, but not a priori bounded length. We use the logic of integer arrays SIL [13] to spe...
Filip Konecný, Marius Bozga, Peter Habermeh...
STOC
1996
ACM
100views Algorithms» more  STOC 1996»
13 years 8 months ago
The Linear-Array Conjecture in Communication Complexity is False
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky