Performance evaluation of multi-core multi-cluster architecture

A multi-core cluster is a cluster composed of numbers of nodes where each node has a number of processors, each with more than one core within each single chip. Cluster nodes are connected via an interconnection network. Multi-cored processors are able to achieve higher performance without driving up power consumption and heat, which is the main concern in a single-core processor. A general problem in the network arises from the fact that multiple messages can be in transit at the same time on the same network links. This paper considers the communication latencies of a multi-core multi-cluster architecture will be investigated using simulation experiments and measurements under various working conditions

Multi-cluster dynamics in coupled phase oscillator networks

In this paper we examine robust clustering behaviour with multiple nontrivial clusters for identically and globally coupled phase oscillators. These systems are such that the dynamics is completely determined by the number of oscillators N and a single scalar function $g(\varphi)$ (the coupling function). Previous work has shown that (a) any clustering can stably appear via choice of a suitable coupling function and (b) open sets of coupling functions can generate heteroclinic network attractors between cluster states of saddle type, though there seem to be no examples where saddles with more than two nontrivial clusters are involved. In this work we clarify the relationship between the coupling function and the dynamics. We focus on cases where the clusters are inequivalent in the sense of not being related by a temporal symmetry, and demonstrate that there are coupling functions that give robust heteroclinic networks between periodic states involving three or more nontrivial clusters. We consider an example for N=6 oscillators where the clustering is into three inequivalent clusters. We also discuss some aspects of the bifurcation structure for periodic multi-cluster states and show that the transverse stability of inequivalent clusters can, to a large extent, be varied independently of the tangential stability

Multi-Cluster interleaving in linear arrays and rings

Interleaving codewords is an important method not only for combatting burst-errors, but also for flexible data-retrieving. This paper defines the Multi-Cluster Interleaving (MCI) problem, an interleaving problem for parallel data-retrieving. The MCI problems on linear arrays and rings are studied. The following problem is completely solved: how to interleave integers on a linear array or ring such that any m (m greater than or equal to 2) non-overlapping segments of length 2 in the array or ring have at least 3 distinct integers. We then present a scheme using a 'hierarchical-chain structure' to solve the following more general problem for linear arrays: how to interleave integers on a linear array such that any m (m greater than or equal to 2) non-overlapping segments of length L (L greater than or equal to 2) in the array have at least L + 1 distinct integers. It is shown that the scheme using the 'hierarchical-chain structure' solves the second interleaving problem for arrays that are asymptotically as long as the longest array on which an MCI exists, and clearly, for shorter arrays as well