The existence of a network of fixed-sized switches that satisfies any communication needs

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'04

Volumn 3, Issue , 2004, Pages 1056-1062

  Horn, Geir ^a   Lysne, Olav ^a   Skeie, Tor ^a  

^a SIMULA RESEARCH LABORATORY   (Norway)

Author keywords

Complete connection; Network construction; Realisability; Recursion

Indexed keywords

COMPUTER HARDWARE; COSTS; PARALLEL PROCESSING SYSTEMS; PRODUCT DESIGN; RECURSIVE FUNCTIONS; SWITCHING; TELECOMMUNICATION TRAFFIC; TOPOLOGY;

COMPLETE CONNECTION; NETWORK CONSTRUCTION; REALISABILITY; RECURSION;

NETWORK PROTOCOLS;

EID: 12244258706     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. L. Snyder, "Type architectures, shared memory, and the corollary of modest potential," Annual Review of Computer Science, vol. 1, pp. 289-317, 1986.
2. D. P. Agrawal, C. Chen, and J. R. Burke, "Hybrid graph-based networks for multiprocessing," Telecommunication Systems, vol. 10, pp. 107-134, 1998.
3. M. J. Karol, M. G. Hluchyj, and S. P. Morgan, "Input versus output queueing on a space-division packet switch," IEEE Transactions on Communications, vol. COM-35, no. 12, pp. 1347-1356, 1987.
4. J. S.-C. Chen, Modeling and performance evaluation of generic fast packet switches. PhD thesis, Columbia University, 1990.
5. N. McKeown, A. Mekkittikul, V. Anantharam, and J. Walrand, "Achieving 100% throughput in an input-queued switch," IEEE Transactions on Communications, vol. 47, Aug. 1999.
6. G. Horn, O. Lysne, and T. Skeie, "A criterion for cost optimal construction of irregular networks," in 17th International Parallel and Distributed Processing Symposium (IPDPS'03) (M. Cosnard, A. Gottlieb, and J. Dongarra, eds.), Workshop on Communication Architecture for Clusters (D. K. Panda, J. Duato and C. Srunkel eds.), (Nice, France), IEEE Computer Society, April 22-26 2003.
7. G. Chartrand and L. Lesniak, Graphs & Digraphs. London: Chapman & Hall, 3rd ed., 1996.
8. N. Dershowitz and Z. Manna, "Proving termination with multiset orderings," Communications of the ACM, vol. 22, pp. 465-476, Aug. 1979.