Distributed computations may be viewed as a set of communicating processes. If such a computation is to be executed by a multi-processor system, the processes have to be distributed over the processors and the communications have to be distributed over a network. This leads to the questions of load balancing and message routing. In this paper we consider distributed recursive computations and we propose a class of processor networks that admits a homogeneous dist ribution of processes and trivial routing. Furthermore, we identify a subclass that admits a planar embedding of the network
AbstractWe propose an interconnection structure for multicomputer networks, called recursive circula...
We define the notion of total algorithms for networks of processes. A total algorithm enforces that ...
Abstract. Inspired by social networks and complex systems, we propose a core-periphery network archi...
Distributed computations may be viewed as a set of communicating processes. If such a computation ...
Recursion is a fundamental concept of sequential computing that allows for the design of simple and ...
This thesis deals essentially with communication in interconnection network.In chapter 1, we present...
Abstract: In this paper, functioning and interaction of distributed devices and concurrent algorithm...
This chapter is concerned with designing algorithms for machines constructed from multiple processor...
Abstract-A family of distributed algorithms for the dynamic computation of the shortest paths in a c...
A linear network of communicating processors is analyzed. The processors in the network may or may n...
Projet PARADISDesigners of distributed algorithms must deal with a variety of issues including seque...
. Efficient communication in networks is a prerequisite to exploit the performance of large parallel...
AbstractA class of sequential programs is distributed through a series of program transformations. T...
Abstract- The mapping problem arises when the dependency struc-ture of a parallel algorithm differs ...
We propose and analyze a new class of interconnection networks, RCC, for interconnecting the process...
AbstractWe propose an interconnection structure for multicomputer networks, called recursive circula...
We define the notion of total algorithms for networks of processes. A total algorithm enforces that ...
Abstract. Inspired by social networks and complex systems, we propose a core-periphery network archi...
Distributed computations may be viewed as a set of communicating processes. If such a computation ...
Recursion is a fundamental concept of sequential computing that allows for the design of simple and ...
This thesis deals essentially with communication in interconnection network.In chapter 1, we present...
Abstract: In this paper, functioning and interaction of distributed devices and concurrent algorithm...
This chapter is concerned with designing algorithms for machines constructed from multiple processor...
Abstract-A family of distributed algorithms for the dynamic computation of the shortest paths in a c...
A linear network of communicating processors is analyzed. The processors in the network may or may n...
Projet PARADISDesigners of distributed algorithms must deal with a variety of issues including seque...
. Efficient communication in networks is a prerequisite to exploit the performance of large parallel...
AbstractA class of sequential programs is distributed through a series of program transformations. T...
Abstract- The mapping problem arises when the dependency struc-ture of a parallel algorithm differs ...
We propose and analyze a new class of interconnection networks, RCC, for interconnecting the process...
AbstractWe propose an interconnection structure for multicomputer networks, called recursive circula...
We define the notion of total algorithms for networks of processes. A total algorithm enforces that ...
Abstract. Inspired by social networks and complex systems, we propose a core-periphery network archi...