How do I use ExecutorService with virtual threads?

To use ExecutorService with virtual threads in Java, you can leverage the Executors.newVirtualThreadPerTaskExecutor() method. This method creates an ExecutorService where each task is executed on a new virtual thread, managed by the Java runtime. Here’s a step-by-step guide:


1. Dependencies & Setup

Ensure you are using Java 19 or newer. Virtual threads were introduced as a preview feature, but from Java 21 onward, they are part of the platform. You may need --enable-preview as a JVM option for Java 19 and 20.


2. Creating an ExecutorService with Virtual Threads

The Executors.newVirtualThreadPerTaskExecutor() method provides an easy way to create an executor service for virtual threads.

Example:

package org.kodejava.util.concurrent;

import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;

public class VirtualThreadExample {
    public static void main(String[] args) {
        // Creates an ExecutorService with virtual threads
        try (ExecutorService executor = Executors.newVirtualThreadPerTaskExecutor()) {
            // Submitting tasks to executor
            executor.submit(() -> System.out.println("Task 1 on virtual thread"));
            executor.submit(() -> System.out.println("Task 2 on another virtual thread"));
        } // The executor is automatically closed after the try block
    }
}

In this example:

  • Each task runs in its own virtual thread, allowing them to scale efficiently.
  • The try block ensures the resources are cleaned up when the executor is closed.

3. Advantages

  • Concurrency: High-concurrency tasks, such as I/O-bound operations, benefit from virtual threads.
  • Scalability: You don’t have to limit the number of threads since virtual threads don’t demand system OS threads.
  • Simplicity: Virtual threads make it easier to adopt a thread-per-task model without resource overhead.

4. Important Use Cases

  • Concurrent workloads like handling multiple incoming web requests.
  • Tasks that rely on blocking operations, such as database access or network I/O.

5. Combining with Structured Concurrency (Optional)

Using structured concurrency (Java 21+) simplifies managing tasks by controlling their lifecycle. Here’s a snippet combining virtual threads with structured concurrency:

Example:

package org.kodejava.util.concurrent;

import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;

public class StructuredConcurrencyExample {
    public static void main(String[] args) throws Exception {
        // Using an ExecutorService with virtual threads
        try (ExecutorService executor = Executors.newVirtualThreadPerTaskExecutor()) {
            var task1 = executor.submit(() -> {
                Thread.sleep(500); // Simulating a long-running task
                return "Result from task 1";
            });

            var task2 = executor.submit(() -> {
                Thread.sleep(300); // Another long-running task
                return "Result from task 2";
            });

            // Getting results from tasks
            System.out.println(task1.get());
            System.out.println(task2.get());
        }
    }
}

6. Considerations

  • Resource Efficiency: Virtual threads work well for blocking I/O tasks. However, for CPU-bound tasks, you’re limited by the number of available processors.
  • Preview Feature (If Applicable): Ensure you run the program with --enable-preview if using a preview version of Java.

Virtual threads offer a significant leap in simplifying multithreaded programming while improving scalability. Transitioning to virtual threads in most legacy multithreaded systems is straightforward because they integrate seamlessly with the existing threading APIs.

How do I combine multiple CompletableFutures?

To combine multiple CompletableFuture objects in Java, you can use the following approaches, depending on your specific use case:


1. Combine Two Futures

If you have two CompletableFuture instances and need to combine their results, use the thenCombine method. It lets you specify how to merge the results of both futures.

Example:

CompletableFuture<String> future1 = CompletableFuture.supplyAsync(() -> "Task1");
CompletableFuture<String> future2 = CompletableFuture.supplyAsync(() -> "Task2");

// Combine their results
CompletableFuture<String> combinedFuture = future1.thenCombine(future2, (result1, result2) -> {
    return result1 + " & " + result2; // Merge both results
});

combinedFuture.thenAccept(result -> System.out.println("Combined Result: " + result));

Output:

Combined Result: Task1 & Task2

2. Wait for All Futures to Complete

If you want to wait for multiple CompletableFuture tasks to complete (without necessarily combining their results immediately), you can use the allOf method. This is useful when you want to ensure that all tasks are completed before proceeding further.

Example:

CompletableFuture<Void> allTasks = CompletableFuture.allOf(
    CompletableFuture.runAsync(() -> System.out.println("Task 1 completed")),
    CompletableFuture.runAsync(() -> System.out.println("Task 2 completed")),
    CompletableFuture.runAsync(() -> System.out.println("Task 3 completed"))
);

// Wait for all tasks to complete
allTasks.join();

System.out.println("All tasks completed.");

3. Combine Results of Multiple Futures

To combine the individual results of a list (or array) of CompletableFuture objects, you would use allOf in conjunction with further processing.

For example:

  1. Create a list/array of CompletableFuture.
  2. Use CompletableFuture.allOf() to wait for all of them.
  3. Extract and combine results using join.

Example:

List<CompletableFuture<String>> futures = Arrays.asList(
    CompletableFuture.supplyAsync(() -> "Result1"),
    CompletableFuture.supplyAsync(() -> "Result2"),
    CompletableFuture.supplyAsync(() -> "Result3")
);

CompletableFuture<Void> allOf = CompletableFuture.allOf(futures.toArray(new CompletableFuture[0]));

// Gather results once all are completed
CompletableFuture<List<String>> resultFuture = allOf.thenApply(v ->
    futures.stream()
           .map(CompletableFuture::join) // Join and collect results
           .collect(Collectors.toList())
);

resultFuture.thenAccept(results -> System.out.println("Results: " + results));

Output:

Results: [Result1, Result2, Result3]

4. Wait for the First to Complete

If you are waiting for the first CompletableFuture to complete instead of all, use anyOf. It is useful when results from the first completed task suffice.

Example:

CompletableFuture<Object> anyOf = CompletableFuture.anyOf(
    CompletableFuture.supplyAsync(() -> "First Result"),
    CompletableFuture.supplyAsync(() -> "Second Result"),
    CompletableFuture.supplyAsync(() -> "Third Result")
);

