J. Lienig, "Channel and Switchbox Routing with Minimized Crosstalk -- A Parallel Genetic Approach", to appear in: Proceedings of the 10th International Conference on VLSI Design, Jan. 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
An Indexed Bibliography of Distributed Genetic Algorithms - Alander (1999) (4 citations) (Correct)
....S. 345] Lam, S. L. Y. 291] Lamont, Gary B. 111, 439] Laszewski, Gregor von, 446] Lawrence, P. D. 121] Lee, C. D. 500] Lee, Jongsoo, 206, 286] Lehndert, R. van, 498] Leuze, Michael R. 468, 469, 470] Levi, Paul, 342] Levine, David Mark, 104, 138] Li, T. 501] Lienig, Jens, [292, 305, 318, 340] Authors 17 Liepins, Gunar E. 432, 433] Lin, G. 168] Lin, Guangming, 247] Lin, S. C. 341] Lin, Shyh Chang, 189] Lindgren, Kristian, 43] Linkens, Derek. A. 434] Lipsitch, Marc, 44] Lishan, Kang, 65] Liu, Luoping, 87] Logar, Antonette M. 396] Lohrmann, Hartmut, 105] Lopes, ....
.... control parameters, 146] global, 82, 95, 123, 331] multi criteria, 98] multi modal, 89] multidimensional, 65] multiobjective, 263] nonlinear, 419] Pareto, 263] penalty, 188] sinc, 42] parallel, 550, 554, 555] parallel ES, 532, 533] 24 Distributed genetic algorithms parallel GA, [374, 442, 468, 479, 483, 510, 375, 376, 414, 76, 469, 482, 485, 380, 405, 443, 444, 445, 460, 470, 500, 511, 517, 377, 392, 398, 401, 404, 406, 420, 428, 435, 446, 447, 461, 467, 471, 494, 497, 501, 518, 361, 366, 367, 368, 370, 379, 381, 386, 387, 388, 407, 410, 416, 417, 418, 432, 437, 441, 448, 449, 450, 451, 452, 453, 476, 480, 486, 492, 495, 502, 503, 504, 505, 506, 519, 523, 78, 351, 352, 356, 360, 363, 365, 369, 372, 382, 384, 546, 389, 393, 396, 547, 399, 408, 409, 412, 419, 422, 425, 429, 433, 440, 454, 455, 462, 464, 472, 474, 475, 481, 558, 491, 496, 54, 507, 509, 515, 516, 353, 354, 355, 357, 358, 359, 362, 364, 545, 373, 383, 385, 391, 394, 395, 397, 548, 400, 402, 403, 411, 413, 415, 421, 426, 427, 430, 431, 434, 439, 458, 463, 465, 466, 473, 477, 478, 61, 488, 62, 489, 490, 498, 499, 508, 513, 514, 520, 521, 522, 79, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 100, 101, 103, 104, 105, 107, 109, 110, 111, 112, 114, 115, 116, 117, 118, 119, 120, 121, 122, 124, 125, 127, 128, 130, 131, 132, 133, 134, 135, 136, 137, 138, 140, 141, 142, 143, 144, 145, 146, 147, 149, 150, 151, 55, 152, 153, 154, 155, 156, 157, 158, 159, 161, 162, 163, 164, 166, 167, 168, 169, 170, 171, 172, 173, 175, 176, 177, 178, 180, 181, 182, 183, 184, 185, 186, 188, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 534, 201, 202, 203, 204, 205, 206, 207, 209, 210, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 234, 235, 236, 237, 238, 240, 241, 242, 244, 245, 246, 249, 250, 251, 252, 253, 254, 255, 538, 256, 257, 258, 259, 260, 261, 262, 263, 539, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 280, 281, 282, 283, 284, 285, 286, 287, 288, 291, 292, 293, 295, 296, 297, 298, 299, 300, 301, 302, 303, 305, 306, 307, 309, 350, 310, 311, 312, 313, 314, 315, 542, 316, 317, 318, 319, 320, 321, 322, 323, 324, 69, 325, 326, 327, 328, 329, 330, 331, 333, 334, 335, 336, 337, 70, 338, 339, 340, 341, 73, 57, 38, 342, 343, 344, 345, 346, 347, 348, 349, 456, 457] parallel GA 8 CPUs, 371] adaptive, 294] analysis, 148] asynchronous, 524] bibliography, 80, 525] communication, 423, 108, 211] computer network, 424] distributed, 512] environment, 102] FIN, 106, 139] ne grained, 264] GAME, 99] hardware, 129] hybrid, 187] island, 332] ....
[Article contains additional citation context not shown here]
Jens Lienig. Channel and switchbox routing with minimized crosstalk. a parallel genetic algorithm approach. In Proceedings of the Tenth International Conference on VLSI Design, pages 27-31, Hyderabad, India, 4.- 7. January 1997. IEEE, Los Alamitos, CA. yEEA52965/97 ga97aJLienig.
An Indexed Bibliography of Genetic Algorithms in Electronics and.. - Alander (1999) (1 citation) (Correct)
....P. 211] Lavenier, Dominique, 214] Lee, K. L. 40] Lee, Michael A. 270] Lee, Terry, 180, 229] Lee, Yuh Sheng, 163] Leenaerts, Domine, 30, 38] Lemoine, Eric, 39] Lesniak, Joanna, 18] Leu, Ming C. 114, 115] Leung, S. H. 149] Levitt, Jeremy R. 170] Liao, Jianmin, 70] Lienig, Jens, [131, 20, 157, 212, 241, 254, 269, 280] Lim, H. T. 40] Lin, Y. L. 301, 302] Lin, Youn Long, 163] Authors 15 Liu, B. D. 332] Liu, Luoping, 126] Liu, Xingzhao, 138, 11, 329, 118, 119, 120] Lohn, Jason, 101] Luchian, Henri, 13] Ly, Tai A. 330] Majhi, A. K. 171] Makki, R. Z. 133] Malgeri, M. 183] Mandal, C. A. ....
.... circuits, 34] mutation, 10] neural networks, 113, 333, 81] electronic nose, 33] modeling, 97] optoelectronic, 116] training, 116, 110] node partitioning, 292] OBDD, 272] optics IR, 108] optimization digital electronics, 31] multi objective, 270] packaging 3D, 211] parallel GA, [295, 296, 299, 311, 288, 289, 322, 126, 139, 154, 169, 178, 181, 216, 221, 241, 269, 98, 280] parallel GA adaptive, 245] workstation network, 312] permutation crossover, 140] physics solid state, 29] thermal, 14] PLA, 122, 146] placement, 294] placement optimization, 233] planning electronics, 17] population size 30, 116] Subject index 19 problem state assignment, 287] ....
[Article contains additional citation context not shown here]
Jens Lienig. Channel and switchbox routing with minimized crosstalk. a parallel genetic algorithm approach. In Proceedings of the Tenth International Conference on VLSI Design, pages 27--31, Hyderabad, India, 4.- 7. January 1997. IEEE, Los Alamitos, CA. yEEA52965/97 ga97aJLienig.
Physical Design of VLSI Circuits and the Application of Genetic.. - Lienig (1997) (1 citation) Self-citation (Lienig) (Correct)
....The layout of Burstein s difficult switchbox achieved with our algorithm is depicted in Figure 6. 4.5.3 Reduction of Crosstalk By adjusting the value of the weight for crosstalk (see Section 4.4) our algorithm can also optimize the interconnections regarding crosstalk. The results presented in [29] show that an increase of the weight for crosstalk leads to significantly fewer parallel routed net segments. Hence, our router can construct solutions which contain minimal coupling capacitances between interconnections an increasingly significant consideration in sub micron VLSI design. ....
....of the weight for crosstalk leads to significantly fewer parallel routed net segments. Hence, our router can construct solutions which contain minimal coupling capacitances between interconnections an increasingly significant consideration in sub micron VLSI design. However, as discussed in [29], the minimization of crosstalk leads in general to an increase in both the netlength and the number of vias. It has to be decided by the user to which optimization goals he she gives priority. Bench Col Net Time mark Algorithm umns Rows length Vias (sec) PACKER[16] 18 6 167 25 710 ....
J. Lienig, "Channel and Switchbox Routing with Minimized Crosstalk -- A Parallel Genetic Approach", to appear in: Proceedings of the 10th International Conference on VLSI Design, Jan. 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC