Resource sharing in behavioral based scheduling

摘要

In this paper, two main contributions are presented. First, the Behavioral Importance Dual Priority Server (BIDS) reservation mechanism is extended to contemplate more than two importance levels. In fact, an integer-value function is used to postpone the reactivation of the server based on the last result obtained. Second, a resource contention algorithm for BIDS is presented. Although it may seem simple, the resource reservation paradigm may have certain anomalies while sharing resources. The proposal is an extension of the Stack Resource Policy which is formally proved.