Load Balancing

Problem Overview

• Partition a sequence of task burst times into n contiguous groups so the maximum total load on any resource is minimized.
• Input: int n and int[] burstTime; Output: int minimum possible maximum server load; constraints unspecified.
• Reflects load balancing and resource allocation in distributed parallel computing.
• A Mathworks coding interview problem and common interview question.