The core parameters of ThreadPoolExecutor include corePoolSize, maximumPoolSize, keepAliveTime, workQueue and handler, which together determine the behavior of the thread pool. 1. corePoolSize specifies the number of core threads, and will not be recycled even if they are idle (unless allowCoreThreadTimeOut is enabled); 2. maximumPoolSize defines the maximum number of threads and controls the upper limit of the thread pool; 3. keepAliveTime sets the idle timeout time of non-core threads; 4. workQueue determines the task's queuing strategy, such as using the bounded queue ArrayBlockingQueue to prevent resource exhaustion; 5. handler is used to deal with rejection policies when new tasks cannot be accepted, and CallerRunsPolicy is recommended to implement the backpressure mechanism. Setting these parameters reasonably and understanding their impact will help avoid memory overflow, improve system stability, and ensure the completion of tasks through shutdown() and awaitTermination when the application is closed, thus giving full play to the value of the thread pool.
Java's thread pool executor (ThreadPoolExecutor) is one of the core components in concurrent programming. It can significantly improve program performance when used properly. But many people just know that Executors
tool class can quickly create several common thread pools, but ignore the flexibility and control capabilities provided by ThreadPoolExecutor itself.

Understand the core parameters, don't rely solely on the default values
The constructor of ThreadPoolExecutor has seven parameters, the most critical of which are the following:

- corePoolSize : Number of core threads, which will not time out even if it is idle (unless allowCoreThreadTimeOut is set)
- maximumPoolSize : maximum number of threads, maximum number of threads, maximum number of threads for thread pool
- keepAliveTime : How long will non-core threads be recycled after they are idle?
- workQueue : task queue, used to store tasks waiting for execution
- handler : reject policy, how to handle when a task cannot be submitted
For example: If you set corePoolSize to 5, maximumPoolSize to 10, and workQueue capacity is 100, then the first 100 tasks will be queued and threads exceeding corePoolSize will not be created immediately. You will not consider creating a new thread until the queue is full, until maximumPoolSize is reached.
Many newbies use Executors.newFixedThreadPool(10)
directly, which looks OK, but its queue is an unbounded queue, which may cause memory overflow. If you use ThreadPoolExecutor yourself, you can control these behaviors more carefully.

Task queue selection, key points that affect thread pool behavior
The selection of the task queue directly affects how the thread pool schedules tasks. Commonly used queues include:
-
LinkedBlockingQueue
: Default unbounded, suitable for most scenarios, but may hide the problem of resource exhaustion -
ArrayBlockingQueue
: Bounded queues can better control resource caps and avoid system overload -
SynchronousQueue
: No elements are stored, each insertion operation must wait until another thread is fetched, suitable for high concurrency and low latency scenarios. -
PriorityBlockingQueue
: a task queue sorted by priority, suitable for scenarios where task order needs to be dynamically adjusted
It is recommended to select the appropriate queue type based on the actual load. For example, when processing requests in a web server, using bounded queues and appropriate rejection policies (such as CallerRunsPolicy) can allow the calling thread to handle tasks by itself when there is a high pressure, which can play a current limiting role.
Rejection strategies are not decorations, they must work at critical moments
When the thread pool and task queue are full, new tasks need to be dealt with through rejection policies. JDK has four built-in strategies:
-
AbortPolicy
: Throw an exception, default behavior -
CallerRunsPolicy
: The calling thread executes the task itself -
DiscardPolicy
: Silently discard tasks -
DiscardOldestPolicy
: discard the oldest task in the queue and try to resubmit the current task
In practical applications, the most recommended is CallerRunsPolicy
because it can slow down the task submission speed and form a "backpression" mechanism instead of simply discarding or throwing exceptions.
Of course, you can also customize the Handler, record logs, alarms or do other processing.
Thread pool lifecycle management, don't forget to close
Many people just ignore the thread pool after writing it, but in fact the thread pool also needs to be properly closed. There are two main methods:
-
shutdown()
: No new tasks are accepted, but will wait for the submitted tasks to be completed -
shutdownNow()
: Try to interrupt all executing tasks and return the list of tasks waiting to be executed
It is recommended to call shutdown()
when the application is closed, and wait with awaitTermination to ensure that the task is completed:
executor.shutdown(); try { if (!executor.awaitTermination(60, TimeUnit.SECONDS)) { executor.shutdownNow(); } } catch (InterruptedException e) { executor.shutdownNow(); }
This can prevent tasks from being forced to be interrupted and ensure data consistency.
Basically that's it. ThreadPoolExecutor is powerful, but it is also easy to misuse. Only by understanding the role of each parameter and the mechanism behind it can it truly exert its value.
The above is the detailed content of Deep Dive into Java Thread Pool Executors. For more information, please follow other related articles on the PHP Chinese website!

Hot AI Tools

Undress AI Tool
Undress images for free

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Clothoff.io
AI clothes remover

Video Face Swap
Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Article

Hot Tools

Notepad++7.3.1
Easy-to-use and free code editor

SublimeText3 Chinese version
Chinese version, very easy to use

Zend Studio 13.0.1
Powerful PHP integrated development environment

