On the use of the linear assignment algorithm in module placement

Proceedings - Design Automation Conference

Volumn , Issue , 1981, Pages 137-144

  Akers, Sheldon B ^a  

^a GENERAL ELECTRIC COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR ASSIGNMENT ALGORITHMS; MODULE PLACEMENT; PLACEMENT PROBLEMS; PROBLEM CONSTRAINTS;

COMPUTER AIDED DESIGN;

COMPUTER PROGRAMMING - SUBROUTINES;

EID: 84989462444     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/dac.1981.1585344     Document Type: Conference Paper

References (17)

1. H. W. Kuhn, "The Hungarian Method for the Assignment Problem", Naval Res. Log. Quart. 12, 83-97 (1955).
2. R. Silver, "An Algorithm f or the Assignment Problem", Commun. Assoc. Comput. Mach. 3, 603-606 (1960).
3. E. A. Dinic and M. A. Kronrod, "An Algorithm for the Solution of the Assignment Problem", Soviet Math. Dokl. 10, 1324-1326 (1969).
4. M. L. Balinski and R. E. Gomory, "A Primal Method for the Assignment and Transportation Problems", Mgmt. Sci. 10, 578-593 (1964).
5. J. Edmonds and R. M. Karp, "Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems", J. Assoc. Comput. Mach. 19, 248-264 (1972).
6. R. S. Barr, F. Glover and D. Klingman, "The Alternating Path Algorithm for Assignment Problems", Math. Prog. 13, 1-13 (1977).
7. M. Hung and W. O. Rom, "Solving the Assignment Problem by Relaxation", Operations Res. 28, 969-982 (1980).
8. L. Steinberg, "The Backboard Wiring Problem: A Placement Algorithm", SIAM Rev., Vol. 3, No. 1, 37-50 (Jan. 1961).
9. R. A. Rutman, "An Algorithm for Placement of Interconnected Elements Based on Minimum Wire Length", Proc. SJCC, 477-491 (1964).
10. R. L. Russo, P. H. Oden and P. K. Wolff, Sr., "An Algorithm for the Partitioning and Mapping of Computer Logic Blocks to Modules", IEEE Trans, on Comp., Vol. C-20, No. 12, 1455-1462 (Dec. 1971).
11. M. Hanan and J. M. Kurtzberg, "Placement Techniques", Chap. 5 in Design Automation of Digital Systems: Theory and Techniques, Vol. 1, (Ed. M. A. Breuer), Prentice-Hall, NJ, 213-282 (1972).
12. M. Hanan and J. M. Kurtzberg, "A Review of the Placement and Quadratic Assignment Problems", SIAM Rev., Vol. 14, No. 2, 324-342 (Apr. 1972).
13. D. C. Schmidt and L. E. Pruffel, "An Iterative Algorithm for Placement and Assignment of Integrated Circuits", Proc. 12th Design Automation Conf., 361-368 (Jun. 1975).
14. M. Hanan, P. K. Wolff, Sr. and B. J. Agule, "A Study of Placement Techniques", J. Des. Auto, and Fault Tol. Comp. 1, 28-61 (1976).
15. M. Breuer, "Min Cut Placement", J. Des. Auto. and Fault Tol. Comp. 1, 343-362 (1977).
16. I. Nishioka, T. Kurimoto, S. Yamamoto, T. Chiba, I. Shirakawa and H. Ozaki, "An Approach to Gate Assignment and Module Placement for Printed Wiring Boards", IEEE Trans, on Comp. C-29, 681-688 (1980).
17. L. C. Cote and A. M. Patel, "The Interchange Algorithms for Circuit Placement Problems", Proc. 13th Des. Auto. Conf., 528-534 (Jun. 1980).