Fixed Delay Scheduling with Quartz


With this (Fixed Delay) kind of scheduling there is always a same fixed delay between termination of one execution and commencement of another, as can be shown in the following image.


Java supports this kind of scheduling inherently through java.util.Timer and java.util.concurrent.ScheduledExecutorService, however achieving fix delay using quartz is not that straight forward (Specially when misfires are considered)

One might consider the easy approach, of rescheduling itself from within the execute method of quartz job.


Here is the implementation, you would keep the reschedule method in util class as static method.


However, a better approach would be to use Quartz listeners:


Here is the implementation of the listener


Here is the usage :


Here is the code for and


Scalable Java Thread Pool Executor

Ideally from any Thread Pool Executor, the expectation would be the following

  • An initial set of threads (core threads pool size) created up front, to handle the load.
  • If the load increases, then more threads should be created to handle the load up to max threads (Max pool size)
  • If the number of threads increases beyond Max Pool Size, then Queue up the tasks.
  • If Bounded Queue is used, and the queue is full then bring in some rejection policy.

The following diagram depicts; only initial threads are created to handle tasks (When load is very low).


As more task come in, more threads are created to handle the load (Task queue is still empty), if total number threads created is less than max pool size.


Task Queue getting filled up if total number of tasks is more than total number of threads (initial + extended)


Unfortunately, Java Thread Pool Executor (TPE) is biased towards queuing rather than spawning new threads, i.e., after the initial core threads gets occupied, tasks gets added to queue, and after the queue reaches its limit (Which would happen only for bounded queue), extra threads would be spawned. If the queue is unbounded then extended threads won’t get spawned at all, as depicted in the following image.


1==> Initial Core threads were created to handle the load

2==> Once there are more tasks than number of core threads, queue starts getting filling up, to store the tasks

3==> Once the queue is filled, extended threads are created.

Here is the code in TPE, which has problem


We have got couple of work around:

Work Around #1

Set the corePoolSize and maximumPoolSize to same value and set allowCoreThreadTimeOut to true.


  • No coding hack required


  • There is no real caching of threads as threads are getting created and terminated quite often.
  • There is no proper scalability.

Work Around #2

  • Override the offer method of delegator TransferQueue, and try to provide the task to one of the free worker threads, return false if there is no waiting threads,
  • Implement custom RejectedExecutionHandler to always add to Queue.


Refer this implementation for more detail


  • TransferQueue ensures that threads are not unnecessarily created, and transfers the work directly to waiting thread.


  • Customized rejection handler cannot be used, since it is used to insert the the tasks to queue.

Work Around #3

Use custom queue (TransferQueue) and override the offer method to do the following

  1. try to transfer the task directly to waiting thread (if any)
  2. If above fails, and max pool size is not reached then create extended thread by returning false from offer method
  3. otherwise insert into queue


Refer this implementation for more detail.


  • TransferQueue ensures that threads are not unnecessarily created, and transfers the work directly to waiting thread on the queue.
  • Custom Rejection Handler can be used.


  • There is a cyclic dependency between Queue and Executor.

Work Around #4

Use Custom Thread pool executor, specially dedicated for this purpose, It uses LIFO scheduling as described in Systems @ Facebook scale

Java Gotchas

Overloading Gotcha

Let’s consider couple of java classes

public class AirCraft {

public class C141AirCraft extends AirCraft {

public class Pilot {

    public void flyAirCraft(AirCraft airCraft) {
       System.out.println("Flying Plain Air Craft");
public class C141Pilot extends Pilot {

    public void flyAirCraft(AirCraft airCraft) {
      System.out.println("C141Pilot Flying Plain Air Craft");

    public void flyAirCraft(C141AirCraft c141AirCraft) {
      System.out.println("C141Pilot Flying C141 Air Craft");

What the following code would print out ?

Pilot c141Pilot = new C141Pilot();
c141Pilot.flyAirCraft(new C141AirCraft());

If you say C141Pilot Flying C141 Air Craft ? then that’s not the correct answer.

It prints the following
C141Pilot Flying Plain Air Craft

Why? As per the Java Language Specification Section 8.4.9 The signature of the method to invoked is determined at compile time, However actual method invocation on the target instance happens at run time using dynamic method lookup.

Field Shadowing Gotcha

Let’s consider couple of java classes

public class Parent {
    public String name = "Parent";
public class Child extends Parent {
	public String name = "Child";

What the following code would print out ?

Parent parent = new Child();
Child child = new Child();

If you think the two output statements would print

Then your assumption is in correct.

As per this Java tutorial, Java data members are not Polymorphic. and are two distinct variables, that happen to have the same name.

The output would be


A Subclass variable shadows the super class variable, However then both can be accessed individually.