
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
B.C. Kuszmaul, "Fast, Deterministic Routing, on Hypercubes, Using Small Buffers," IEEE Transactions on Computers, vol. 39, no. 11, pp. 13901393, November, 1990.  
BibTex  x  
@article{ 10.1109/12.61048, author = {B.C. Kuszmaul}, title = {Fast, Deterministic Routing, on Hypercubes, Using Small Buffers}, journal ={IEEE Transactions on Computers}, volume = {39}, number = {11}, issn = {00189340}, year = {1990}, pages = {13901393}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.61048}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Fast, Deterministic Routing, on Hypercubes, Using Small Buffers IS  11 SN  00189340 SP1390 EP1393 EPD  13901393 A1  B.C. Kuszmaul, PY  1990 KW  deterministic routing scheme; communications network; kdimensional hypercube; buffer space; permutations; Hpermutations; computational complexity; multiprocessor interconnection networks. VL  39 JA  IEEE Transactions on Computers ER   
A deterministic routing scheme for a communications network based on the kdimensional hypercube is proposed. The author presents two formulations of the scheme. The first formulation delivers messages in O(k/sup 2/) bit times using O(K) bits of buffer space at each node in the hypercube. The second formulation assumes that there are several batches of messages to be delivered, and makes certain assumptions about the cost of sending messages along the various dimensions of the cube. In this case, the latency for delivery time is still O(k/sup 2/) bit times, but the throughput is increased to one set of messages every O(k) bit times. For the first formulation, the author restricts himself to routings which are subsets of permutations (i.e. every node sends at most one message and receives at most one message). The second formulation indicates a way to perform routings which are subsets of Hpermutations (i.e. every node sends at most H messages and receives at most H messages).
[1] M. Ajtai, J. Komlos, and E. Szemeredi, "AnO(nlogn) sorting network," inProc. 15th ACM Symp. Theory Comput., 1983, pp. 19.
[2] K. E. Batcher, Sorting networks and their applications, inAFIPS Proc. Spring Joint Comput. Conf., Atlantic City, NJ, Apr. 1968, pp. 307314.
[3] G. E. Blelloch, "Parallel prefix vs. concurrent memory access," Tech. Rep., Thinking Machines Corp., Oct. 1986.
[4] G. E. Blelloch, "Scans as primitive parallel operations," inProc. 1987 Int. Conf. Parallel Processing, Aug. 1987, pp. 355362.
[5] R. A. Borodin and J. E. Hopcroft, "Routing, merging and sorting on parallel models of computation," inProc. 14th ACM Symp. Theory Comput., San Francisco, CA, Apr. 1982, pp. 338344.
[6] D. P. Christman, "Programming The Connection Machine," Master's thesis, Dep. Elec. Eng. Comput. Sci., Massachusetts Institute of Technology, Jan. 1983.
[7] W.J. Dally and C.L. Seitz, "DeadlockFree Message Routing in Multiprocessor Interconnection Networks,"IEEE Trans. Computers, Vol. C36, No. 5, May 1987, pp. 547553.
[8] F. E. Fich, "New bounds for parallel prefix circuits," inProc. 15th Annu. ACM Symp. Theory Comput., 1983, pp. 100109.
[9] W. D. Hillis,The Connection Machine. Cambridge, MA: MIT Press, 1985.
[10] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: AddisonWesley, 1973.
[11] C. E. Leiserson, "Area efficient layouts (for VLSI)," inProc. Symp. Foundations Comput. Sci., 1980.
[12] G. Lev, N. Pippenger, and L. G. Valiant, "A fast parallel algorithm for routing in permutation networks,"IEEE Trans. Comput., 1981.
[13] J. Rose, Personal communication, 1985. J. Rose is currently employed at Thinking Machines Corporation, 245 First Street, Cambridge, MA.
[14] J. T. Schwartz, "Ultracomputers,"ACM Trans. Programming Languages Syst., vol. 2, no. 4, pp. 484521, Oct. 1980.
[15] C. D. Thompson, "The VLSI complexity of sorting,"IEEE Trans. Comput., vol. C32, pp. 11711184, Dec. 1983.
[16] J. D. Ullman,Computational Aspects of VLSI. Rockville, MD: Computer Science Press, 1984.
[17] L. G. Valiant and G. Brebner, "Universal schemes for parallel communication," inProc. 13th Annu. ACM Symp. Theory Comput., 1981.