#### DMCA

## Optimum Transputer Configurations for Real Applications requiring Global Communications (1995)

Venue: | 18th World Occam and Transputer Users Group Conference, IOS |

Citations: | 3 - 2 self |

### Citations

3667 |
Adaptation in Natural and Artificial Systems
- Holland
- 1975
(Show Context)
Citation Context ...tical limits for optimal configurations for various numbers of processors, are included in tables 1 and 2. 3 Generating algorithm The genetic algorithm, developed by Goldberg [12] and also by Holland =-=[14]-=-, is a powerful directed search technique which is loosely based on biological models of evolution. It is extremely robust in the face of conflicting information. Genetic algorithms may be used to opt... |

1524 |
Modern graph theory
- Bollobás
- 1998
(Show Context)
Citation Context ...how the maximum number of processors that can be interconnected in a configuration of a certain diameter can be derived [6, 8]. An upper bound on this value may be obtained from extremal graph theory =-=[4]-=-. Assuming that every processor in the configuration has the same number of links (or valency), \Delta, the upper bound on the maximum number of processors in the configuration, usually called the Moo... |

1519 | Book of Genetic Algorithms - Davis, Hand - 1991 |

172 | Adaptation in Natural and Arti cial Systems - Holland - 1975 |

146 |
Genetic algorithms in search, optimisation and machine learning
- Goldberg
- 1989
(Show Context)
Citation Context ...ues, which are the theoretical limits for optimal configurations for various numbers of processors, are included in tables 1 and 2. 3 Generating algorithm The genetic algorithm, developed by Goldberg =-=[12]-=- and also by Holland [14], is a powerful directed search technique which is loosely based on biological models of evolution. It is extremely robust in the face of conflicting information. Genetic algo... |

58 |
Algebraic Graph Theory, in: Cambridge Tracts
- Biggs
- 1974
(Show Context)
Citation Context ... + \Delta(\Delta \Gamma 1) + \Delta(\Delta \Gamma 1) 2 + : : : + \Delta(\Delta \Gamma 1) DDiam \Gamma1 (1) processors for a diameter DDiam . Graphs achieving this bound are called Moore graphs. Biggs =-=[3]-=- shows that (except for DDiam=1 or \Delta=2), Moore graphs can exist only for the cases: DDiam=2 and \Delta=3, 7, or 57; but in all other cases, graphs can be found that approach these bounds. In orde... |

51 | Communications Structures for Large Networks Microcomputers - Wittie - 1981 |

40 | Strategies for interconnection networks: some methods from graph theory - Bermond, Delorme, et al. |

16 |
Using a genetic algorithm to tackle the processors configuration problem”, Symposium on Applied Computing
- Warwick, Tsang
- 1994
(Show Context)
Citation Context ...ws the results that have been achieved using the simple genetic algorithm presented in this paper. AMPGA and AMP GAcSP show previous results achieved using genetic algorithms as presented in [17] and =-=[21]-=- respectively. The final row of AMP configurations, labelled AMPDFS , are those obtained using a heuristic depth-first search strategy implemented in Prolog as presented in [8]. Diameters of other wel... |

11 |
Parallel Radiosity Methods
- Chalmers, Paddon
- 1989
(Show Context)
Citation Context ...the modelling of molecular interactions. Some of the best performance figures for problems requiring global communication running on T800 transputers have been achieved using irregular configurations =-=[7, 9]-=-. The design of these networks requires finding an optimal configuration over a very large search space. In this paper, configurations are reported that are extremely close to the theoretically limits... |

9 | Conta. Torus and other networks as communication networks with up to some hundred points - Von - 1983 |

8 | Genetic algorithms for generating minimum path con gurations, Microprocessors and Microsystems
- Sharpe, Chalmers, et al.
- 1994
(Show Context)
Citation Context ...r continuous functions. There is no particular constraint, either by the algorithm or by the representation of the network, on the way the fitness function is formulated. It was shown by Sharpe et al =-=[17]-=- that the minimum diameter metric was more important than the average interprocessor distance for real applications and thus the following fitness function f was used: f = w 1sDDiam + w 2sl + w 3sPDia... |

