NDLI: A processor-time minimal systolic array for transitive closure

Content Provider	IEEE Xplore Digital Library
Author	Scheiman, C.J. Cappello, P.R.
Copyright Year	1990
Description	Author affiliation: Dept. of Comput. Sci., California Univ., Santa Barbara, CA, USA (Scheiman, C.J.; Cappello, P.R.)
Abstract	A directed acyclic graph (DAG) model of algorithms is used. For a given DAG the authors focus on processor-time minimal multiprocessor schedules: time minimal multiprocessor schedules that use as few processors as possible. The Kung, Lo and Lewis (KLL) algorithm (S.-Y. Kung et al., 1987) for computing the transitive closure of a relation over a set of n elements requires at least 5n-4 steps. Their systolic array comprises n/sup 2/ processing elements. Here, it first is shown that any multiprocessor that achieves this 5n-4 time bound needs at least (n/sup 2//3) processing elements. Then, a processor-time minimal systolic array realizing the KLL algorithm's DAG is constructed. Its (n/sup 2//3) processing elements are organized as a cylindrically connected 2-D mesh, when n identical to 0 mod 3. When n is not identical to 0 mod 3, the 2-D mesh is connected as a twisted torus.<>
Starting Page	19
Ending Page	30
File Size	541216
Page Count	12
File Format	PDF
ISBN	0818690895
DOI	10.1109/ASAP.1990.145439
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 Processor scheduling Difference equations Computer science Linearity Constraint optimization NP-complete problem Routing Tree graphs Hypercubes
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

A processor-time-minimal systolic array for transitive closure

Improved lower bounds for the scheduling optimization problem

Processor-Time-Optimal Systolic Arrays (2000)

Processor-Time-Optimal Systolic Arrays (2000)

Scheduling a system of affine recurrence equations onto a systolic array

Real-time job scheduling in hypercube systems

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

Transitive closure on an instruction systolic array

Evolving schedule graphs for the vehicle routing problem with time windows

A processor-time minimal systolic array for transitive closure

Similar Documents

A processor-time-minimal systolic array for transitive closure

Improved lower bounds for the scheduling optimization problem

Processor-Time-Optimal Systolic Arrays (2000)

Processor-Time-Optimal Systolic Arrays (2000)

Scheduling a system of affine recurrence equations onto a systolic array

Real-time job scheduling in hypercube systems

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

Transitive closure on an instruction systolic array

Evolving schedule graphs for the vehicle routing problem with time windows

A processor-time minimal systolic array for transitive closure