Faster min-max resource sharing in theory and practice

Mathematical Programming Computation

Volumn 3, Issue 1, 2011, Pages 1-35

  Müller, Dirk ^a   Radke, Klaus ^b   Vygen, Jens ^a  

^a UNIVERSITY OF BONN   (Germany)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Chip design; Fractional packing; Fully polynomial approximation scheme; Global routing; Min max resource sharing; Parallelization

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; FUNCTIONS; POLYNOMIAL APPROXIMATION; SET THEORY;

CHIP DESIGN; FRACTIONAL PACKING; FULLY POLYNOMIAL APPROXIMATION SCHEME; GLOBAL ROUTING; PARALLELIZATIONS; RESOURCE SHARING;

TREES (MATHEMATICS);

EID: 84863548400     PISSN: 18672949     EISSN: 18672957     Source Type: Journal    
DOI: 10.1007/s12532-011-0023-y     Document Type: Review

References (24)

1. Albrecht, C.: Global routing by new approximation algorithms for multicommodity flow. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 20, 622-632 (2001)
2. Bienstock, D.: Potential function methods for approximately solving linear programming problems: theory and practice. Kluwer Academic Publishers, Norwell (2002)
3. Bienstock, D., Iyengar, G.: Approximating fractional packings and coverings in O(1) iterations. SIAM J. Comput. 35, 825-854 (2006)
4. Carden, R.C. IV., Li, J., Cheng, C.-K.: A global router with a theoretical bound on the optimum solution. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15, 208-216 (1996)
5. Charikar, M., Chekuri, C., Goel, A., Guha, S., and Plotkin, S.: Approximating a finite metric by a small number of tree metrics. In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, 379-388 (1998)
6. Fleischer, L.K.: Approximating fractional multicommodity flow independent of the number of commodities. SIAM J. Discret. Math. 13, 505-520 (2000)
7. Garg, N., Könemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. SIAM J. Comput. 37, 630-652 (2007)
8. Grigoriadis, M.D., Khachiyan, L.D.: Fast approximation schemes for convex programs with many blocks and coupling constraints. SIAM J. Optim. 4, 86-107 (1994)
9. Grigoriadis, M.D., Khachiyan, L.D.: Coordination complexity of parallel price-directive decomposition. Math. Oper. Res. 21, 321-340 (1996)
10. Hennessy, J.L., Patterson, D.A.: Computer Architecture: A Quantitative Approach, 4th edn. Morgan Kaufmann, San Francisco (2007)
11. IEEE Standard for Binary Floating-Point Arithmetic. ANSI/IEEE Std 754-2008, IEEE (2008)
12. Intel® 64 and IA-32 Architectures Software Developer's Manual, vol. 3A, rev. 037, order number 253668-037US, January 2011. http://www.intel.com
13. Jansen, K., Zhang, H.: Approximation algorithms for general packing problems and their application to the multicast congestion problem. Math. Program. A 114, 183-206 (2008)
14. Khandekar, R.: Lagrangian relaxation based algorithms for convex programming problems. PhD thesis, Indian Institute of Technology, Delhi (2004)
15. Müller, D.: Optimizing yield in global routing. In: Proceedings of the IEEE International Conference on Computer-Aided Design, 480-486 (2006)
16. Owens, S., Sarkar, S., Sewell, P.: A Better x86 Memory Model: x86-TSO. In: Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics; LNCS 5674, pp. 391-407. Springer, Berlin (2009)
17. Plotkin, S.A., Shmoys, D.B., Tardos, É.: Fast approximation algorithms for fractional packing and covering problems. Math. Oper. Res. 2, 257-301 (1995)
18. Raghavan, P.: Probabilistic construction of deterministic algorithms: approximating packing integer programs. J. Comput. Syst. Sci. 37, 130-143 (1988)
19. Raghavan, P., Thompson, C.D.: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7, 365-374 (1987)
20. Shahrokhi, F., Matula, D.W.: The maximum concurrent flow problem. J. ACM 37, 318-334 (1990)
21. Villavicencio, J., Grigoriadis, M.D.: Approximate structured optimization by cyclic block-coordinate descent. In: Fischer, H., Riedmüller, B., Schäffler, S. (eds.) Applied Mathematics and Parallel Computing, pp. 359-371. Physica-Verlag, Heidelberg (1996)
22. Vygen, J.: Near-optimum global routing with coupling, delay bounds, and power consumption. In: Nemhauser, G., Bienstock, D. (eds.) Integer Programming and Combinatorial Optimization; Proceedings of the 10th International IPCOConference; LNCS 3064, pp. 308-324. Springer, Berlin (2004)
23. Young, N.E.: Randomized rounding without solving the linear program. In: Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, pp. 170-178 (1995)
24. Young, N.E.: Sequential and parallel algorithms for mixed packing and covering. In: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pp. 538-546 (2001)