Comparative analysis of arrayblockingqueue and linkedblockingqueue

ArrayBlockingQueue： Based on the array implementation , Use a lock ,2 A semaphore , An array , One data release index, One fetches data index, When storing data , Each time the data is released, the blocked fetching thread will be notified , Each time the data is fetched, the blocked thread will be notified , Please note that ： Take and put are mutually exclusive .

LinkedBlockingQueue： Based on single linked list , Use 2 The lock , Each lock has a semaphore , One node Linked list , A point to put data node node last, A point to get data node node head, When storing data , Every time the data is released , If the container is not full , Will continue to notify the drop thread , Put the data , Until the container is full , Every time data is retrieved , After getting the data , If the container still has data , Will notify the fetching thread to continue fetching data , Until the data in the container is empty , Please note that ： Fetch and fetch are mutually exclusive , Put and put are mutually exclusive , Taking and placing can be done at the same time .
stay JDK1.8 Next ,LinkedBlockingQueue Better performance than the ArrayBlockingQueue