anyOf.thenAccept(result -> System.out.println("First completed task result: " + result));

Comparison of APIs for Combining Futures:

Method Purpose
thenCombine Combines two futures’ results into one.
thenCompose Chains dependent tasks (where one task’s result is input for the next).
allOf Waits for all futures in a list/array to complete but does not return their results.
anyOf Waits for the first future from a list/array to complete and returns its result.

By selecting the appropriate method (thenCombine, allOf, anyOf, or others), you can efficiently handle multiple asynchronous computations in Java with CompletableFuture.

How do I use CompletableFuture for async tasks?

CompletableFuture is a powerful tool in Java to implement asynchronous programming. It allows you to perform tasks in the background, chain multiple async tasks together, handle both success and failure scenarios, and combine multiple async computations.

Here’s a summary of how to use CompletableFuture with examples:


1. Run a task asynchronously

Use supplyAsync() (if the task produces a result) or runAsync() (if the task doesn’t return anything).

CompletableFuture<Void> future = CompletableFuture.runAsync(() -> {
    System.out.println("Running task in background...");
});

Or with a result:

CompletableFuture<String> future = CompletableFuture.supplyAsync(() -> {
    return "Hello, World!";
});

2. Process the result

You can process the result of a CompletableFuture using methods like thenAccept or thenApply.

future.thenApply(result -> {
    System.out.println("Received result: " + result);
    return result.toUpperCase();
}).thenAccept(uppercaseResult -> {
    System.out.println("Transformed result: " + uppercaseResult);
});

3. Combine multiple tasks

You can run multiple tasks in parallel and combine their results.

CompletableFuture<String> future1 = CompletableFuture.supplyAsync(() -> "Task1");
CompletableFuture<String> future2 = CompletableFuture.supplyAsync(() -> "Task2");

CompletableFuture<String> combinedFuture = future1.thenCombine(future2, (task1Result, task2Result) -> {
    return task1Result + " and " + task2Result;
});

combinedFuture.thenAccept(result -> {
    System.out.println("Combined Result: " + result);
});

4. Wait for all tasks

If you have multiple tasks and want to wait for all of them to complete, use CompletableFuture.allOf.

CompletableFuture<Void> allTasks = CompletableFuture.allOf(
    CompletableFuture.runAsync(() -> System.out.println("Task 1 completed")),
    CompletableFuture.runAsync(() -> System.out.println("Task 2 completed"))
);

allTasks.join(); // Blocks the thread and waits for completion
System.out.println("All tasks completed.");

5. Handle errors

You can handle exceptions in async tasks using exceptionally().

CompletableFuture<Void> future = CompletableFuture.runAsync(() -> {
    throw new RuntimeException("Oops, something went wrong!");
}).exceptionally(ex -> {
    System.out.println("Error: " + ex.getMessage());
    return null;
});

6. Compose dependent tasks

Use thenCompose to chain dependent tasks where the second task depends on the result of the first one.

CompletableFuture.supplyAsync(() -> "Task 1 Result")
    .thenCompose(result -> CompletableFuture.supplyAsync(() -> result + " Task 2 Result"))
    .thenAccept(finalResult -> System.out.println("Final Result: " + finalResult));

7. Custom Executor

By default, CompletableFuture uses the ForkJoinPool.commonPool for async tasks. You can provide a custom executor for better control over threads.

ExecutorService executor = Executors.newFixedThreadPool(10);

CompletableFuture.runAsync(() -> {
    System.out.println("Running task on custom executor");
}, executor);

Key Methods in CompletableFuture

Method Description
runAsync Run a task asynchronously (does not return result).
supplyAsync Run a task asynchronously and return a result.
thenApply Transform the result of a CompletableFuture.
thenAccept Consumes the result of a CompletableFuture (no further processing).
thenCompose Chains dependent tasks where the next uses the result of the previous.
thenCombine Combines two CompletableFuture results.
allOf / anyOf Wait for all or any of multiple futures to complete.
exceptionally Handle exceptions thrown during the async computation.
join / get Block and wait for the task to complete and retrieve its result (not recommended for non-blocking).

Example Workflow with Pipeline

Here’s an example pipeline:

  1. Fetch data
  2. Process it
  3. Save it
  4. Notify the user
ExecutorService executor = Executors.newFixedThreadPool(4);

CompletableFuture.supplyAsync(() -> {
    System.out.println("Fetching data...");
    return "Raw Data";
}, executor).thenApply(data -> {
    System.out.println("Processing data...");
    return data.toUpperCase();
}).thenAccept(processedData -> {
    System.out.println("Saving: " + processedData);
}).thenRun(() -> {
    System.out.println("Notification: Done!");
}).exceptionally(ex -> {
    System.err.println("Pipeline failed due to: " + ex.getMessage());
    return null;
}).join();

Using CompletableFuture, you can build flexible, high-performance, and non-blocking applications.

How do I use the Java Util Concurrent Flow API?

The java.util.concurrent.Flow API, introduced in Java 9, is a low-level implementation of the Reactive Streams specification, providing an asynchronous, non-blocking framework for handling streams of data. It allows you to build reactive systems that support backpressure to handle large or variable amounts of data more efficiently.

Here’s a quick guide on how to use java.util.concurrent.Flow API:


Key Interfaces in java.util.concurrent.Flow

The API comprises four core interfaces:

  1. Flow.Publisher:
    Represents the producer of data. It publishes items to one or more subscribers.

  2. Flow.Subscriber:
    Represents the consumer of data. It subscribes to a publisher to receive data.

  3. Flow.Subscription:
    Represents a link between a publisher and a subscriber, allowing the subscriber to control how much data it receives (backpressure).

  4. Flow.Processor:
    Both a subscriber and a publisher, used to transform or process elements as they flow through the stream.


Implementation Workflow

To use the Flow API, you need to implement these interfaces. Below is a step-by-step explanation:

1. Create a Publisher

  • The Flow.Publisher interface has a single method subscribe(Subscriber<? super T> subscriber).
  • The publisher is responsible for connecting with subscribers and managing their subscriptions.
package org.kodejava.util.concurrent;

import java.util.concurrent.Flow;

public class SimplePublisher implements Flow.Publisher<String> {
    private final String[] items = {"Item 1", "Item 2", "Item 3"};

    @Override
    public void subscribe(Flow.Subscriber<? super String> subscriber) {
        SubscriptionImpl subscription = new SubscriptionImpl(subscriber, items);
        subscriber.onSubscribe(subscription);
    }

    private static class SubscriptionImpl implements Flow.Subscription {
        private final Flow.Subscriber<? super String> subscriber;
        private final String[] items;
        private int currentIndex = 0;
        private boolean canceled = false;

        public SubscriptionImpl(Flow.Subscriber<? super String> subscriber, String[] items) {
            this.subscriber = subscriber;
            this.items = items;
        }

        @Override
        public void request(long n) {
            if (n <= 0) {
                subscriber.onError(new IllegalArgumentException("Must request a positive number of items"));
                return;
            }

            for (int i = 0; i < n && currentIndex < items.length; i++) {
                if (canceled) {
                    return;
                }
                subscriber.onNext(items[currentIndex++]);
            }

            if (currentIndex == items.length) {
                subscriber.onComplete();
            }
        }

        @Override
        public void cancel() {
            canceled = true;
        }
    }
}

2. Create a Subscriber

  • Implement the Flow.Subscriber interface (four methods) for receiving events from a publisher:
    • onSubscribe(Flow.Subscription subscription): Receive the subscription. You must request data here.
    • onNext(T item): Handle the next item of the stream.
    • onError(Throwable throwable): Handle any errors.
    • onComplete(): Called when the publisher finishes sending data.
package org.kodejava.util.concurrent;

import java.util.concurrent.Flow;

public class SimpleSubscriber implements Flow.Subscriber<String> {
    private Flow.Subscription subscription;

    @Override
    public void onSubscribe(Flow.Subscription subscription) {
        this.subscription = subscription;
        System.out.println("Subscribed!");
        subscription.request(1); // Request the first item
    }

    @Override
    public void onNext(String item) {
        System.out.println("Received: " + item);
        subscription.request(1); // Request the next item
    }

    @Override
    public void onError(Throwable throwable) {
        System.err.println("Error: " + throwable.getMessage());
    }

    @Override
    public void onComplete() {
        System.out.println("Complete!");
    }
}

3. Connect the Publisher to the Subscriber

  • Instantiate and link your Publisher and Subscriber.
package org.kodejava.util.concurrent;

public class FlowExample {
    public static void main(String[] args) {
        SimplePublisher publisher = new SimplePublisher();
        SimpleSubscriber subscriber = new SimpleSubscriber();

        publisher.subscribe(subscriber);
    }
}

4. (Optional) Create a Processor

  • A Processor acts as both a Subscriber to transform data from an upstream publisher and a Publisher to pass it downstream.
package org.kodejava.util.concurrent;

import java.util.concurrent.Flow;
import java.util.concurrent.SubmissionPublisher;

public class UppercaseProcessor extends SubmissionPublisher<String> implements Flow.Processor<String, String> {
    private Flow.Subscription subscription;

    @Override
    public void onSubscribe(Flow.Subscription subscription) {
        this.subscription = subscription;
        subscription.request(1);
    }

    @Override
    public void onNext(String item) {
        submit(item.toUpperCase());
        subscription.request(1);
    }

    @Override
    public void onError(Throwable throwable) {
        throwable.printStackTrace();
        close();
    }

    @Override
    public void onComplete() {
        System.out.println("Processing complete!");
        close();
    }
}

Example with SubmissionPublisher

Java also provides a SubmissionPublisher class, an implementation of Flow.Publisher, which simplifies creating Publishers.

package org.kodejava.util.concurrent;

import java.util.concurrent.Flow;
import java.util.concurrent.SubmissionPublisher;

public class SubmissionPublisherExample {
    public static void main(String[] args) throws InterruptedException {
        SubmissionPublisher<String> publisher = new SubmissionPublisher<>();

        Flow.Subscriber<String> subscriber = new Flow.Subscriber<>() {
            private Flow.Subscription subscription;

            @Override
            public void onSubscribe(Flow.Subscription subscription) {
                this.subscription = subscription;
                System.out.println("Subscribed!");
                subscription.request(1);
            }

            @Override
            public void onNext(String item) {
                System.out.println("Received: " + item);
                subscription.request(1);
            }

            @Override
            public void onError(Throwable throwable) {
                throwable.printStackTrace();
            }

            @Override
            public void onComplete() {
                System.out.println("Done!");
            }
        };

        publisher.subscribe(subscriber);

        System.out.println("Publishing data...");
        publisher.submit("Hello");
        publisher.submit("World");
        publisher.submit("!");

        Thread.sleep(100); // Allow time for processing
        publisher.close();
    }
}

Output of the Above Example

Publishing data...
Subscribed!
Received: Hello
Received: World
Received: !
Done!

Points to Remember

  1. Backpressure:
    • The subscriber can control how many items it wants to receive using the request() method of Flow.Subscription.
    • If the subscriber requests fewer items, the publisher will slow down and send only the requested number.
  2. Error Handling:
    • If something goes wrong, the onError() callback is invoked, allowing you to handle errors gracefully.
  3. Completion:
    • Once all elements are processed, the publisher calls onComplete() to indicate the sequence is finished.
  4. Threading:
    • The Flow API itself doesn’t mandate the use of specific threads for dealing with publishers/subscribers, but it’s often paired with asynchronous mechanisms (e.g., the SubmissionPublisher uses a default ForkJoinPool to process items).

By combining custom implementations with the provided SubmissionPublisher and additional libraries, you can build reactive systems that are both powerful and resource-efficient.

How do I write custom synchronizers using AbstractQueuedSynchronizer?

Writing custom synchronizers with AbstractQueuedSynchronizer (AQS) in Java involves creating classes that encapsulate synchronization logic, such as locks, semaphores, or barriers. AQS simplifies the development of concurrency tools by handling queueing and thread state management. Below are the key steps and guidelines to write custom synchronizers using AbstractQueuedSynchronizer:

