The scheduling and organization of periodic associative computation: Essential networks

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.

MoreLess

Year of publication:	1997-11-27
Authors:	Zandt, Timothy Van
Published in:	Review of Economic Design. - Springer. - Vol. 3.1997, 1, p. 15-27
Publisher:	Springer
Subject:	Organizations \| decentralization \| parallel processing

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf application/postscript
Type of publication:	Article
Notes:	Received: 15 October 1994 / Accepted: 6 March 1997
Classification:	D83 - Search, Learning, Information and Knowledge ; D23 - Organizational Behavior; Transaction Costs; Property Rights
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005370591