Programs & Examples
Concurrency and Executors · Study material
A flight-fare aggregator with CompletableFuture
Four airline APIs are queried in parallel; failures become "no fare", a slow API is cut off with completeOnTimeout, and the cheapest fare is chosen.
import java.util.Comparator;
import java.util.List;
import java.util.concurrent.CompletableFuture;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.TimeUnit;
record Quote(String airline, int price) { }
public class Main {
static Quote ask(String airline, int price, int delayMs, boolean fail) {
try { Thread.sleep(delayMs); } catch (InterruptedException e) { Thread.currentThread().interrupt(); }
if (fail) throw new IllegalStateException(airline + " API down");
return new Quote(airline, price);
}
public static void main(String[] args) {
try (ExecutorService io = Executors.newFixedThreadPool(4)) {
List<CompletableFuture<Quote>> calls = List.of(
CompletableFuture.supplyAsync(() -> ask("IndiGo", 5499, 80, false), io),
CompletableFuture.supplyAsync(() -> ask("Air India", 6120, 50, false), io),
CompletableFuture.supplyAsync(() -> ask("Akasa", 4999, 60, true), io), // fails
CompletableFuture.supplyAsync(() -> ask("Vistara", 4799, 3000, false), io) // too slow
.completeOnTimeout(new Quote("Vistara", Integer.MAX_VALUE), 300, TimeUnit.MILLISECONDS));
List<CompletableFuture<Quote>> safe = calls.stream()
.map(f -> f.exceptionally(ex -> new Quote("error: " + (ex.getCause() != null ? ex.getCause().getMessage() : ex.getMessage()), Integer.MAX_VALUE)))
.toList();
CompletableFuture.allOf(safe.toArray(new CompletableFuture<?>[0])).join(); // wait for all
List<Quote> quotes = safe.stream().map(CompletableFuture::join).toList();
quotes.forEach(q -> System.out.println(q.airline() + (q.price() == Integer.MAX_VALUE ? " (no fare)" : " Rs " + q.price())));
quotes.stream().filter(q -> q.price() != Integer.MAX_VALUE).min(Comparator.comparingInt(Quote::price))
.ifPresent(q -> System.out.println("cheapest: " + q.airline() + " Rs " + q.price()));
}
}
}
IndiGo Rs 5499 Air India Rs 6120 error: Akasa API down (no fare) Vistara (no fare) cheapest: IndiGo Rs 5499
Callable tasks on a fixed thread pool
The executor example computes six slow squares on three threads and sums them through their Futures.
Latch, semaphore and barrier
The synchronizer example waits for services to start, limits concurrent tasks to two, and runs workers through two barrier phases.