Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

book chapter · 1993

Dataflow Computers

Justin R Smith

Cited by 0Abstract and details only

Abstract

Abstract Although these algorithms look considerably more complex than the corresponding algorithms for the Butterfly and the shuffle-exchange network, their execution-time is comparable. Consider a modification of the butterfly network, where we introduce a new edge in each column that connects the top and bottom vertex - we will call this the m-Butterfly network. It is similar, but not identical to, the form of the Butterfly that identifies the top and bottom rows. Show that the CCC network with a given value of r is isomorphic to an m-Butterfly network with 2r rows.

Cite this paper

APA 7

Smith, J. R. (1993). Dataflow Computers. https://doi.org/10.1093/oso/9780195078817.003.0015

MLA 9

Smith, Justin R. “Dataflow Computers.” 1993, p. 97, https://doi.org/10.1093/oso/9780195078817.003.0015.

Chicago

Smith, Justin R. 1993. “Dataflow Computers.” https://doi.org/10.1093/oso/9780195078817.003.0015.

Harvard

Smith, J.R. (1993) ‘Dataflow Computers’. Available at: https://doi.org/10.1093/oso/9780195078817.003.0015.

BibTeX
@incollection{smith1993dataflow,
  title = {{Dataflow Computers}},
  author = {Smith, Justin R},
  pages = {97},
  year = {1993},
  doi = {10.1093/oso/9780195078817.003.0015}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers