research-article

Free access

Decomposition of data flow graphs on multiprocessors

Authors:

W. C. Brantley, Jr.,

G. W. Leive,

D. P. SiewiorekAuthors Info & Claims

AFIPS '77: Proceedings of the June 13-16, 1977, national computer conference

Pages 379 - 388

https://doi.org/10.1145/1499402.1499471

Published: 13 June 1977 Publication History

PDF eReader

Abstract

Methodologies are presented for decomposing algorithms on a classical multiprocessor. The class of algorithms considered are those that can be represented as data flow graphs without decision elements. Two passive sonar signal processing modes are used as detailed examples. Decompositions are performed by modeling data memory bandwidth and data memory interference as the primary constraints on execution speed. Algorithms with low interference between data flow graph nodes require only simple models of memory interference to be successfully decomposed. For high interference algorithms the memory interference can be (1) modeled using a linear model of interference, (2) modeled by a queuing network of exponential servers which is solved computationally, or (3) modeled exactly and then simulated. These three techniques give estimates of the aggregate effect of memory interference to be factors of 10.9, 2.11, and 1.82, respectively (the latter being the most accurate).

References

[1]

Wulf, W. A. and C. G. Bell, "C.MMP---A Multi-Mini-Processor", AFIPS Conference Proceedings, Vol. 41, 1972, pp. 765--777.

Digital Library

Google Scholar

[2]

Heart, F. E., S. M. Ornstein, W. R. Crowther, and W. B. Barker, "A new Minicomputer/multiprocessor for the ARPA network", AFIPS Conference Proceedings, Vol. 42, NCC 1973, pp. 529--537.

Digital Library

Google Scholar

[3]

Baer, J. L., "A Survey of Some Theoretical Aspects of Multiprocessing", Computing Surveys, Vol. 5, No. 1, March 1973.

Digital Library

Google Scholar

[4]

Siewiorek, D. P., W. C. Brantley, and G. W. Leive, "Modeling Multi-processor Implementations of Passive Sonar Signal Processing", Final Report---NRL Contract Number N00173-76-C-0048, Carnegie-Mellon University, Pittsburgh, Pa., October 1975.

Google Scholar

[5]

Allen, Jonathan, "Computer Architecture for Signal Processing", Proc. of IEEE, Vol. 55, No. 12, December 1967.

Google Scholar

[6]

Smith, H. H. and L. E. Russo, "Microprogrammed Benchmarks for the Signal Processing Arithmetic Unit for the AN/UYK-17(XB-1)(V) Signal Processing Element", Naval Research Laboratory Report No. 7831, January 29, 1975.

Google Scholar

[7]

Froscher, Judith N., "Evaluation of Algorithms for Linear Beamforming on the AN/UYK-17 (XB-1)(V) Signal Processing Element", Naval Research Laboratory, January 1975.

Google Scholar

[8]

Shay, Barry P., "Design Considerations of a Programmable Prediction Digital Signal Processor for Radar Application", Naval Research Laboratory, NRL-7455, December 1972.

Google Scholar

[9]

Buzen, Jeffrey P., "Computational Algorithms for Closed Queuing Networks with Exponential Servers", CACM, Vol. 16, No. 9, September 1973, pp. 527--531.

Digital Library

Google Scholar

Cited By

View all

Nader A(1980)PETRI NETS FOR REAL TIME CONTROL ALGORITHMS DECOMPOSITIONDistributed Computer Control System10.1016/B978-0-08-024490-7.50032-1(197-210)Online publication date: 1980
https://doi.org/10.1016/B978-0-08-024490-7.50032-1
Nader A(1979)Petri Nets for Real Time Control Algorithms DecompositionIFAC Proceedings Volumes10.1016/S1474-6670(17)65401-612:9(197-210)Online publication date: Sep-1979
https://doi.org/10.1016/S1474-6670(17)65401-6

Recommendations

Computing branch decomposition of large planar graphs
WEA'08: Proceedings of the 7th international conference on Experimental algorithms

A graph of small branchwidth admits efficient dynamic programming algorithms for many NP-hard problems on the graph. A key step in these algorithms is to find a branch decomposition of small width for the graph. Given a planar graph G of n vertices, an ...
Decomposition of complete graphs into paths and stars

Let P"k"+"1 denote a path of length k and let S"k"+"1 denote a star with k edges. As usual K"n denotes the complete graph on n vertices. In this paper we investigate the decomposition of K"n into paths and stars, and prove the following results. Theorem ...
Decomposition of the Flow Polynomial

The flow polynomials denote the number of nowhere-zero flows on graphs, and are related to the well-known Tutte polynomials and chromatic polynomials. We will show the decomposition of the flow polynomials by edge-cuts and vertex-cuts of size 2 or 3. ...

Comments

Information & Contributors

Information

Published In

AFIPS '77: Proceedings of the June 13-16, 1977, national computer conference

June 1977

1039 pages

ISBN:9781450379144

DOI:10.1145/1499402

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 June 1977

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
115
Total Downloads

Downloads (Last 12 months)31
Downloads (Last 6 weeks)8

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Nader A(1980)PETRI NETS FOR REAL TIME CONTROL ALGORITHMS DECOMPOSITIONDistributed Computer Control System10.1016/B978-0-08-024490-7.50032-1(197-210)Online publication date: 1980
https://doi.org/10.1016/B978-0-08-024490-7.50032-1
Nader A(1979)Petri Nets for Real Time Control Algorithms DecompositionIFAC Proceedings Volumes10.1016/S1474-6670(17)65401-612:9(197-210)Online publication date: Sep-1979
https://doi.org/10.1016/S1474-6670(17)65401-6

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

Computing branch decomposition of large planar graphs

Decomposition of complete graphs into paths and stars

Decomposition of the Flow Polynomial

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Recommendations

Computing branch decomposition of large planar graphs

Decomposition of complete graphs into paths and stars

Decomposition of the Flow Polynomial

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations