Тёмный

Kernighan-Lin(KL) algorithm for Partitioning 

John Reuben
Подписаться 1,7 тыс.
Просмотров 51 тыс.
50% 1

KL algorithm is an iterative improvement algorithm for bi-partitioning a netlist.Belonging to the class of group migration algorithms, it is based on exchanging a pair of nodes across the partition to reduce the cutset.In this lecture, the algorithm is explained with an example.

Опубликовано:

 

11 авг 2015

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 39   
@vivek4m
@vivek4m 5 лет назад
Simply amazing!! You made it look so easy.
@MdMaksudUlKabirRico
@MdMaksudUlKabirRico 4 года назад
Wow! This is the best explanation of KL Algorithm on RU-vid. Thank you, brother. It was very helpful.
@johnreuben6930
@johnreuben6930 4 года назад
I am glad it helped you!
@moxalshah441
@moxalshah441 5 лет назад
Excellent work Sir, Thank You so much. It was a great help to me.
@kevinjohnson3622
@kevinjohnson3622 5 лет назад
Excellent tutorial! Very clear. Thank you.
@arvindrathore7789
@arvindrathore7789 4 года назад
Crystal clear ,Thanks for this video sir
@aswinpatel5793
@aswinpatel5793 7 лет назад
Very well explained John !! Thanks !!
@anthonyedwardmaylath7896
@anthonyedwardmaylath7896 5 лет назад
Very clear. Now I can do my homework!
@zachjackovich116
@zachjackovich116 3 года назад
Thank you, great explanation!!
@AditiSinghMVD
@AditiSinghMVD 7 лет назад
thank you sir .very helpful
@anjujoy3976
@anjujoy3976 7 лет назад
very helpful lecture sir☺ do u have the soft copies of the textbooks mentioned?
@harryshao189
@harryshao189 8 лет назад
Very good lecture!
@xAmiSarahx
@xAmiSarahx 3 года назад
good evening sir...thank you... you helped me for my test
@tarekjrd75
@tarekjrd75 9 месяцев назад
Impressive, Thank you so much !
@9788898093
@9788898093 7 лет назад
sir, i am deeply grateful for your help .., here!!!
@johnreuben6930
@johnreuben6930 7 лет назад
Glad to know that Mani vannan.In which university are you studying?
@AbhinavKumar-rv9yw
@AbhinavKumar-rv9yw 6 месяцев назад
great lecture!
@darkprince2703
@darkprince2703 2 года назад
TQSM it was very helpful
@johnreuben6930
@johnreuben6930 5 лет назад
i have not coded it. You can use a high-level language (like C or MATLAB) and code the steps of KL algorithm
@PEC_SIBASISHMOHANTY
@PEC_SIBASISHMOHANTY 2 года назад
very nice explanation sir
@ganeshmula4508
@ganeshmula4508 9 месяцев назад
🙏🙏Thank you sir
@rajbhushan3541
@rajbhushan3541 7 месяцев назад
great tutorial
@varaprasadgrandhi8101
@varaprasadgrandhi8101 4 года назад
Sir can you make the videos for FM algorithm and simulated annealing algorithm.
@parthchoudhary0707
@parthchoudhary0707 7 месяцев назад
Perfect!!!
@mykytapavlov2423
@mykytapavlov2423 8 лет назад
Thank you
@ashishchoudhary9354
@ashishchoudhary9354 8 лет назад
very good lecture! can you please tell me the name of the book from which you have prepared this video.
@johnreuben6930
@johnreuben6930 8 лет назад
+Ashu Kumar The names of the books i followed are there in the slides themselves..... as footnotes. Book1: VLSI physical design by Yousuf and Sait, Book2:VLSI Physical design from Graph Partitioning to timing closure by A.B.Kahng et al Thank you for watching my video lectures.Hope you find them useful.
@amjadalruhaimi1032
@amjadalruhaimi1032 7 лет назад
is that helpful for TSP ! i need an example for using this algorithm for TSP < thank you ^^
@johnreuben6930
@johnreuben6930 7 лет назад
TSP- you mean Traveling salesman problem.If so, KL will not help TSP. For TSP, you have to explore a spanning tree or steiner tree algorithm
@marat61
@marat61 6 лет назад
cool!
@utbhai
@utbhai 4 года назад
Example starts at minute 23.
@ravis4025
@ravis4025 3 года назад
NICE REUBEN
@johnreuben6930
@johnreuben6930 7 лет назад
Anju, yes. Contact me at johnreubenp@gmail.com
@anjujoy3976
@anjujoy3976 7 лет назад
very helpful lecture sir☺ do u have the soft copies of the textbooks mentioned?
@anjujoy3976
@anjujoy3976 7 лет назад
very helpful lecture sir☺ do u have the soft copies of the textbooks mentioned?
@anjujoy3976
@anjujoy3976 7 лет назад
very helpful lecture sir☺ do u have the soft copies of the textbooks mentioned?
@anjujoy3976
@anjujoy3976 7 лет назад
very helpful lecture sir☺ do u have the soft copies of the textbooks mentioned?
@vivek4m
@vivek4m 5 лет назад
Ye le: mirror.thelifeofkenneth.com/lib/electronics_archive/VLSI_Physical_Design_From_Graph_Partitioning_to_Timing_Closure.pdf
@boombeachnoob3642
@boombeachnoob3642 4 года назад
@@vivek4m link not working
Далее
Partitioning
34:02
Просмотров 71 тыс.
Left Edge and Dogleg Algorithm for channel routing
44:20
НАШЛА У СЕСТРЫ СЕКРЕТИК
00:36
Просмотров 248 тыс.
skibidi toilet multiverse 039 (part 4)
06:06
Просмотров 2,3 млн
Ant colony optimization algorithm
19:21
Просмотров 57 тыс.
Partitioning-an Introduction
20:01
Просмотров 7 тыс.
Partitioning with the Kernighan-Lin heuristic
9:45
Просмотров 5 тыс.
Graph Clustering Algorithms (September 28, 2017)
1:11:54
How to Speak
1:03:43
Просмотров 19 млн
Sequence Pair for VLSI Placement
39:21
Просмотров 9 тыс.
Think Fast, Talk Smart: Communication Techniques
58:20
Using Graph Partitioning in Distributed Systems Design
20:13