—In this paper, we consider the problem of scheduling and mapping precedence-constrained tasks to a network of heterogeneous processors. In such systems, processors are usually physically distributed, implying that the communication cost is considerably higher than in tightly coupled multiprocessors. Therefore, scheduling and mapping algorithms for such systems must schedule the tasks as well a...

In anonymous networks, the processors do not have identity numbers. We investigate the following representative problems on anonymous networks: (a) the leader election problem, (b) the edge election problem, (c) the spanning tree construction problem, and (d) the topology recognition problem. On a given network, the above problems may or may not be solvable, depending on the amount of informati...

Network processors offer a new flexibility for network applications and reduce the time to market for data processing systems. In this paper, we describe the changed development process of the data plane using the Motorola C-5 Network Processor. We implemented a Resilient Packet Ring line card for a SDH cross connect. We show a solution for the support of different Quality of Service classes wi...

The strong consensus (SC) problem is a variant of the conventional distributed consensus problem (also known as the Byzantine agreement problem). The SC problem requires that the agreed value among fault-free processors be one of the fault-free processor’s initial values. Originally, the problem was studied in a fully connected network with malicious faulty processors. In this paper, the SC pro...

Routers are responsible for forwarding the packets in today's Internet from source to destination. Unfortunately, the Internet architecture has become resistant to change, in a way that kills new innovation. One potential solution to this problem is the concept of Diversified Networking, which uses virtualization at the network layer to enable multiple concurrent networks with minimal design co...

NICAM is a communication layer for SMP PC clusters connected via Myrinet, designed to reduce overhead and latency by directly utilizing a micro-processor equipped on the network interface. It adopts remote memory operations to reduce much of the overhead found in message passing. NICAM employs an Active Messages framework for exibility in programming on the network interface, and this exibility...

Network processors are commonly implemented as systems-on-a-chip with multiple processors, caches, memory interfaces and I/O components on a single chip. Networking workloads lend themselves to exploiting high levels of parallelism with these chipmultiprocessors. The constraints of such a system lie in the maximum chip area and the maximum power consumption that are permissible for economic and...

Absrract-With traditional event list techniques, evaluating a detailed discrete event simulation model can often require hours or even days of computation time. By eliminating the event list and maintaining only sufficient synchronization to ensure causality, parallel simulation can potentially provide speedups that are linear in the number of processors. We present a set of shared memory exper...

This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model and a distributed algorithm for networks of interconnected processors. I f an FCSP can be represented b y an acyclic constraint network of sire n with width bounded b y a constant then (1) the parallel algorithm takes...