Figure 5From: A parallel and incremental algorithm for efficient unique signature discovery on DNA databasesThe result of dividing long tasks into short tasks in the processing order list. Task F in Figure 5 is divided into two tasks with identical processing times, yielding the new task list. The overall processing time for a two-processor computer is 12 units, which equals the optimal processing time.Back to article page