1. Understand AQS Concepts

  • state: AQS maintains a simple int value (state) to represent the synchronization state. The meaning of state varies depending on the synchronizer you create (e.g., lock held count for a reentrant lock, permits for a semaphore, etc.).
  • Exclusive Mode: Only one thread can hold the resource (e.g., ReentrantLock).
  • Shared Mode: Multiple threads can share the resource (e.g., Semaphore, CountDownLatch).

2. Create a Custom Synchronizer Class

Your custom synchronizer class will generally:

  • Extend AbstractQueuedSynchronizer.
  • Use the state variable to model your synchronization logic.
  • Implement key methods such as tryAcquire, tryRelease, tryAcquireShared, and tryReleaseShared based on whether you’re implementing exclusive or shared behavior.

3. Implement Required Methods

For Exclusive Mode:

Override:

  • tryAcquire(int arg): Define the logic to acquire the resource exclusively. Return true if the acquisition is successful, otherwise return false.
  • tryRelease(int arg): Define the logic to release the resource. Return true if the state transition occurs and allows waiting threads to proceed.

For Shared Mode:

Override:

  • tryAcquireShared(int arg): Define the logic to acquire the resource in shared mode. Return:
    • Negative if the acquisition fails.
    • Zero if no more shared acquisitions are allowed.
    • Positive if the acquisition is successful, and more threads can share the resource.
  • tryReleaseShared(int arg): Define the logic to release the resource in shared mode. Usually, decrement the state and decide if more threads can proceed.

4. Publish the Synchronizer to Clients

AQS is always used as part of a larger custom synchronization object. Expose public methods in your custom class to wrap the AQS functionality. For instance:

  • For exclusive locks: lock and unlock methods.
  • For shared locks: Methods such as acquireShared and releaseShared.

5. Example Implementations

Example 1: Simple Mutex (ReentrantLock Equivalent)

Code for an exclusive synchronizer:

package org.kodejava.util.concurrent;

import java.util.concurrent.locks.AbstractQueuedSynchronizer;

public class SimpleMutex {
    // Custom synchronizer extending AQS
    private static class Sync extends AbstractQueuedSynchronizer {
        @Override
        protected boolean tryAcquire(int ignored) {
            // Attempt to set state to 1 if it's currently 0 (lock is free)
            if (compareAndSetState(0, 1)) {
                setExclusiveOwnerThread(Thread.currentThread());
                return true;
            }
            return false;
        }

        @Override
        protected boolean tryRelease(int ignored) {
            // Only lock owner can release
            if (getState() == 0 || getExclusiveOwnerThread() != Thread.currentThread()) {
                throw new IllegalMonitorStateException();
            }
            setExclusiveOwnerThread(null);
            setState(0); // Free the lock
            return true; // Allow further attempts to acquire the lock
        }

        @Override
        protected boolean isHeldExclusively() {
            return getState() == 1 && getExclusiveOwnerThread() == Thread.currentThread();
        }
    }

    private final Sync sync = new Sync();

    public void lock() {
        sync.acquire(1);
    }

    public void unlock() {
        sync.release(1);
    }

    public boolean isLocked() {
        return sync.isHeldExclusively();
    }
}

Example 2: Simple Semaphore (Shared Synchronizer)

Code demonstrating shared mode:

package org.kodejava.util.concurrent;

import java.util.concurrent.locks.AbstractQueuedSynchronizer;

public class SimpleSemaphore {
    private static class Sync extends AbstractQueuedSynchronizer {
        Sync(int permits) {
            setState(permits);
        }

        @Override
        protected int tryAcquireShared(int permits) {
            for (; ; ) {
                int current = getState();
                int remaining = current - permits;
                // Check if we can acquire the permits
                if (remaining < 0 || compareAndSetState(current, remaining)) {
                    return remaining;
                }
            }
        }

        @Override
        protected boolean tryReleaseShared(int permits) {
            for (; ; ) {
                int current = getState();
                int next = current + permits;
                // Release the permits
                if (compareAndSetState(current, next)) {
                    return true;
                }
            }
        }
    }

    private final Sync sync;

    public SimpleSemaphore(int permits) {
        sync = new Sync(permits);
    }

    public void acquire() throws InterruptedException {
        sync.acquireSharedInterruptibly(1);
    }

    public void release() {
        sync.releaseShared(1);
    }
}

6. Testing and Validation

  • Test your custom synchronizer in multithreaded environments to ensure correctness.
  • Use proper test tools like JUnit or TestNG.
  • Validate edge cases, such as reentrancy (if applicable), releasing resources by non-owners, or negative state transitions.

Best Practices

  • Always ensure a clean state transition in synchronization methods.
  • Use atomic operations to modify state (e.g., compareAndSetState).
  • Avoid busy spinning (e.g., Thread.yield() or blocking mechanisms are better).
  • Use AQS’s built-in blocking mechanisms like acquire, acquireShared, release, or releaseShared.

By following these steps and practices, you can create robust custom synchronizers tailored to your concurrency requirements.

How do I implement async pipelines with CompletableFuture chaining?

Asynchronous pipelines can be implemented efficiently in Java using CompletableFuture. The ability of CompletableFuture to chain multiple steps through its functional programming model (e.g., thenApply, thenCompose, thenAccept, etc.) makes it a powerful tool for building non-blocking pipelines.

Here’s a step-by-step guide to implement async pipelines using CompletableFuture chaining:


1. Basics of CompletableFuture

CompletableFuture is a class in java.util.concurrent that represents a future result of an asynchronous computation. You can chain computations, handle exceptions, and run them all asynchronously.

2. Example Async Pipeline Workflow

Let’s assume we have a pipeline with multiple steps:

  1. Fetch data from a remote source.
  2. Transform the data.
  3. Save the data to a database.
  4. Notify a user.

Each of these steps will be represented as a method returning a CompletableFuture.


3. Implementation

