Adaptive Resource Management in Peer-to-Peer Middleware

Decentralized proactive resource allocation for maximizing throughput of P2P Grid

“…However, makespan minimization is not suitable for large-scale distributed platforms as acquiring all various parameters (e.g., workload of individual tasks and the resource availability of all nodes) might take long time, which is also error-prone. Considering the heterogeneity of computing nodes, many other task scheduling solutions [13,14,15,16,17] are designed based on a fairness index criterion of nodes' workload levels. Unlike the traditional concept of fairness on user tasks' service level (e.g.…”

“…[ 16] try to improve the system performance by maximizing the fairness index of load distribution. Y. Drougas et al [14] also devised an autonomous algorithm by means of the load distribution fairness, aiming to improve the P2P system's performance.…”

Accommodating bursts in distributed stream processing systems

“…Recent efforts have proposed distributed stream processing infrastructures and have investigated composition and placement algorithms. The majority of these (including our previous work [5], [6], [7]) focus on composition and placement techniques making the assumption that resource availability and application rate requirements are constant.…”

Load Balancing Techniques for Distributed Stream Processing Applications in Overlay Environments

“…Peers can be grouped according to their geographical proximity, their network proximity, semantically, or even randomly. The organization of the network topology is outside the scope of this paper and several solutions have already been proposed [14,17]. Similar to those, we assume that peers are grouped using some criterion and one or more peers in each group are responsible for resource allocation, as discussed in Section 3.…”

“…Our current work builds upon [17] and provides a detailed experimental evaluation. Similar to our work, in [20] real-time specifications are added to components, while in [19] the authors use an informed branch-and-bound algorithm employing a competence function and forward checking to expedite its execution.…”