Peter Cappello, Ömer Egecioglu, Chris Seiman  Home/Search
Context Related
| ucsb.edu/~omer/DOW...ystolicarrays00.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ucsb.edu/~omer/download_list (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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 graph (dag) model of algorithms is used to define a time-minimal schedule and a processor-time-minimal schedule. We present a technique for finding a lower bound on the number of processors needed to achieve a given schedule of an algorithm. The application of this technique is illustrated with a tensor product computation. We ... (Update)
Similar documents based on text: More All
0.8: Automatic Processor Lower Bound Formulas for Array Computations - Cappello, Egecioglu (Correct)
0.2: Processor-Time-Optimal Systolic Arrays - Cappello, Egecioglu, Scheiman (2000) (Correct)
0.1: Processor Lower Bound Formulas for Array Computations and.. - Cappello, Egecioglu (1997) (Correct)
Related documents from co-citation: More All
2: Space-time-minimal systolic arrays for Gaussian elimination and the algebraic pa.. (context) - Benaini, Robert - 1990
BibTeX entry: (Update)
P. Cappello, O. Egecioglu, and C. Scheiman. Processortime -optimal systolic arrays. Parallel Algorithms and Applications. , 15:167--199, 2000. http://citeseer.ist.psu.edu/cappello00processortimeoptimal.html More
@article{ cappello00processortimeoptimal,
author = "P. Cappello and {\"O}. Ebecio{\u{g}}lu and C. Scheiman",
title = "Processor-Time-Optimal Systolic Arrays",
journal = "Parallel Algorithms and Applications",
volume = "14",
number = "8",
pages = "1--33",
year = "2000",
url = "citeseer.ist.psu.edu/cappello00processortimeoptimal.html" }
Citations (may not include all citations):1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
356 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
267 Enumerative Combinatorics (context) - Stanley - 1986
168 The parallel execution of Do-Loops (context) - Lamport - 1974
133 The organization of computations for uniform recurrence equa.. (context) - Karp, Miller et al. - 1967
86 A theorem on boolean matrices (context) - Warshall - 1962
60 Time optimal linear schedules for algorithms with uniform de.. (context) - Shang, Fortes - 1991
54 Automatic synthesis of systolic arrays from uniform recurren.. (context) - Quinton - 1984
54 Grobner Bases and Convex Polytopes (context) - Sturmfels - 1995
52 Properties of a model for parallel computations: Determinacy (context) - Karp, Miller et al. - 1966
49 Parametric analysis of polyhedral iteration spaces - Clauss, Loechner - 1998
49 Algorithm 97: Shortest path (context) - Floyd - 1962
38 the design of algorithms for VLSI systolic arrays (context) - Moldovan - 1983
34 On synthesizing systolic arrays from recurrence equations wi.. (context) - Rajopadhye, Purushothaman et al. - 1986
27 Algorithms for VLSI processor arrays (context) - Kung, Leiserson - 1980
24 Calculus of space-optimal mappings of systolic algorithms on.. (context) - Clauss, Mongenet et al. - 1990
21 Direct VLSI implementation of combinatorial algorithms (context) - Guibas, Kung et al. - 1979
13 A systolic array algorithm for the algebraic path problem (context) - Rote - 1985
12 Optimization of processor count for systolic arrays (context) - Wong, Delosme - 1989
12 Recursive fast algorithm and the role of the tensor product (context) - Granata, Conner et al. - 1992
12 Unifying VLSI array design with linear transformations of sp.. (context) - Cappello, Steiglitz - 1984
12 Systematic design approaches for algorithmically specified s.. (context) - Fortes, Fu et al. - 1988
11 Optimal systolic design for the transitive closure and the s.. (context) - Kung, Lo et al. - 1987
10 The ALPHA language and its use for the design of systolic ar.. (context) - Le Verge, Mauras et al. - 1991
10 Space-time-minimal systolic arrays for gaussian elimination .. (context) - Benaini, Robert - 1990
10 Spacetime-minimal systolic arrays for gaussian elimination a.. (context) - Benaini, Robert - 1990
9 Linear homogeneous diophantine equations and magic labelings.. (context) - Stanley - 1973
8 Unifying VLSI array design with geometric transformations (context) - Cappello, Steiglitz - 1983
8 On vector partition functions (context) - Sturmfels - 1995
7 A processor-time minimal systolic array for transitive closu.. (context) - Scheiman, Cappello - 1992
7 A processor-time minimal systolic array for transitive closu.. (context) - Scheiman, Cappello - 1990
7 A processor-time-minimal systolic array for cubical mesh alg.. (context) - Cappello - 1992
6 Linear scheduling is close to optimal (context) - Darte, Khachiyan et al. - 1992
6 Computational related problems (context) - Sahni - 1974
5 Also published as IRISA technical report PI (context) - Wilde, for et al. - 1993
5 Space-optimal linear processor allocation for systolic array.. (context) - Wong, Delosme - 1992
5 A period-processor-time-minimal schedule for cubical mesh al.. (context) - Scheiman, Cappello - 1994
5 Optimal linear schedules for the parallel execution of algor.. (context) - Fortes, Parisi-Presicce - 1984
5 A processor-time minimal systolic array for the 3d rectiline.. (context) - Scheiman, Cappello - 1995
5 Memoir on the theory of the partitions of numbers- part ii (context) - MacMahon - 1979
5 Mapping Fundamental Algorithms onto Multiprocessor Architect.. (context) - Scheiman - 1993
4 A new systolic architecture for the algebraic path problem (context) - Benaini, Robert et al. - 1989
4 Recent results on the complexity of common-subsequence probl.. (context) - Hirschberg - 1983
4 Processor lower bound formulas for array computations and pa.. - Cappello, Egecioglu - 1998
3 Parallelism detection and algorithm transformation technique.. (context) - Fortes, Moldovan - 1985
3 An orthogonal systolic array for the algebraic path problem (context) - Robert, Trystram - 1986
3 VLSI Architectures for Digital Signal Processing (context) - Cappello - 1982
3 A spacetime-minimal systolic array for matrix product (context) - Cappello - 1989
2 An optimal solution for Gauss-Jordon elimination on 2D systo.. (context) - Louka, Tchuente - 1989
2 VLSI algorithms for solving recurrence equations and applica.. (context) - Ibarra, Palis - 1987
2 Note on the the diophantine inequality x y (context) - MacMahon - 1979
2 The diophantine inequality x y (context) - MacMahon - 1979
1 A note on the linear transformation method for systolic arra.. (context) - Lin, Kumar - 1990
1 Systolic algorithm for tensor products of matrices: implemen.. (context) - Krishnamurthy, Kunde et al. - 1990
1 The design of optimal systolic algorithms (context) - Li, Wah - 1985
1 Systolic algorithm for multivariable approximation using ten.. (context) - Krishnamurthy, Schroder - 1991
Documents on the same site (http://www.cs.ucsb.edu/~omer/download_list.html): More
Givens and Householder Reductions for Linear Least Squares .. - Egecioglu, Srinivasan (Correct)
Parallel Prefix Computation with Few Processors - Egecioglu, Koc (1992) (Correct)
Efficient Nonparametric Density Estimation On The Sphere.. - Egecioglu, Srinivasan (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC