The scheduling and organization of periodic associative computation: Essential networks

Timothy Van Zandt ()

Review of Economic Design, 1997, vol. 3, issue 1, 15-27

Abstract: This paper defines and characterizes essential decentralized networks for calculating the associative aggregate of one or more cohorts of data. A network is essential if it is not possible to eliminate an instruction or manager and still calulate the aggregate of each cohort. We show that for essential networks, the graphs that depict the operations and data dependencies are trees or forests. These results assist in the characterization of efficient networks.

Keywords: Organizations; decentralization; parallel processing (search for similar items in EconPapers)
JEL-codes: D23 D83 (search for similar items in EconPapers)
Date: 1997-11-27
Note: Received: 15 October 1994 / Accepted: 6 March 1997
References: Add references at CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://link.springer.de/link/service/journals/10058/papers/7003001/70030015.pdf (application/pdf)
http://link.springer.de/link/service/journals/1005 ... 03001/70030015.ps.gz (application/postscript)
Access to the full text of the articles in this series is restricted

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:reecde:v:3:y:1997:i:1:p:15-27

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/10058

Access Statistics for this article

Review of Economic Design is currently edited by Atila Abdulkadiroglu, Fuhito Kojima and Tilman Börgers

More articles in Review of Economic Design from Springer, Society for Economic Design
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().