NDLI: Spacetime-minimal systolic architectures for Gaussian elimination and the algebraic path problem

Content Provider	IEEE Xplore Digital Library
Author	Benaini, A. Robert, Y.
Copyright Year	1990
Description	Author affiliation: LIP-IMAG, Ecole Normale Superieure de Lyon, France (Benaini, A.; Robert, Y.)
Abstract	The authors have designed two systolic arrays that are both time-minimal and space-minimal for Gaussian elimination and the algebraic path problem (APP), thereby establishing the systolic complexity of these two computational kernels. The systolic computation is modeled by a directed acyclic graph (DAG) with nodes corresponding to computed values and arcs denoting dependencies. The computation DAG is taken to be fixed and given. The time to compute a DAG is determined when a timing function is assigned, or scheduled, to the nodes, subject to the constraints that a node can be computed only when its predecessors (the nodes which it depends upon) have been computed at previous steps, and no processor can compute two different nodes at the same time step. For a problem of size n, the authors obtain an execution time (T(n))=3n-1 using A(n)=n/sup 2//4+O(n) processors for Gaussian elimination, and T(n)=5n-2 and A(n)=n/sup 3//3+O(n) for the APP.<>
Starting Page	746
Ending Page	757
File Size	590530
Page Count	12
File Format	PDF
ISBN	0818690895
DOI	10.1109/ASAP.1990.145509
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1990-09-05
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Systolic arrays Equations Processor scheduling Timing Computational modeling Councils Gaussian processes Linear systems Transforms
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Processor-Time-Optimal Systolic Arrays (2000)

Piecewise Linear Schedules For Recurrence Equations

Processor-Time-Optimal Systolic Arrays (2000)

Novel Scheduling Scheme For Systolic Array Partitioning Problem

A period-processor-time-minimal systolic array for cubical mesh algorithms

A processor-time minimal systolic array for transitive closure

Mapping linear recurrences onto systolic arrays

A processor-time-minimal schedule for 3D rectilinear mesh algorithms

Synthesizing systolic arrays: some recent developments

Spacetime-minimal systolic architectures for Gaussian elimination and the algebraic path problem

Similar Documents

Processor-Time-Optimal Systolic Arrays (2000)

Piecewise Linear Schedules For Recurrence Equations

Processor-Time-Optimal Systolic Arrays (2000)

Novel Scheduling Scheme For Systolic Array Partitioning Problem

A period-processor-time-minimal systolic array for cubical mesh algorithms

A processor-time minimal systolic array for transitive closure

Mapping linear recurrences onto systolic arrays

A processor-time-minimal schedule for 3D rectilinear mesh algorithms

Synthesizing systolic arrays: some recent developments

Spacetime-minimal systolic architectures for Gaussian elimination and the algebraic path problem