a) Define the Asynchronous Tasks

Each step in the pipeline is encapsulated as an asynchronous method using CompletableFuture.supplyAsync() or runAsync().

package org.kodejava.util.concurrent;

import java.util.concurrent.CompletableFuture;
import java.util.concurrent.Executors;
import java.util.concurrent.ExecutorService;

public class AsyncPipeline {

   private static final ExecutorService executor = Executors.newFixedThreadPool(10); // Thread pool

   // 1. Fetch data from a remote source
   public CompletableFuture<String> fetchData() {
      return CompletableFuture.supplyAsync(() -> {
         try {
            Thread.sleep(1000); // Simulating delay
         } catch (InterruptedException e) {
            throw new IllegalStateException(e);
         }
         System.out.println("Fetched data");
         return "Data from remote source";
      }, executor);
   }

   // 2. Transform the data
   public CompletableFuture<String> transformData(String data) {
      return CompletableFuture.supplyAsync(() -> {
         System.out.println("Transforming data");
         return data.toUpperCase();
      }, executor);
   }

   // 3. Save the data to a database
   public CompletableFuture<Void> saveToDatabase(String transformedData) {
      return CompletableFuture.runAsync(() -> {
         System.out.println("Saving data to database: " + transformedData);
      }, executor);
   }

   // 4. Notify the user
   public CompletableFuture<Void> notifyUser() {
      return CompletableFuture.runAsync(() -> {
         System.out.println("User notified!");
      }, executor);
   }

   // Build the pipeline
   public void executePipeline() {
      fetchData()
              .thenCompose(this::transformData) // Pass the result from "fetchData" to "transformData"
              .thenCompose(this::saveToDatabase) // Then save transformed data to database
              .thenCompose(aVoid -> notifyUser()) // Finally notify the user
              .exceptionally(ex -> { // Handle exceptions globally
                 System.err.println("Pipeline execution failed: " + ex.getMessage());
                 return null;
              })
              .join(); // Block and wait for the pipeline to complete
   }

   public static void main(String[] args) {
      new AsyncPipeline().executePipeline();
   }
}

4. Explanation of the Code

  1. supplyAsync():
    • Used for methods that generate results, such as fetchData() and transformData().
  2. runAsync():
    • Used for methods that don’t produce results (return void), like saveToDatabase() and notifyUser().
  3. Chaining with thenCompose:
    • thenCompose() is used for chaining tasks where each subsequent task depends on the result of the previous task.
  4. Error Handling with exceptionally:
    • exceptionally() is used to handle any error in the pipeline and provide fallback logic.
  5. Thread Pool:
    • You can specify a custom ExecutorService for better control over thread resources.
  6. join():
    • Blocks the main thread until the entire pipeline is complete.

5. Key Methods in CompletableFuture

Method Description
supplyAsync() Executes a task asynchronously and provides a result.
runAsync() Executes a task asynchronously without any result.
thenApply() Transforms the result of a CompletableFuture.
thenCompose() Chains a dependent CompletableFuture, useful when a task depends on the output of the previous.
thenAccept() Consumes the result of a task without returning a result itself.
exceptionally() Handles exceptions that occur during pipeline execution.
allOf() Combines multiple CompletableFutures and waits for all to complete.
anyOf() Completes when any of the provided CompletableFutures completes first.

6. Advanced: Combining Multiple Futures

If there’s a need to combine results from multiple independent asynchronous tasks, you can use allOf() or anyOf().

Example with allOf:

public void fetchMultipleSources() {
    CompletableFuture<String> source1 = fetchSource1();
    CompletableFuture<String> source2 = fetchSource2();

    CompletableFuture<Void> combined = CompletableFuture.allOf(source1, source2)
        .thenRun(() -> {
            try {
                // Retrieve results once all futures are complete
                System.out.println("Source1: " + source1.get());
                System.out.println("Source2: " + source2.get());
            } catch (Exception e) {
                e.printStackTrace();
            }
        });

    combined.join(); // Wait for the combined task to complete
}

private CompletableFuture<String> fetchSource1() {
    return CompletableFuture.supplyAsync(() -> {
        System.out.println("Fetching source 1...");
        return "Data from Source 1";
    });
}

private CompletableFuture<String> fetchSource2() {
    return CompletableFuture.supplyAsync(() -> {
        System.out.println("Fetching source 2...");
        return "Data from Source 2";
    });
}

This approach allows building flexible and robust asynchronous pipelines while keeping the code clear and concise.

How do I use CompletableFuture for reactive-style concurrency?

Using CompletableFuture in Java can be a powerful way to implement reactive-style concurrency. It provides a clean and functional way to perform asynchronous tasks, compose their results, and handle exceptions without blocking threads. Here’s an explanation with examples to guide you through its reactive-style usage:


Key Features of CompletableFuture

  1. Asynchronous execution – Run tasks on background threads.
  2. Chaining tasks – Perform dependent actions when a task completes using thenApply, thenAccept, thenCompose, etc.
  3. Combining tasks – Execute multiple tasks in parallel and combine their results using thenCombine, allOf, or anyOf.
  4. Exception handling – Handle errors gracefully with handle, exceptionally, or whenComplete.

Example Use Cases

1. Basic Asynchronous Execution

You can run a task asynchronously without blocking the main thread:

package org.kodejava.util.concurrent;

import java.util.concurrent.CompletableFuture;

public class CompletableFutureExample {
    public static void main(String[] args) {
        CompletableFuture.supplyAsync(() -> {
            // Simulate a long computation
            System.out.println("Running in background...");
            return "Result";
        }).thenAccept(result -> {
            // Use the result once completed
            System.out.println("Completed with: " + result);
        });

        System.out.println("Main thread is free to do other work...");
    }
}

Output:

Main thread is free to do other work...
Running in background...
Completed with: Result

2. Chaining Dependent Tasks

Reactive-style programming involves chaining tasks, which can be done with thenApply or thenCompose:

package org.kodejava.util.concurrent;

import java.util.concurrent.CompletableFuture;

