We present a delay-conscious processor allocation algorithm (PAL) for packet processing systems. PAL adapts the allocation of processors among packet processing services hosted by a system to minimize the number of packets that miss a configured delay bound. PAL accounts for processor reconfiguration overheads and copes well with the unpredictability of packet arrival patterns. A key contribution of PAL is its generality; it captures the adaptation opportunities in the system as a finite state...