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.
Volume (Year): 3 (1997)
Issue (Month): 1 ()
|Note:||Received: 15 October 1994 / Accepted: 6 March 1997|
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/10058/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:reecde:v:3:y:1997:i:1:p:15-27. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.