public class CompletableFutureChaining {
    public static void main(String[] args) {
        CompletableFuture.supplyAsync(() -> {
            // Fetch some data (simulate API/database call)
            return "Data from API";
        }).thenApply(data -> {
            // Transform the data
            return data.toUpperCase();
        }).thenAccept(processedData -> {
            // Use transformed data
            System.out.println("Processed Data: " + processedData);
        });
    }
}

3. Combining Multiple Async Tasks

To run multiple tasks in parallel and combine their results:

package org.kodejava.util.concurrent;

import java.util.concurrent.CompletableFuture;

public class CompletableFutureCombine {
    public static void main(String[] args) {
        CompletableFuture<String> future1 = CompletableFuture.supplyAsync(() -> "Task 1 Result");
        CompletableFuture<String> future2 = CompletableFuture.supplyAsync(() -> "Task 2 Result");

        CompletableFuture<String> combinedFuture = future1.thenCombine(future2, (result1, result2) -> {
            return result1 + " & " + result2;
        });

        combinedFuture.thenAccept(System.out::println);
    }
}

Output:

Task 1 Result & Task 2 Result

4. Waiting for All Tasks to Complete

If you need to wait for multiple independent tasks to complete:

package org.kodejava.util.concurrent;

import java.util.concurrent.CompletableFuture;
import java.util.List;

public class CompletableFutureAllOf {
    public static void main(String[] args) {
        CompletableFuture<Void> allTasks = CompletableFuture.allOf(
                CompletableFuture.runAsync(() -> System.out.println("Task 1")),
                CompletableFuture.runAsync(() -> System.out.println("Task 2")),
                CompletableFuture.runAsync(() -> System.out.println("Task 3"))
        );

        // Wait for all tasks to complete
        allTasks.join();
        System.out.println("All tasks completed.");
    }
}

5. Handling Exceptions

You can handle exceptions gracefully with methods like exceptionally, handle, or whenComplete:

package org.kodejava.util.concurrent;

import java.util.concurrent.CompletableFuture;

public class CompletableFutureExceptionHandling {
    public static void main(String[] args) {
        CompletableFuture.supplyAsync(() -> {
                    // Simulate an error
                    if (true) throw new RuntimeException("Something went wrong!");
                    return "Task Result";
                })
                .exceptionally(ex -> {
                    System.out.println("Error: " + ex.getMessage());
                    return "Fallback Result";
                })
                .thenAccept(result -> System.out.println("Result: " + result));
    }
}

Output:

Error: Something went wrong!
Result: Fallback Result

6. Running Tasks in a Custom Executor

By default, CompletableFuture uses the common ForkJoinPool, but you can specify a custom executor:

package org.kodejava.util.concurrent;

import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.CompletableFuture;

public class CustomExecutorExample {
    public static void main(String[] args) {
        ExecutorService executor = Executors.newFixedThreadPool(2);

        CompletableFuture.runAsync(() -> {
            System.out.println("Task executing in custom executor");
        }, executor).thenRun(() -> executor.shutdown());
    }
}

Summary of Key Methods

Method Purpose
supplyAsync(Supplier) Run a computation in another thread and return a result.
runAsync(Runnable) Run a computation without returning a result.
thenApply(Function) Transform result of the stage.
thenCompose(Function) Chain another async computation dependent on the previous one.
thenAccept(Consumer) Consume the result.
thenCombine(CompletableFuture, BiFunction) Combine results of two independent computations.
allOf(CompletableFuture...) Wait for all tasks to complete.
anyOf(CompletableFuture...) Return as soon as any task is complete.
exceptionally(Function) Handle exceptions and provide a fallback value.
handle(BiFunction) Process the result or handle exceptions.

Benefits of Using CompletableFuture for Reactive Programming

  • Non-blocking and efficient concurrency.
  • Easier composition of asynchronous operations compared to traditional threads.
  • Fine-grained exception handling and coordination of parallel tasks.
  • Works well with APIs like REST or streaming in a reactive pipeline.

By taking advantage of these features, you can implement clean, reactive, and efficient systems.

How do I manage thread-local state in highly concurrent environments?

Managing thread-local state in a highly concurrent environment requires an understanding of ThreadLocal in Java and certain best practices to ensure correctness and good performance. Here’s how you can effectively manage thread-local state:


1. Use ThreadLocal for Thread-Specific State

The ThreadLocal class provides thread-local variables. Each thread accessing such a variable gets its own, independent copy of the variable.

Example:

package org.kodejava.util.concurrent;

public class ThreadLocalExample {
    private static final ThreadLocal<String> threadLocal = ThreadLocal.withInitial(() -> "Default Value");

    public static void main(String[] args) {
        Runnable task = () -> {
            System.out.println(Thread.currentThread().getName() + ": " + threadLocal.get());
            threadLocal.set(Thread.currentThread().getName() + "'s Value");
            System.out.println(Thread.currentThread().getName() + ": " + threadLocal.get());
        };

        Thread thread1 = new Thread(task);
        Thread thread2 = new Thread(task);

        thread1.start();
        thread2.start();
    }
}
  • Each thread gets its own copy of the threadLocal state.
  • The withInitial factory method ensures a default value is provided.

2. Clean Up Thread-Local State

Thread-local variables are bound to the lifecycle of the thread. In environments with thread pools (e.g., in Jakarta EE or Spring), threads are reused, so failing to clean up thread-local state may lead to memory leaks or stale data being visible to new tasks.

  • Manually invoke threadLocal.remove() after using it:
try {
    threadLocal.set("Some value");
    // Perform operations with thread-local value
} finally {
    threadLocal.remove();
}
  • Always clean up ThreadLocal in a finally block to ensure it’s removed if an exception occurs.

3. Avoid Overuse of ThreadLocal

While ThreadLocal is useful, overusing it can make code harder to understand, maintain, or debug. Use thread-local variables only when:

  1. There’s truly a need for per-thread state.
  2. Passing state explicitly through method arguments is not feasible.

4. Use Context Propagation Utilities

