An extension of the processor farm using a tree architecture
Authors: Green, S. A., Paddon, Derek J.
For problems that require a small database a processor farm model was proposed by May and Sheppard, and has subsequently had much success. Here, we assume that the database is too large to store completely at each node of the farm and consequently, data must be communicated throughout the network during the execution of a problem. The processor farm model is extended to allow work tasks to be completed when data items not resident locally at a node can be obtained by making a request for data across the network. The farm model is further extended by configuring the system as a tree topology. The extended farm topology is evaluated by using a set of graphics benchmark problems. Benchmark results are given for a tree farm of upto fifteen worker processors.
OUG-9: Occam and the Transputer -- Research and Applications, Charlie Askew, 1988, pp 53 - 70 published by IOS Press, Amsterdam
This record in other formats:Web page: BibTEX, Refer
Plain text: BibTEX, Refer
If you have any comments on this database, including inaccuracies, requests to remove or add information, or suggestions for improvement, the WoTUG web team are happy to hear of them. We will do our best to resolve problems to everyone's satisfaction.
Copyright for the papers presented in this database normally resides with the authors; please contact them directly for more information. Addresses are normally presented in the full paper.
Pages © WoTUG, or the indicated author. All Rights Reserved.
Comments on these web pages should be addressed to: www at wotug.org