In this paper, we present a novel listbased scheduling algorithm called Predict Earliest Finish Time (PEFT) for heterogeneous computing systems. The algorithm has the same time complexity as the state-of-the-art algorithm for the same purpose, that is, Oðv2: pÞ for v tasks and p processors, but offers significant makes pan improvements by introducing a look-ahead Feature without increasing the ...

Two important performance parameters of distributed, rate-based flow control algorithms are their locality and convergence complexity. The former is characterized by the amount of global knowledge that is available to their scheduling mechanisms, while the latter is defined as the number of update operations performed on rates of individual sessions until max-min fairness is reached. Optimistic...

One of the most popular approaches to measuring productivity changes is based on using Malmquist productivity indexes. In this paper we propose a method for obtaining interval Malmquist productivity index (IMPI). The classical DEA models have been before used for measuring the Malmquist productivity index. The current article extends DEA models for measuring the interval Malmquist productivity ...

This paper focuses on studying the interval continuous-time algebraic Riccati equation A∗X + XA + Q − XGX = 0, both from the theoretical aspects and the computational ones. In theoretical parts, we show that Shary’s results for interval linear systems can only be partially generalized to this interval Riccati matrix equation. We then derive an efficient technique for enclosing the united stable...