E. Lumer and B.A. Huberman. Dynamics of resource allocation in distributed systems. Preprint (submitted to IEEE Transactions on SMC), Xerox Palo Alto Research Center, March 1990. I Form Approved REPORT DOCUMENTATION PAGE OMB NO. 0704-0188  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Distributed Data-balanced Dictionary Based on the B-link Tree - Johnson, Colbrook (1992) (7 citations) (Correct)
....react quickly to a change in load on a particular processor must be limited. Suitable load propagation mechanisms include probing [37] gradient methods [38] processor pair ing [39, 40] drafting algorithms [41] and bidding algorithms [42] The ultradiffusive algorithms of Lumer and Huberman [43], which uses a hierarchical control structure, are particularly well suited when the number of processors is large. 4 Conclusions We present a distributed dictionary based on the B link tree, the dB tree. The interior nodes of the tree are replicated in order to allow many processors to read the ....
E. Lumer and B.A. Huberman. Dynamics of resource allocation in distributed systems. Preprint (submitted to IEEE Transactions on SMC), Xerox Palo Alto Research Center, March 1990. I Form Approved REPORT DOCUMENTATION PAGE OMB NO. 0704-0188
A Distributed, Replicated, Data-Balanced Search Structure - Johnson, Colbrook (Correct)
....will react quickly to a change in load on a particular processor must be limited. Suitable load propagation mechanisms include probing [6] gradient methods [28] processor pairing [14, 5] drafting algorithms [35] and bidding algorithms [13] The ultradiffusive algorithms of Lumer and Huberman [29], which uses a hierarchical control structure, are particularly well suited when the number of processors is large. 5. Analysis. The dB tree algorithm is designed to avoid blocking and permit highly concurrent access. The only occasion when an action is blocked occurs when a parent points to a ....
E. Lumer and B. Huberman, Dynamics of resource allocation in distributed systems, preprint (submitted to ieee transactions on smc), Xerox Palo Alto Research Center, March 1990.
A Distributed Data-balanced Dictionary Based on the B-link Tree - Johnson, Colbrook (1992) (7 citations) (Correct)
....to a change in load on a particular processor must be limited. 16 REFERENCES Suitable load propagation mechanisms include probing [37] gradient methods [38] processor pairing [39, 40] drafting algorithms [41] and bidding algorithms [42] The ultradiffusive algorithms of Lumer and Huberman [43], which uses a hierarchical control structure, are particularly well suited when the number of processors is large. 4 Conclusions We present a distributed dictionary based on the B link tree, the dB tree. The interior nodes of the tree are replicated in order to allow many processors to read the ....
E. Lumer and B.A. Huberman. Dynamics of resource allocation in distributed systems. Preprint (submitted to IEEE Transactions on SMC), Xerox Palo Alto Research Center, March 1990.
Cooperative Problem Solving - Tad (1992) (17 citations) Self-citation (Huberman) (Correct)
No context found.
Eric Lumer and Bernardo Huberman. Dynamics of resource allocation in distributed systems. Technical Report P90-00007, Xerox Palo Alto Research Center, Palo Alto, CA, 1990.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC