Computing resource bounds using inclusion scheduling

We propose an framework to estimate resource bounds. The framework takes imprecise system characteristics and multiple design attributes into account. Considering a design goal, an initial bound is first generated. Then, a polynomial-time process called inclusion scheduling is used as a tool to determine a schedule under impreciseness and improve the bounds. Our experiments show that considering impreciseness can achieve a better bound than the traditional approach