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)
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
[Article contains additional citations not shown here]
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