Several variants of scheduling task graphs with interprocessor communication delays have been shown to be NP -complete. This paper completely characterizes the complexity of this problem under the restriction that the task graphs are trees and that each task has unit execution time. It is shown

In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no time-delays, ii) networks with fixed topology and communication time-delays, and iii) max-consensus problems (or

Abstract-This paper deals with the consensus problem under communication network inducing delays. It is well-known that introducing a delay leads in general to a reduction of the performance or to instability due to the fact that timedelay systems are infinite dimensional. For instance, the set

We show that a greedy algorithm for scheduling unit time jobs on two machines with unit communication delays produces an optimal schedule when the precedence constraints are given by a rooted forest. We also give a min/max relationship for the length of such a schedule. The min/max result (for

the computing bandwidth, the communication bandwidth, the communication delay, and the efficiency of coupling communication and computation. Portable parallel algorithms typically adapt to the machine configuration, in terms of these parameters. The utility of the model is demonstrated through examples

to an existing protocol stack, allowing experiments to be run on a standalone system. dummynet works by intercepting communications of the protocol layer under test and simulating the effects of finite queues, bandwidth limitations and communication delays. It runs in a fully operational system, hence allowing

Modern industrial processes, public service needs, and research interests have established a clear need to perform work remotely [12][4]. Teleoperators were developed with the advent of nuclear industry in the mid 1940's and have been since used extensively to perform work in hazardous environments (nuclear, chemical), undersea (resource exploration, waste management, pollution monitoring), and in the outer space (sample acquisition, satellite deployment/repair). Sophisticated systems have been designed and built to meet these

Multimedia communication involving digital audio and/or digital video has rather strict delay requirements. A real-time channel is defined in this paper as a simplex connection between a source and a destination characterized by parameters representing the performance requirements of the client. A

As companies move towards many-core chips, an efficient onchip communication fabric to connect these cores assumes critical importance. To address limitations to wire delay scalability and increasing bandwidth demands, state-of-the-art on-chip networks use a modular packet-switched design

While today’s computer networks support only best-effort service, future packet-switching integrated-services networks will have to support real-time communication services that allow clients to transport information with performance guarantees expressed in terms of delay, delay jitter, throughput