Comment on the performance and scalability of this scheme

Assignment Help Basic Computer Science

Reference no: EM131091093

[FK88] Consider the distributed tree search scheme in which processors are allocated to separate parts of the search tree dynamically. Initially, all the processors are assigned to the root. When the root node is expanded (by one of the processors assigned to it), disjoint subsets of processors at the root are assigned to each successor, in accordance with a selected processor-allocation strategy. One possible processorallocation strategy is to divide the processors equally among ancestor nodes. This process continues until there is only one processor assigned to a node. At this time, the processor searches the tree rooted at the node sequentially. If a processor finishes searching the search tree rooted at the node, it is reassigned to its parent node. If the parent node has other successor nodes still being explored, then this processor is allocated to one of them. Otherwise, the processor is assigned to its parent. This process continues until the entire tree is searched. Comment on the performance and scalability of this scheme.

Reference no: EM131091093

Questions Cloud

Word critical analysis of the chosen topic : The article and the two documentries is about doping in sports and focuses on the cases of Lance Armstrong and Marion Jones--two atheltes who were found guilty of using performance enhancing drugs, but suffered two very different consequences.

Complete a series of substitution values vertically : We have combined three chapters in Excel for this project: Excel - CH06: What-If Analysis, Excel - CH09: Multiple-Sheet Workbook Management, and Excel – CH12: Templates, Styles and Macros.

Goal reflections checklist : The UNST definition of this goal either incorporated into your narrative or quoted above your reflection.

Derive the isoefficiency function of this scheme : derive the isoefficiency function of this scheme.

Comment on the performance and scalability of this scheme : Comment on the performance and scalability of this scheme.

Derive analytical expressions for the scalability : Assume that the cost of communicating a piece of work between any two processors is negligible. Derive analytical expressions for the scalability of the single-level loadbalancing scheme.

Discuss the empirical rule in this context : If you look up the word empirical in a dictionary, you will find that it means "relying on experiment and observation rather than on theory." Discuss the empirical rule in this context.

Determine the isoefficiency term due to this termination : Determine the isoefficiency term due to this termination detection scheme for a spanning tree of depth log p.

Comment on the value of the constants associated : Comment on the value of the constants associated with this isoefficiency term

User Account

All Pages