• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 11 - 20 of 847
Next 10 →

The Palindrome Systolic Array Revisited

by Hervé Le Verge, Patrice Quinton - Research Directions in High-Level Parallel Programming Languages, Lecture Notes in Computer Science 574 , 1992
"... This paper appeared in J.P. Banatre and D. Le M'etayer (eds), Research Directions in High-Level Parallel Programming Languages, Lecture Notes in Computer Science, no 574, Springer-Verlag, 1992, pp. 298-308 ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
This paper appeared in J.P. Banatre and D. Le M'etayer (eds), Research Directions in High-Level Parallel Programming Languages, Lecture Notes in Computer Science, no 574, Springer-Verlag, 1992, pp. 298-308

SYSTOLIC ARRAYS FOR (VLSI)

by I A, H. Kung
"... flt~ ~ F 0- _-- ..."
Abstract - Add to MetaCart
flt~ ~ F 0- _--

3D systolic array

by Salim Lakhani, Yi Wang Aleks, Veljko Milutinovi
"... multiplication on a ..."
Abstract - Add to MetaCart
multiplication on a

A systolic array for SVD updating

by Marc Moonen, Paul Van Dooren, Joos Vandewalle - SIAM J. Matrix Anal. Appl , 1991
"... In an earlier paper, an approximate SVD updating scheme has been derived as an interlacing of a QR updating on the one hand and a Jacobi-type SVD procedure on the other hand, possibly supplemented with a certain re-orthogonalization scheme. In this paper, this updating algorithm is mapped onto a sys ..."
Abstract - Cited by 21 (8 self) - Add to MetaCart
systolic array with O(n 2 ) parallelism for O(n 2 ) complexity, resulting in an O(n 0 ) throughput. Furthermore it is shown how a square root free implementation is obtained by combining modified Givens rotations with approximate SVD schemes. Keywords : Singular Value Decomposition, Parallel

Generic Systolic Arrays: A Methodology for Systolic Design

by Pascal Gribomont, Vincent Van Dongen, Centre De Recherche Informatique , 1993
"... . Several recent papers demonstrate the interest of viewing systolic algorithms as while-programs whose statements are synchronous multiple assignments. This approach is based on the classical invariant method and compares favourably with earlier ones, based on recurrence systems and space-time ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
, second, the basic operations to be executed by individual cells are also partially known at the beginning. In fact, the development does not start from scratch, but from a "generic systolic array" (gsa), whose parameters have to be instantiated. Most systolic arrays are instances of a

Virtual Systolic Array for QR Decomposition

by Jakub Kurzak, Piotr Luszczek, Mark Gates, Ichitaro Yamazaki, Jack Dongarra
"... Abstract—Systolic arrays offer a very attractive, datacentric, execution model as an alternative to the von Neumann architecture. Hardware implementations of systolic arrays turned out not to be viable solutions in the past. This article shows how the systolic design principles can be applied to a s ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
Abstract—Systolic arrays offer a very attractive, datacentric, execution model as an alternative to the von Neumann architecture. Hardware implementations of systolic arrays turned out not to be viable solutions in the past. This article shows how the systolic design principles can be applied to a

Regular Partitioning for synthesizing fixed-size systolic arrays

by Alain Darte - Integration, The VLSI Journal , 1991
"... Extending the projection method for the synthesis of systolic arrays, we present a procedure for the design of fixed-size systolic arrays using a technique called "locally sequential globally parallel" (LSGP) partitioning. Our main result, which gives a necessary and sufficient condition t ..."
Abstract - Cited by 28 (7 self) - Add to MetaCart
Extending the projection method for the synthesis of systolic arrays, we present a procedure for the design of fixed-size systolic arrays using a technique called "locally sequential globally parallel" (LSGP) partitioning. Our main result, which gives a necessary and sufficient condition

Implementation of the Systolic Array for Dynamic Programming

by Jae-Jin Lee, Gi-Yong Song , 2002
"... We propose a systolic array for dynamic programming which is a technique for solving combinatorial optimization problems. We derive a systolic array for single-source shortest path problem, SA-SSSP, and then show that the systolic array serves as dynamic programming systolic array which is applicabl ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
We propose a systolic array for dynamic programming which is a technique for solving combinatorial optimization problems. We derive a systolic array for single-source shortest path problem, SA-SSSP, and then show that the systolic array serves as dynamic programming systolic array which

Implementation of the Super-Systolic Array for Convolution

by Jae-jin Lee, Gi-yong Song
"... Abstract- High-performance computation on a large array of cells has been an important feature of systolic array. To achieve even higher degree of concurrency, it is desirable to make cells of systolic array themselves systolic array as well. The architecture of systolic array with its cells consist ..."
Abstract - Add to MetaCart
consisting of another systolic array is to be called super-systolic array. In this paper we propose a scalable super-systolic array architecture which shows high-performance and can be adopted in the VLSI design including regular interconnection and functional primitives that are typical for a systolic

Matrix Multiplication by an Inexact Systolic Array

by Ke Chen, Fabrizio Lombardi, Jie Han
"... Abstract — Different schemes for approximate computing of matrix multiplication (MM) in systolic arrays are presented in this manuscript. Inexact full adder cells are utilized in a processing element (PE) for the Baugh-Wooley multiplier and/or the final adder as circuits implementing the two computa ..."
Abstract - Add to MetaCart
Abstract — Different schemes for approximate computing of matrix multiplication (MM) in systolic arrays are presented in this manuscript. Inexact full adder cells are utilized in a processing element (PE) for the Baugh-Wooley multiplier and/or the final adder as circuits implementing the two
Next 10 →
Results 11 - 20 of 847
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University