>Digital-flame

When the thread pool queue is full and a new task is submitted, what happens depends on the thread pool’s rejection policy.

Let’s break it down clearly 👇

The optimal thread pool size depends on several factors, mainly the type of tasks your application runs and the hardware it runs on.

A thread pool is a programming construct used to manage a group of worker threads for executing tasks concurrently. Instead of creating and destroying a thread for each task (which is expensive), a thread pool reuses a fixed number of threads to execute many tasks efficiently

🧠 interrupted() vs isInterrupted()

✅ 1. If it’s a checked or unchecked exception thrown from run():

• The thread terminates immediately.
• The exception is not rethrown to the main thread.
• If uncaught, it’s passed to the thread’s UncaughtExceptionHandler (if any).

Thread.stop() is deprecated and strongly discouraged because it’s unsafe, unpredictable, and can corrupt program state.

Let me explain why in a clear, structured way.

❌ Deprecated (DO NOT USE)

thread.stop();    // 🚫 Dangerous and deprecated

This kills the thread immediately — which can leave shared data in an inconsistent state.

It doesn’t give the thread a chance to clean up resources or release locks.

we use smth like this in Counter class

AtomicInteger counter = new AtomicInteger(0);
counter.incrementAndGet();

👉 We don’t directly call compareAndSet() — but under the hood, incrementAndGet() uses compareAndSet() (or CAS instructions) internally!

🔁 What is CAS (Compare-And-Swap)?

CAS is a hardware-level atomic operation used to implement lock-free synchronization.

It works like this:

1. Read the current value of a variable (expected).
2. Compare it to an expected value.
3. If it matches, swap it with a new value.
4. If it doesn’t, do nothing — try again (typically in a loop).

Yes, there are multiple ways to solve a race condition depending on what you’re doing and how critical performance is.

Let’s go over the most common and effective ways 🔧: