Using Application Benefit for Proactive Resource Allocation in Asynchronous Real-Time Distributed Systems
Issue No. 08 - August (2002 vol. 51)
<p>This paper presents two proactive resource allocation algorithms, called RBA* and OBA, for asynchronous real-time distributed systems. The algorithms consider an application model where timeliness requirements are expressed using Jensen's benefit functions and propose adaptation functions to describe anticipated application workload during future time intervals. Furthermore, the algorithms consider an adaptation model, where application processes are dynamically replicated for sharing workload increases and a switched real-time Ethernet network as the underlying system model. Given such models, the objective of the algorithms is to maximize aggregate application benefit and minimize aggregate missed deadline ratio. Since determining the optimal allocation is computationally intractable, the algorithms heuristically compute near-optimal resource allocations in polynomial-time. While RBA* analyzes process response times to determine resource allocation decisions, which is computationally expensive, OBA analyzes processor overloads to compute its decisions in a much faster way. RBA* incurs a quadratic amortized complexity in terms of process arrivals for its most computationally intensive component when DASA is used as the underlying scheduling algorithm, whereas OBA incurs a logarithmic amortized complexity for the corresponding component. Our benchmark-driven experimental studies reveal that RBA* produces a higher aggregate benefit and lower missed deadline ratio than OBA.</p>
Asynchronous real-time distributed systems, distributed real-time systems, proactive resource allocation, adaptive resource allocation, best-effort resource allocation, best-effort real-time scheduling, benefit functions, switched real-time Ethernet.
T. Hegazy and B. Ravindran, "Using Application Benefit for Proactive Resource Allocation in Asynchronous Real-Time Distributed Systems," in IEEE Transactions on Computers, vol. 51, no. , pp. 945-962, 2002.