8 | The design of small-diameter network by local search
- Toueg, Steiglitz
- 1974
(Show Context)
Citation Context ... solutions exist for 37-40 processors. A number of completely different techniques have been proposed to obtain graphs with similar properties to these configurations. For example, Toug and Steiglitz =-=[18]-=- proposed a local search algorithm for finding graphs with small diameters. In their paper, the graphs studied by Trufanov [19] are used as the initial graphs and then a set of perturbations are carri... |

7 |
Parallel panel methods
- Chalmers, Fiddes, et al.
- 1990
(Show Context)
Citation Context ...the modelling of molecular interactions. Some of the best performance figures for problems requiring global communication running on T800 transputers have been achieved using irregular configurations =-=[7, 9]-=-. The design of these networks requires finding an optimal configuration over a very large search space. In this paper, configurations are reported that are extremely close to the theoretically limits... |

5 |
Constructing Minimum Path Configurations for Multiprocessor Systems
- Chalmers, Gregory
- 1992
(Show Context)
Citation Context ... source processor to its desired destination processor. It is important to show how the maximum number of processors that can be interconnected in a configuration of a certain diameter can be derived =-=[6, 8]-=-. An upper bound on this value may be obtained from extremal graph theory [4]. Assuming that every processor in the configuration has the same number of links (or valency), \Delta, the upper bound on ... |

4 |
A Minimum Path System for Parallel Processing
- Chalmers
- 1991
(Show Context)
Citation Context ... source processor to its desired destination processor. It is important to show how the maximum number of processors that can be interconnected in a configuration of a certain diameter can be derived =-=[6, 8]-=-. An upper bound on this value may be obtained from extremal graph theory [4]. Assuming that every processor in the configuration has the same number of links (or valency), \Delta, the upper bound on ... |

4 | Constructing minimum path con gurations for multiprocessor systems - Chalmers, Gregory - 1993 |

3 | Optimal processor interconnection topologies - Maekawa - 1981 |

2 |
What price Regularity
- Prior, Norman, et al.
- 1990
(Show Context)
Citation Context ...In their paper, the graphs studied by Trufanov [19] are used as the initial graphs and then a set of perturbations are carried out in order to try to achieve graphs with a lower diameter. Prior et al =-=[16] used Hami-=-ltonian graphs as their initial graph and then used genetic algorithms to "search" for an improved graph. These techniques do not produce exactly what is required for practical configuration... |

2 |
Some problems of distance on a graph
- Trufanov
- 1967
(Show Context)
Citation Context ...ilar properties to these configurations. For example, Toug and Steiglitz [18] proposed a local search algorithm for finding graphs with small diameters. In their paper, the graphs studied by Trufanov =-=[19]-=- are used as the initial graphs and then a set of perturbations are carried out in order to try to achieve graphs with a lower diameter. Prior et al [16] used Hamiltonian graphs as their initial graph... |

1 | Evaluating the performance of microcomputer configurations - Agrawal, Pathak - 1986 |

1 |
A Minimum Path system: a communication-efficient system for distributed-memory multiprocessors
- Chalmers
- 1993
(Show Context)
Citation Context .... A link between two processors is represented by two of the array elements containing one another's link numbers. For example, if processors 1 and 3 are connected via link numbers 5 and 12, then link=-=[5]-=- = 12 and link[12] = 5. This representation is the same as used by Greenwood [13], except that the nodes are not preconnected by a minimum spanning tree. A complete network that is normally, but not n... |

1 | The search for an optimal multiprocessor interconnection network - Dzwinel - 1991 |

1 |
Parallel Genetic Algorithms for AMP configurations
- Greenwood
- 1992
(Show Context)
Citation Context ...aining one another's link numbers. For example, if processors 1 and 3 are connected via link numbers 5 and 12, then link[5] = 12 and link[12] = 5. This representation is the same as used by Greenwood =-=[13]-=-, except that the nodes are not preconnected by a minimum spanning tree. A complete network that is normally, but not necessarily, fully connected, is formed by systematically filling all the array el... |

1 | Evaluating the performance of microcomputer con gurations - Agrawal, Pathak - 1986 |

1 | Parallel Genetic Algorithms for AMP con gurations - Greenwood - 1992 |