Keqin Li
- 1.W. Aiello and F.T. Leighton, "Coding theory, hypercube embeddings, and fault tolerance," Proc. 3rd A CM Syrup. on Parallel Algorithms and Architectures, 1991. Google Scholar
Digital Library
- 2.S. Bhatt and J.-Y. Cai, "Taking random walks to grow trees in hypercubes," JACM, vol.40, no.3, pp.741-764, 1993. Google ScholarDigital Library
- 3.S. Bhatt, D. Greenberg, T. Leighton, and P. Liu, "Tight bounds for on-line tree embeddings," Proc. 2nd ACM-SIAM Syrup. on Discrete Algorithms, pp.344-350, 1991. Google ScholarDigital Library
- 4.T. Harris, The Theory of Branching Processes, Springer, Berlin, 1963.Google Scholar
- 5.K. Hwang, Advanced Computer Architecture: Parallelism, $calability, Programmability, McGraw-Hill, inc., 1993. Google ScholarDigital Library
- 6.R.M. Karp and Y. Zhang, "Randomized parallel algorithms for backtrack search and branch-and-bound computation," JACM, vot.40, no.3, pp.765-789, 1993. Google ScholarDigital Library
- 7.F.T. Leighton, M.J. Newman, A.G. Ranade, and E.J. Schwabe, "Dynamic tree embeddings in butterflies and hypercubes," SIAM J. Comput., vol.21, no.4, pp.639-654, 1992. Google ScholarDigital Library
- 8.F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays. Trees. Hypercubes, Morgan Kaufmann, 1992. Google ScholarDigital Library
- 9.K. Lil "Maintenance of tree structured computations on parallel and distributed computer systems," Proc. 111h A CM Syrup. on Applied Comput., pp.337-343, February 1996. Google ScholarDigital Library
- 10.K. Li, "On dynamic tree growing in hypercubes," Proc. Igth A CM Syrup. on Applied Comput., pp.496-503, Feb. 1997. Google ScholarDigital Library
- 11.K. Li "Determining the expected load of dynamic tree erabeddings in hypercubes," Proc. 171h Int'l Conf. on Distributed Computing Systems, pp.508-515, May 1997. Google ScholarDigital Library
- 12.K. Li~ "A randomized algorithm for dynamic tree growing on k-ary n-cubes," Proc. lnt'l Conf. on Parallel and Distributed Processing Tech. and Appl., Vol.II, pp.600-609, June 1997.Google Scholar
- 13.K. Li, "Analysis of randomized load distribution for reproduction trees in linear arrays and rings," Proc. I l th lnt'l Syrup. on High Performance Comput. $yst., pp. t99-215. July 1997.Google Scholar
- 14.K. Li, "Barrel shifter - a close approximation to the completely connected network in supporting dynamic tree structured computations," Proc. IEEE Nat'l Aerospace and Electronics Conf., pp.202-215, July 1997.Google Scholar
- 15.K. Li, "Performance modeling and analysis of dynamic tree embedding in mesh networks," Proc. 9th Int'l Conf. on Parallel and Distributed Comput. and 3yst., pp.470-475, October 1997.Google Scholar
- 16.U. Manber, Introduction to Algorithms - A Creative Approach, Addison-bVesley, 1989. Google ScholarDigital Library
- 17.J. Pearl, Heuristics: Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley, 1984. Google ScholarDigital Library
- 18.F.P. Preparata and J. Vuillemin, "The cube-connected cycles: a versatile network for parallel computation," CA CM, vo1.24, no.5, pp.300-309, 198l. Google ScholarDigital Library
- 19.A.G. Ranade, "Optimal speedup for backtrack search on a butterfly network," Proc. 3rd A CM Syrup. on Parallel Algorithms and Architectures, pp.40-48, 1991. Google ScholarDigital Library
Index Terms
- Performance evaluation of probabilistic tree embedding in cube-connected cycles
Recommendations
Performance evaluation of a random-walk-based algorithm for embedding dynamically evolving trees in hypercubic networks: Research Articles
Systems Performance EvaluationIn many tree-structured parallel computations, the size and structure of a tree that represents a parallel computation is unpredictable at compile-time; the tree evolves gradually during the course of the computation. When such a computation is ...
Compressing cube-connected cycles and butterfly networks
SPDP '90: Proceedings of the 1990 IEEE Second Symposium on Parallel and Distributed ProcessingThe authors consider the simulation of large cube-connected cycles (CCC) large butterfly networks (BFN) on smaller ones, a problem that arises when algorithms designed for an architecture of an ideal size are to be executed on an existing architecture ...
Embedding Cube-Connected Cycles Graphs into Faulty Hypercubes
We consider the problem of embedding a cube-connected cycles graph (CCC) into a hypercube with edge faults. Our main result is an algorithm that, given a list of faulty edges, computes an embedding of the CCC that spans all of the nodes and avoids all ...
Comments