When working with frameworks like Jakarta EE or Spring, it’s common to propagate context across threads. This is particularly challenging in ExecutorService or reactive programming where threads move between states.

  • Spring: Use RequestContextHolder or libraries like Spring Security which leverage ThreadLocal to store security contexts.
  • ExecutorService Context Propagation: Use libraries like Apache Geronimo’s java-concurrent utilities or ThreadContext from MicroProfile Context Propagation to manage state transfer between threads.

5. Best Practices in Highly Concurrent Environments

  • Use Immutable Objects: Avoid mutable data in thread-local variables to prevent unintended side effects.
  • Limit Scope of ThreadLocal: Declare thread-local variables as private static final and restrict usage to specific classes or methods.
  • Profile and Test: Profiling tools like VisualVM can help ensure thread-local state isn’t causing unexpected memory leaks or bottlenecks.

6. Alternatives to ThreadLocal in Reactive Paradigms

In reactive, non-blocking environments:

  1. Avoid thread-local state as threads are not bound to a single request.
  2. Use explicit state passing chained with reactive operators (from frameworks like Reactor or RxJava).

Example of explicit state passing in a reactive flow:

Mono.just("Reactive State")
    .flatMap(state -> {
        // State is explicitly passed to the next step
        return Mono.just(state + " Modified");
    })
    .subscribe(System.out::println);

7. Debugging ThreadLocal Issues

If you run into issues such as memory leaks:

  • Use tools like Eclipse Memory Analyzer (MAT) to analyze thread-local references.
  • Validate that every ThreadLocal is removed (remove()) when it’s no longer needed.

By adhering to these guidelines, you can effectively and safely manage thread-local states in highly concurrent environments.

How do I design non-blocking algorithms with ConcurrentLinkedQueue?

Designing non-blocking algorithms with ConcurrentLinkedQueue can be a powerful way to build high-performance concurrent applications. ConcurrentLinkedQueue is a thread-safe, non-blocking queue implementation based on a lock-free linked node algorithm. It uses atomic operations (through sun.misc.Unsafe or java.util.concurrent.atomic package underneath) to ensure thread safety without locking, making it highly scalable.

Here’s how to approach the design of non-blocking algorithms using ConcurrentLinkedQueue:


1. Understand ConcurrentLinkedQueue Basics

Before diving in, it’s important to know the properties and methods of ConcurrentLinkedQueue:

  • Non-blocking: Operations like offer(), poll(), and peek() are implemented without locks, making them non-blocking and thread-safe.
  • Weakly consistent: Iterators and size-computation are weakly consistent, meaning that changes made during iteration may or may not be visible in the iteration.
  • FIFO ordering: It maintains first-in, first-out order among its elements.
  • No capacity restrictions: It dynamically grows as needed.

2. Primary API Methods

Here are the commonly used methods of ConcurrentLinkedQueue:

  • offer(E e): Inserts the specified element at the tail (returns true).
  • poll(): Retrieves and removes the head of the queue or returns null if the queue is empty.
  • peek(): Retrieves, but does not remove, the head of the queue or returns null if the queue is empty.
  • isEmpty(): Checks if the queue is empty.

3. Design Non-blocking Algorithms

The key to designing non-blocking algorithms with ConcurrentLinkedQueue is to avoid blocking operations like locks or synchronization and instead use its thread-safe methods to guarantee progress without contention.

Example Algorithm 1: Producer-Consumer Using ConcurrentLinkedQueue

This classic example demonstrates how ConcurrentLinkedQueue can be used for non-blocking communication between producer and consumer threads:

package org.kodejava.util.concurrent;

import java.util.concurrent.ConcurrentLinkedQueue;

public class NonBlockingProducerConsumer {
    private static final ConcurrentLinkedQueue<String> queue = new ConcurrentLinkedQueue<>();

    public static void main(String[] args) {
        // Producer thread
        Thread producer = new Thread(() -> {
            for (int i = 0; i < 10; i++) {
                String item = "Item " + i;
                queue.offer(item); // Non-blocking insertion
                System.out.println("Produced: " + item);

                try {
                    Thread.sleep(100); // Simulate work
                } catch (InterruptedException e) {
                    Thread.currentThread().interrupt();
                }
            }
        });

        // Consumer thread
        Thread consumer = new Thread(() -> {
            while (true) {
                String item = queue.poll(); // Non-blocking removal
                if (item != null) {
                    System.out.println("Consumed: " + item);
                }

                try {
                    Thread.sleep(50); // Simulate work
                } catch (InterruptedException e) {
                    Thread.currentThread().interrupt();
                    break;
                }
            }
        });

        producer.start();
        consumer.start();

        try {
            producer.join();
            consumer.interrupt();
            consumer.join();
        } catch (InterruptedException e) {
            Thread.currentThread().interrupt();
        }
    }
}
Explanation:
  • The producer thread inserts items into the queue using offer() without blocking.
  • The consumer thread retrieves items using poll(). If the queue is empty, it simply checks again later.
  • Both threads continue independently without locks or blocking.

Example Algorithm 2: Non-blocking Task Scheduler

A task scheduler processes tasks in a FIFO order, without blocking other threads.

package org.kodejava.util.concurrent;

import java.util.concurrent.ConcurrentLinkedQueue;

public class NonBlockingTaskScheduler {
    private final ConcurrentLinkedQueue<Runnable> taskQueue = new ConcurrentLinkedQueue<>();
    private volatile boolean isRunning = true;

    public void start() {
        Thread workerThread = new Thread(() -> {
            while (isRunning) {
                Runnable task = taskQueue.poll();
                if (task != null) {
                    try {
                        task.run(); // Execute the task
                    } catch (Exception e) {
                        e.printStackTrace();
                    }
                }
            }
        });
        workerThread.start();
    }

    public void stop() {
        isRunning = false;
    }

    public void submitTask(Runnable task) {
        taskQueue.offer(task);
    }

