M. Livingston and Q. F. Stout, "Fault Tolerance of the Cyclic Buddy Subcube Location Scheme in Hypercubes," in Proceedings of the 6th Distributed Memory Computing Conference (DMCC6), 1991. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Lazy Scheduling Scheme for Hypercube Computers - Mohapatra, Yu, Das (1995) (2 citations) (Correct)
....of allocation and deallocation are O(n2 n ) and O(2 k ) respectively. An extension of this scheme for complete subcube recognition is done using a buddy tree [1] A fault tolerant variant of the buddy strategy was reported by Livingston and Stout by using a cyclic buddy grouping scheme [13]. Gray Code The gray code strategy proposed in [4] stores the allocation bits using a binary reflected gray code (BRGC) Here the least integer m is determined such that all the (i mod 2 n ) bits indicate availability of nodes, where i 2 [m2 k Gamma1 ; m 2)2 k Gamma1 Gamma 1] ....
Livingston, M., and Stout, Q. F. Fault Tolerance of the Cyclic Buddy Subcube Location Schemes in Hypercubes. Proc. Distributed Memory Computing Conference, 1991, pp. 34-41.
Cyclic Block Allocation: A New Scheme for.. - Livingston, Lo.. (1999) Self-citation (Livingston) (Correct)
....We have found a linear time recognition algorithm for a large subclass of contiguous masks. We believe there exists a polynomial time recognition algorithm for all contiguous masks; this is part of our ongoing research. 3. 3 Address aggregation capability Our work in the area of faulty hypercubes [6, 13] yields some results that have severe implications for the likelihood of address aggregation even in the best of circumstances. The problem of reducing the set of addresses allocated to a child domain by repeatedly halving its address space is related to the problem of 0 20 40 60 80 100 2 4 ....
....and s is the number of sibling domains. This basic doubling algorithm can easily be modi ed for doubling with pre x based masks and with non contiguous masks. Migration and swapping: Migration and swapping use the basic approach of the (Full) Cyclic subcube allocation scheme for hypercubes [13] to nd an available block of addresses of the desired size; this parallel algorithm recognizes subcubes in an n bit address space using 2 n processors. For address allocation under CBA, we developed a sequential algorithm for Cyclic to be executed on the parent node when migration or swapping ....
Marilynn L. Livingston and Quentin F. Stout. Fault tolerance of the cyclic buddy subcube location scheme in hypercubes. The Sixth Distributed Memory Computing Conf. Proceedings (DMCC6), pages 34-41, 1991.
A Theoretical Framework for the Multicast Address.. - Lo, Zappala.. (2002) (Correct)
No context found.
M. Livingston and Q. F. Stout, "Fault Tolerance of the Cyclic Buddy Subcube Location Scheme in Hypercubes," in Proceedings of the 6th Distributed Memory Computing Conference (DMCC6), 1991.
The Multicast Address Allocation Problem: Theory and.. - Zappala, Lo, GauthierDickey (2004) (Correct)
No context found.
M. Livingston and Q. F. Stout, "Fault Tolerance of the Cyclic Buddy Subcube Location Scheme in Hypercubes," in 6th Distributed Memory Computing Conference, 1991.
The Multicast Address Allocation Problem: Theory and.. - Zappala, Lo, GauthierDickey (2004) (Correct)
No context found.
M. Livingston and Q. F. Stout, "Fault Tolerance of the Cyclic Buddy Subcube Location Scheme in Hypercubes," in 6th Distributed Memory Computing Conference, 1991.
A Theoretical Framework for the Multicast Address.. - Lo, Zappala.. (2002) (Correct)
No context found.
M. Livingston and Q. F. Stout, "Fault tolerance of the cyclic buddy subcube location scheme in hypercubes," in Proceedings of the 6th Distributed Memory Computing Conference (DMCC6), 1991.
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