Dreamweaver CS6
Visual web development tools

SublimeText3 Mac version
God-level code editing software (SublimeText3)

Java supports asynchronous programming including the use of CompletableFuture, responsive streams (such as ProjectReactor), and virtual threads in Java19. 1.CompletableFuture improves code readability and maintenance through chain calls, and supports task orchestration and exception handling; 2. ProjectReactor provides Mono and Flux types to implement responsive programming, with backpressure mechanism and rich operators; 3. Virtual threads reduce concurrency costs, are suitable for I/O-intensive tasks, and are lighter and easier to expand than traditional platform threads. Each method has applicable scenarios, and appropriate tools should be selected according to your needs and mixed models should be avoided to maintain simplicity

In Java, enums are suitable for representing fixed constant sets. Best practices include: 1. Use enum to represent fixed state or options to improve type safety and readability; 2. Add properties and methods to enums to enhance flexibility, such as defining fields, constructors, helper methods, etc.; 3. Use EnumMap and EnumSet to improve performance and type safety because they are more efficient based on arrays; 4. Avoid abuse of enums, such as dynamic values, frequent changes or complex logic scenarios, which should be replaced by other methods. Correct use of enum can improve code quality and reduce errors, but you need to pay attention to its applicable boundaries.

JavaNIO is a new IOAPI introduced by Java 1.4. 1) is aimed at buffers and channels, 2) contains Buffer, Channel and Selector core components, 3) supports non-blocking mode, and 4) handles concurrent connections more efficiently than traditional IO. Its advantages are reflected in: 1) Non-blocking IO reduces thread overhead, 2) Buffer improves data transmission efficiency, 3) Selector realizes multiplexing, and 4) Memory mapping speeds up file reading and writing. Note when using: 1) The flip/clear operation of the Buffer is easy to be confused, 2) Incomplete data needs to be processed manually without blocking, 3) Selector registration must be canceled in time, 4) NIO is not suitable for all scenarios.

HashMap implements key-value pair storage through hash tables in Java, and its core lies in quickly positioning data locations. 1. First use the hashCode() method of the key to generate a hash value and convert it into an array index through bit operations; 2. Different objects may generate the same hash value, resulting in conflicts. At this time, the node is mounted in the form of a linked list. After JDK8, the linked list is too long (default length 8) and it will be converted to a red and black tree to improve efficiency; 3. When using a custom class as a key, the equals() and hashCode() methods must be rewritten; 4. HashMap dynamically expands capacity. When the number of elements exceeds the capacity and multiplies by the load factor (default 0.75), expand and rehash; 5. HashMap is not thread-safe, and Concu should be used in multithreaded

Java enumerations not only represent constants, but can also encapsulate behavior, carry data, and implement interfaces. 1. Enumeration is a class used to define fixed instances, such as week and state, which is safer than strings or integers; 2. It can carry data and methods, such as passing values ??through constructors and providing access methods; 3. It can use switch to handle different logics, with clear structure; 4. It can implement interfaces or abstract methods to make differentiated behaviors of different enumeration values; 5. Pay attention to avoid abuse, hard-code comparison, dependence on ordinal values, and reasonably naming and serialization.

Singleton design pattern in Java ensures that a class has only one instance and provides a global access point through private constructors and static methods, which is suitable for controlling access to shared resources. Implementation methods include: 1. Lazy loading, that is, the instance is created only when the first request is requested, which is suitable for situations where resource consumption is high and not necessarily required; 2. Thread-safe processing, ensuring that only one instance is created in a multi-threaded environment through synchronization methods or double check locking, and reducing performance impact; 3. Hungry loading, which directly initializes the instance during class loading, is suitable for lightweight objects or scenarios that can be initialized in advance; 4. Enumeration implementation, using Java enumeration to naturally support serialization, thread safety and prevent reflective attacks, is a recommended concise and reliable method. Different implementation methods can be selected according to specific needs

Optional can clearly express intentions and reduce code noise for null judgments. 1. Optional.ofNullable is a common way to deal with null objects. For example, when taking values ??from maps, orElse can be used to provide default values, so that the logic is clearer and concise; 2. Use chain calls maps to achieve nested values ??to safely avoid NPE, and automatically terminate if any link is null and return the default value; 3. Filter can be used for conditional filtering, and subsequent operations will continue to be performed only if the conditions are met, otherwise it will jump directly to orElse, which is suitable for lightweight business judgment; 4. It is not recommended to overuse Optional, such as basic types or simple logic, which will increase complexity, and some scenarios will directly return to nu.

The core workaround for encountering java.io.NotSerializableException is to ensure that all classes that need to be serialized implement the Serializable interface and check the serialization support of nested objects. 1. Add implementsSerializable to the main class; 2. Ensure that the corresponding classes of custom fields in the class also implement Serializable; 3. Use transient to mark fields that do not need to be serialized; 4. Check the non-serialized types in collections or nested objects; 5. Check which class does not implement the interface; 6. Consider replacement design for classes that cannot be modified, such as saving key data or using serializable intermediate structures; 7. Consider modifying
