Timed Common Lisp: the duration of deliberation

The two key features of Deliberation Scheduling and Anytime Algorithms are the duration of the computation and the resulting quality. Clearly, quality can be difficult to define and highly dependent on the domain. Duration, on the other hand, seems straightforward: how long the computation takes. But on what processor? Should the processor matter? What code counts in the computation? How is that code's duration modeled? These questions are addressed in this paper.