ABSTRACT. The design of spatial coordination mechanisms for dynamical and continuous multiagent setting is a difficult challenge. While the top-down decomposition approach is ineff...
— In this article we tackle the problem of scheduling a dynamically generated DAG of multi-processor tasks (M-tasks). At first, we outline the need of such a scheduling approach...
Developing middleware services for dynamic distributed systems, e.g., ad-hoc networks, is a challenging task given that such services deal with dynamically changing membership and...
Kishori M. Konwar, Peter M. Musial, Nicolas C. Nic...
Distributed Web-server systems have been widely used to provide effective Internet services. The management of these systems requires dynamic controls of the Web traffic. With the...
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...