    public static void main(String[] args) {
        NonBlockingTaskScheduler scheduler = new NonBlockingTaskScheduler();
        scheduler.start();

        // Add tasks
        scheduler.submitTask(() -> System.out.println("Task 1 executed"));
        scheduler.submitTask(() -> System.out.println("Task 2 executed"));
        scheduler.submitTask(() -> System.out.println("Task 3 executed"));

        try {
            Thread.sleep(1000); // Let tasks execute
        } catch (InterruptedException e) {
            Thread.currentThread().interrupt();
        }

        scheduler.stop();
    }
}
Explanation:
  • Tasks are submitted using submitTask(), which adds them to the queue using offer().
  • The worker thread polls tasks with poll() and executes them without blocking.
  • The stop() method gracefully shuts down the scheduler by stopping the worker thread.

4. Avoid Common Pitfalls

When designing non-blocking algorithms with ConcurrentLinkedQueue, watch out for the following:

  1. Busy waiting: Avoid tight loops that continuously poll the queue when it’s empty. Use backoff mechanisms (e.g., Thread.sleep()) to reduce CPU usage.
  2. Memory usage: Since ConcurrentLinkedQueue has no capacity limits, it can grow indefinitely if items are added faster than they are retrieved.
  3. Weak consistency in iteration: Iterating over a ConcurrentLinkedQueue might not show all updates as the queue changes concurrently.

5. Performance Considerations

  • Low contention: ConcurrentLinkedQueue performs well under low contention but may degrade when heavily contended because multiple threads compete to update the head or tail.
  • Trade-off: For scenarios with extremely high contention, consider alternatives like Disruptor or ConcurrentHashMap for different patterns.
  • Garbage production: Because ConcurrentLinkedQueue is a linked structure, it creates garbage nodes during operations, which might affect GC performance in long-running applications.

Conclusion

To design non-blocking algorithms with ConcurrentLinkedQueue:

  1. Use its non-blocking methods (offer, poll, peek) for thread-safe data sharing.
  2. Avoid locks or synchronization around queue operations.
  3. Implement algorithms like producer-consumer, task scheduling, or message-passing that rely on the FIFO nature of the queue.
  4. Incorporate backoff mechanisms to avoid busy waiting.

By following these principles, you can create highly scalable and performant non-blocking applications.

How do I leverage StampedLock for high-performance read/write locking?

The StampedLock class in Java’s concurrency utilities (introduced in Java 8) is a high-performance read/write lock that differs from traditional ReadWriteLock (like ReentrantReadWriteLock) due to its ability to provide three locking modes:

  1. Write Lock: Exclusive access.
  2. Read Lock: Shared (non-exclusive) access.
  3. Optimistic Read Lock: A lightweight, non-blocking read lock for scenarios where reads dominate writes, but data consistency needs to be validated.

Below is an explanation of how to use StampedLock effectively for high-performance locking in different contexts:


1. Write Lock

The write lock is used when exclusive access to the shared resource is required, such as for updates. It provides behavior similar to a traditional lock but with better performance in many scenarios.

Example:

package org.kodejava.util.concurrent;

import java.util.concurrent.locks.StampedLock;

public class StampedLockExample {
    private int count = 0;
    private final StampedLock lock = new StampedLock();

    public void increment() {
        long stamp = lock.writeLock(); // Acquire write lock
        try {
            count++;
        } finally {
            lock.unlockWrite(stamp); // Release write lock
        }
    }
}

2. Read Lock

The read lock is used when shared access to a resource is sufficient, and there are no write operations being performed. It provides better throughput than a traditional lock by allowing multiple threads to read concurrently.

Example:

public int getCount() {
    long stamp = lock.readLock(); // Acquire read lock
    try {
        return count;
    } finally {
        lock.unlockRead(stamp); // Release read lock
    }
}

3. Optimistic Read Lock

The optimistic read lock is a key feature of StampedLock and is designed for scenarios where reads dominate and writes are infrequent. This mode allows a thread to proceed without actually acquiring a lock, provided that the shared resource isn’t later invalidated by a write operation.

Process:

  1. Acquire an optimistic read stamp with lock.tryOptimisticRead().
  2. Perform the read operation.
  3. Validate the stamp with lock.validate(stamp). If the stamp is no longer valid (i.e., a write operation occurred), fall back to a read lock.

Example:

public int optimisticReadCount() {
    long stamp = lock.tryOptimisticRead(); // Try optimistic read
    int currentCount = count; // Perform read operation

    if (!lock.validate(stamp)) { // Check if stamp is still valid
        // Fallback to read lock if a write occurred during the read
        stamp = lock.readLock();
        try {
            currentCount = count;
        } finally {
            lock.unlockRead(stamp);
        }
    }

    return currentCount; // Return the read value
}

This approach is highly efficient in scenarios with minimal contention, as it avoids actual locking unless necessary.


4. Combining Reads and Writes

Sometimes, a single operation involves both reads and writes. In such cases, you can upgrade from a read lock to a write lock using the convertToWriteLock method:

Example:

public void conditionalIncrement() {
    long stamp = lock.readLock();
    try {
        if (count < 10) {
            // Upgrade to write lock if modification is needed
            stamp = lock.tryConvertToWriteLock(stamp);
            if (stamp == 0L) { // Failed to upgrade, acquire write lock normally
                stamp = lock.writeLock();
            }
            count++;
        }
    } finally {
        lock.unlock(stamp); // Release the appropriate lock
    }
}

5. Things to Keep in Mind

  • Deadlock Avoidance: StampedLock does not support reentrancy (unlike ReentrantLock). Each thread must acquire the lock only once; otherwise, it may lead to deadlocks.
  • Performance: Using optimistic reads can offer great performance improvements in read-heavy scenarios, but they require careful validation to ensure correctness.
  • Fairness: StampedLock is not fair and does not guarantee lock acquisition order.

When to Use StampedLock

  • Optimistic Reads: If your application has far more reads than writes, and contention is generally low.
  • Shared Data Structures: For use cases like caching or maintaining shared state across threads, where high throughput is critical.

StampedLock strikes a balance between ease of use and performance, making it a valuable tool for high-performance concurrency tasks in Java!