8/5/2023 0 Comments Hyper cube![]() ![]() on Parallel Processing, vol. 1, Silver Spring, MD: IEEE Computer Society Press, pp. 103–110. (1989), "On the Permutation Capability of a Circuit-Switched Hypercube", Proc. ^ Optimal Numberings and Isoperimetric Problems on Graphs, L.H.(1955), "Über drei kombinatorische Probleme am n-dimensionalen Wiirfel und Wiirfelgitter", Abh. ![]() Matchings extend to Hamiltonian cycles in hypercubes on Open Problem Garden. (1963), "Some complete cycles on the n-cube", Proceedings of the American Mathematical Society, American Mathematical Society, 14 (4): 640–643, doi: 10.2307/2034292, JSTOR 2034292. (2004), Across the Board: The Mathematics of Chessboard Problems, Princeton University Press, p. 68, ISBN 978-8-5. The family Q n for all n > 1 is a Lévy family of graphs. Seitz CL, Athas W, Flaig C, Martin A, Seieovic J, Steele CS, Su WK (1988) The architecture and programming of the ametek series 2010 multicomputer.In both cases. In: Proceedings of ICPP workshop on challenges for parallel processing, CRC Press, Oconomowc, August 1995 IEEE Comput 21(8):26–38īecker J, Sterling D, Savarese T, Dorband JE, Ranawake UA, Packer CV (1995) Beowulf: a parallel workstation for scientific computation. Tucker LW, Robertson GG (1988) Architecture and applications of the connection machines. The nCUBE Handbook, Beaverton OR, 1986 and the nCUBE 6400 processor, user manual, Beavertonĭunigan TH (1991) Performance of the Intel iPSC 1/2/860 and Ncube 3200/6400 hypercubes, parallel computing 17. In: Lecture notes in control and information sciences, vol 113/1988. Hawkinson S (1988) The FPS T series supercomputer, system modelling and optimization. In: Proceedings of the third conference on hypercube concurrent computers and applications, Pasadena, 19–, pp 51–60 Nugent SF (1988) The iPSC/2 direct-connect communications technology. In: Proceedings of the third conference on hypercube concurrent computers and applications, Pasadena, 19–, pp 43–50 In: Proceedings of the 6th IEEE distributed memory computing conference, DMCC, Portland, May 1991 Stricker T (1991) Message routing in irregular meshes and tori. In: Proceedings of the symposium of parallel algorithms and architectures, ACM SPAA’94, Cape May, Jan 1994 Hinrichs S, Kosak C, O’Hallaron D, Stricker T, Take R (1994) Optimal all-to-all personalized communication in meshes and tori. Nassimi D, Sahni S (1979) Bitonic sort on a mesh-connected parallel computer. ![]() In: Proceedings of the american federation of information processing societies spring joint computer conference, vol 32. In: Proceedings of the symposium for parallel algorithms and architectures, pp 148–157, San Diego, June 1992īatcher KE (1968) Sorting networks and their applications. Stricker T (1992) Supporting the hypercube programming model on meshes (a fast parallel sorter for iwarp). Morgan Kaufmann Publishers, San Francisco 837p, ISBN:1-55860-117-1 ![]() Leighton FT (1991) Introduction to parallel algorithms and architectures: array, trees, hypercubes. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |