A polynomial-time tree decomposition to minimize congestion
暂无分享,去创建一个
[1] Harald Räcke,et al. Minimizing Congestion in General Networks , 2002, FOCS.
[2] Bruce Hendrickson,et al. Support Theory for Preconditioning , 2003, SIAM J. Matrix Anal. Appl..
[3] Allan Borodin,et al. Routing, Merging, and Sorting on Parallel Models of Computation , 1985, J. Comput. Syst. Sci..
[4] Baruch Awerbuch,et al. Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks , 1994, STOC '94.
[5] Charles E. Leiserson,et al. Randomized Routing on Fat-Trees , 1989, Adv. Comput. Res..
[6] Christos Kaklamanis,et al. Tight bounds for oblivious routing in the hypercube , 1990, SPAA '90.
[7] Marcin Bienkowski,et al. A practical algorithm for constructing oblivious routing schemes , 2003, SPAA '03.
[8] Yossi Azar,et al. Local optimization of global objectives: competitive distributed deadlock resolution and resource allocation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[9] Bruce M. Maggs,et al. Fast algorithms for bit-serial routing on a hypercube , 1990, SPAA '90.
[10] Philip N. Klein,et al. Excluded minors, network decomposition, and multicommodity flow , 1993, STOC.
[11] Yuval Rabani,et al. An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm , 1998, SIAM J. Comput..
[12] Edith Cohen,et al. Optimal oblivious routing in polynomial time , 2004, J. Comput. Syst. Sci..
[13] Bruce M. Maggs,et al. Exploiting locality for data management in systems of limited bandwidth , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[14] Frank Thomson Leighton,et al. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[15] T. H. Yeh. Competitive Analysis of Minimal Oblivious Routing Algorithms on Hypercubes , 2001 .
[16] Berthold Vöcking,et al. Almost optimal permutation routing on hypercubes , 2001, STOC '01.
[17] Amos Fiat,et al. On-line routing of virtual circuits with applications to load balancing and machine scheduling , 1997, JACM.
[18] Gary L. Miller,et al. Performance evaluation of a new parallel preconditioner , 1995, Proceedings of 9th International Parallel Processing Symposium.
[19] Friedhelm Meyer auf der Heide,et al. Static and Dynamic Data Management in Networks , 1997, Euro-Par.
[20] G. Miller,et al. Solving Symmetric Diagonally-Dominant Systems by Preconditioning , 2003 .
[21] Leslie G. Valiant,et al. Universal schemes for parallel communication , 1981, STOC '81.
[22] Forbes Avenue,et al. Performance Evaluation of a New Parallel Preconditioner Keith D. Gremban Gary L. Miller Marco Zagha School of Computer Science , 1995 .
[23] Charles E. Leiserson,et al. Fat-trees: Universal networks for hardware-efficient supercomputing , 1985, IEEE Transactions on Computers.