Abstract

An approximation algorithm for an NP-complete problem in dynamic storage allocation is studied. A preemptive regime is assumed. It is shown that in the worst-case the waiting times for FIFO allocation of requests are linear functions of the minimum achievable times.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call