Abstract

We investigate a system with reconfigurable servers and bursty arrival streams for different job types. The problem of when to reallocate servers from one job type to another will then be formulated as a Markov decision process. We will show that solving this Markov decision process is very problematic for any but the most simple systems, demonstrating the need for heuristics. The performance of several heuristic allocations will be compared to that of the optimal policy for some cases and shown to yield reasonable performance.

Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.