
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Suresh Rai, Jerry L. Trahan, Thomas Smailus, "Processor Allocation in Hypercube Multiprocessors," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 6, pp. 606616, June, 1995.  
BibTex  x  
@article{ 10.1109/71.388041, author = {Suresh Rai and Jerry L. Trahan and Thomas Smailus}, title = {Processor Allocation in Hypercube Multiprocessors}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {6}, number = {6}, issn = {10459219}, year = {1995}, pages = {606616}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.388041}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Processor Allocation in Hypercube Multiprocessors IS  6 SN  10459219 SP606 EP616 EPD  606616 A1  Suresh Rai, A1  Jerry L. Trahan, A1  Thomas Smailus, PY  1995 VL  6 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] A. AlDhelaan and B. Bose,“A new strategy for processors allocation in an$n$cube multiprocessor,”inProc. Int. Phoenix Conf. Comput. Commun.,Mar. 1989, pp. 114–118.
[2] J. R. Armstrong and F. G. Gray,“Fault diagnosis in$n$cube array of microprocessors,”IEEE Trans. Comput.,vol. C30, pp. 587–590, Aug. 1981.
[3] M. S. Chen and K. G. Shin,“Processor allocation in an$N$cube multiprocessor using gray codes,”IEEE Trans. Comput., vol. C37, pp. 1396–1407, Dec. 1987.
[4] P.J. Chuang and N.F. Tzeng,“A fast recognitioncomplete processor allocation strategy for hypercube computers,”IEEE Trans. Comput.,vol. 41, pp. 467–479, Apr. 1992.
[5] S. Dutt and J. P. Hayes,“Subcube allocation in hypercube computers,”IEEE Trans. Comput., vol. 40, pp. 341–352, Mar. 1991.
[6] A.H. Esfahanian,“Generalized measures of fault tolerance with application to$n$cube networks,”IEEE Trans. Comput.,vol. C38, pp. 1586–1591, Nov. 1989.
[7] F. Harary,“A survey of the theory of hypercube graphs,”Comput. Math. Applicat.,vol. 15, pp. 277–289, 1988.
[8] J. P. Hayes and T. Mudge,“Hypercube supercomputers,”IEEE Proc.,vol. 77, pp. 1829–1841, Dec. 1989.
[9] J. Kim, C. R. Das, and W. Lin,“A topdown processor allocation scheme for hypercube computers,”IEEE Trans. Parallel and Distrib. Syst., vol. 2, pp. 20–30, Jan 1991.
[10] S. Rai and D. P. Agrawal,“Advances in distributed system reliability,”Tutorial Text, IEEE Computer Society Press, 1990.
[11] S. Rai and J. L. Trahan,“A reconfiguration technique for fault tolerance in a hypercube,”Parallel Process. Lett.,vol. 2, no. 2–3, pp. 129–138, 1992.
[12] S. Soh and S. Rai,“CAREL: Computer Aided RELiability evaluator for distributed computing networks,”IEEE Trans. Parallel Distributed Syst., vol. 2, pp. 199–213, Apr. 1991.
[13] Y. Saad and M. H. Schultz,“Topological properties of hypercubes,”IEEE Trans. Comput.,vol. 37, pp. 867–871, July 1988.
[14] T. O. Smailus,“On processor allocation/deallocation techniques in hypercubes,”M.S. thesis, Dep. Elec. Comput. Eng., Louisiana State Univ., 1992.
[15] H. Wang and Q. Yang,“Prime cube graph approach for processor allocation in hypercube multiprocessors,”inProc. Int. Conf. Parallel Process.,Aug. 1991, pp. I25I32.
[16] S. Y. Yoon, O. Kang, H. Yoon, S. R. Maeng, and J. W. Cho,“A heuristic processor allocation strategy in hypercube systems,”inProc. 3rd Symp. Parallel Distrib. Process.,Dec. 1991, pp. 574–581.
[17] N. N. Biswas,Logic Design Theory.Englewood Cliffs, NJ: PrenticeHall, 1993.
[18] Y. Chang and L. N. Bhuyan,“Fault tolerant subcube allocation in hypercubes,”inProc. Int. Conf. Parallel Process.,vol. 1, Aug. 1993, pp. 132–136.
[19] G. Kim and H. Yoon,“A processor allocation strategy using cube coalescing in hypercube multicomputers,”inProc. 5th Symp. Parallel Distrib. Process.,Dec. 1993, pp. 596–605.
[20] D. D. Sharma and D. K. Pradhan,“Fast and efficient strategies for cubic and noncubic allocation in hypercube multiprocessors,”inProc. Int. Conf. Parallel Process.,vol. 1, Aug. 1993, pp. 118–12.