Results 1  10
of
63
Analysis of The Generalized Dimension Exchange Method for Dynamic Load Balancing
 Journal of Parallel and Distributed Computing
, 1992
"... The dimension exchange method is a distributed load balancing method for pointtopoint networks. We add a parameter, called the exchange parameter, to the method to control the splitting of load between a pair of directly connected processors, and call this parameterized version the generalized di ..."
Abstract

Cited by 42 (7 self)
 Add to MetaCart
The dimension exchange method is a distributed load balancing method for pointtopoint networks. We add a parameter, called the exchange parameter, to the method to control the splitting of load between a pair of directly connected processors, and call this parameterized version the generalized dimension exchange (GDE) method. The rationale for the introduction of this parameter is that splitting the workload into equal halves does not necessarily lead to an optimal result (in terms of the convergence rate) for certain structures. We carry out an analysis of this new method, emphasizing on its termination aspects and potential efficiency. Given a specific structure, one needs to determine a value to use for the exchange parameter that would lead to an optimal result. To this end, we first derive a sufficient and necessary condition for the termination of the method. We then show that equal splitting, proposed originally by others as a heuristic strategy, indeed yields optimal efficie...
Protection Cycles in Mesh WDM Networks
 IEEE Journal on Selected Areas in Communications
, 2000
"... A fault recovery system that is fast and reliable is essential to today's networks, as it can be used to minimize the impact of the fault on the operation of the network and the services it provides. This paper proposes a methodology for performing automatic protection switching (APS) in optical net ..."
Abstract

Cited by 38 (0 self)
 Add to MetaCart
A fault recovery system that is fast and reliable is essential to today's networks, as it can be used to minimize the impact of the fault on the operation of the network and the services it provides. This paper proposes a methodology for performing automatic protection switching (APS) in optical networks with arbitrary mesh topologies in order to protect the network from fiber link failures. All fiber links interconnecting the optical switches are assumed to be bidirectional. In the scenario considered, the layout of the protection fibers and the setup of the protection switches is implemented in nonreal time, during the setup of the network. When a fiber link fails, the connections that use that link are automatically restored and their signals are routed to their original destination using the protection fibers and protection switches. The protection process proposed is fast, distributed, and autonomous. It restores the network in real time, without relying on a central manager or a centralized database. It is also independent of the topology and the connection state of the network at the time of the failure.
Nearest Neighbor Algorithms for Load Balancing in Parallel Computers
, 1995
"... With nearest neighbor load balancing algorithms, a processor makes balancing decisions based on localized workload information and manages workload migrations within its neighborhood. This paper compares a couple of fairly wellknown nearest neighbor algorithms, the dimensionexchange (DE, for shor ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
With nearest neighbor load balancing algorithms, a processor makes balancing decisions based on localized workload information and manages workload migrations within its neighborhood. This paper compares a couple of fairly wellknown nearest neighbor algorithms, the dimensionexchange (DE, for short) and the diffusion (DF, for short) methods and their several variantsthe average dimensionexchange (ADE), the optimallytuned dimensionexchange (ODE), the local average diffusion (ADF) and the optimallytuned diffusion (ODF). The measures of interest are their efficiency in driving any initial workload distribution to a uniform distribution and their ability in controlling the growth of the variance among the processors' workloads. The comparison is made with respect to both oneport and allport communication architectures and in consideration of various implementation strategies including synchronous/asynchronous invocation policies and static/dynamic random workload behaviors. It t...
Pattern vectors from algebraic graph theory
 IEEE PAMI
, 2005
"... Graph structures have proved computationally cumbersome for pattern analysis. The reason for this is that before graphs can be converted to pattern vectors, correspondences must be established between the nodes of structures which are potentially of different size. To overcome this problem, in this ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
Graph structures have proved computationally cumbersome for pattern analysis. The reason for this is that before graphs can be converted to pattern vectors, correspondences must be established between the nodes of structures which are potentially of different size. To overcome this problem, in this paper we turn to the spectral decomposition of the Laplacian matrix. We show how the elements of the spectral matrix for the Laplacian can be used to construct symmetric polynomials that are permutation invariants. The coefficients of these polynomials can be used as graph features which can be encoded in a vectorial manner. We extend this representation to graphs in which there are unary attributes on the nodes and binary attributes on the edges by using the spectral decomposition of a Hermitian property matrix that can be viewed as a complex analogue of the Laplacian. To embed the graphs in a pattern space, we explore whether the vectors of invariants can be embedded in a low dimensional space using a number of alternative strategies including principal components analysis (PCA), multidimensional scaling (MDS) and locality preserving projection (LPP). Experimentally, we demonstrate that the embeddings result in well defined graph clusters. Our experiments with the
A Spectral Approach to Bandwidth and Separator Problems in Graphs
, 1993
"... Lower bounds on the bandwidth, the size of a vertex separator of general undirected graphs, and the largest common subgraph of two undirected (weighted) graphs are obtained. The bounds are based on a projection technique developed for the quadratic assignment problem, and once more demonstrate the i ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
Lower bounds on the bandwidth, the size of a vertex separator of general undirected graphs, and the largest common subgraph of two undirected (weighted) graphs are obtained. The bounds are based on a projection technique developed for the quadratic assignment problem, and once more demonstrate the importance of the extreme eigenvalues of the Laplacian. They will be shown to be strict for certain classes of graphs and compare favourably to bounds already known in literature. Further improvement is gained by applying nonlinear optimization methods.
Inference of Node Replacement Recursive Graph Grammars
 SIXTH SIAM INTERNATIONAL CONFERENCE ON DATA MINING, 2006
, 2001
"... Graph grammars combine the relational aspect of graphs with the iterative and recursive aspects of string grammars, and thus represent an important next step in our ability to discover knowledge from data. In this paper we describe an approach to learning node replacement graph grammars. This approa ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
Graph grammars combine the relational aspect of graphs with the iterative and recursive aspects of string grammars, and thus represent an important next step in our ability to discover knowledge from data. In this paper we describe an approach to learning node replacement graph grammars. This approach is based on previous research in frequent isomorphic subgraphs discovery. We extend the search for frequent subgraphs by checking for overlap among the instances of the subgraphs in the input graph. If subgraphs overlap by one node we propose a node replacement grammar production. We also can infer a hierarchy of productions by compressing portions of a graph described by a production and then infer new productions on the compressed graph. We validate this approach in experiments where we generate graphs from known grammars and measure how well our system infers the original grammar from the generated graph. We also describe results on several realworld tasks from chemical mining to XML schema induction. We briefly discuss other grammar inference systems indicating that our study extends classes of learnable graph grammars.
EdgeColoring and fColoring for Various Classes of Graphs
 MATCH Commun. Math. Comput. Chem
, 1999
"... In an ordinary edgecoloring of a graph each color... This paper gives efficient sequential and parallel algorithms to find ordinary edgecolorings and fcolorings for various classes of graphs such as bipartite graphs, planar graphs, and graphs having fixed degeneracy, treewidth, genus, arboricity ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
In an ordinary edgecoloring of a graph each color... This paper gives efficient sequential and parallel algorithms to find ordinary edgecolorings and fcolorings for various classes of graphs such as bipartite graphs, planar graphs, and graphs having fixed degeneracy, treewidth, genus, arboricity, unicyclic index or thickness.
Deutsche Bundesbank (2000c): The Deutsche Bundesbank’s Involvement in Banking Supervision Monthly Report of the Deutsche Bundesbank
 Discrete Math
"... The energy of a graph G, denoted by E(G), is defined as the sum of the absolute values of all eigenvalues of G. Let G be a graph of order n and rank(G) be the rank of the adjacency matrix of G. In this paper we characterize all graphs with E(G) = rank(G). Among other results we show that apart from ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
The energy of a graph G, denoted by E(G), is defined as the sum of the absolute values of all eigenvalues of G. Let G be a graph of order n and rank(G) be the rank of the adjacency matrix of G. In this paper we characterize all graphs with E(G) = rank(G). Among other results we show that apart from a few families of graphs, E(G) ≥ 2 max(χ(G), n − χ(G)), where n is the number of vertices of G, G and χ(G) are the complement and the chromatic number of G, respectively. Moreover some new lower bounds for E(G) in terms of rank(G) are given.
On EdgeColouring Indifference Graphs
, 1997
"... . Vizing's theorem states that the chromatic index Ø 0 (G) of a graph G is either the maximum degree \Delta(G) or \Delta(G) + 1. A graph G is called overfull if jE(G)j ? \Delta(G)bjV (G)j=2c. A sufficient condition for Ø 0 (G) = \Delta(G) + 1 is that G contains an overfull subgraph H with \De ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
. Vizing's theorem states that the chromatic index Ø 0 (G) of a graph G is either the maximum degree \Delta(G) or \Delta(G) + 1. A graph G is called overfull if jE(G)j ? \Delta(G)bjV (G)j=2c. A sufficient condition for Ø 0 (G) = \Delta(G) + 1 is that G contains an overfull subgraph H with \Delta(H ) = \Delta(G). Plantholt proved that this condition is necessary for graphs with a universal vertex. In this paper, we conjecture that, for indifference graphs, this is also true. As supporting evidence, we prove this conjecture for general graphs with three maximal cliques and with no universal vertex, and for indifference graphs with odd maximum degree. For the latter subclass, we prove that Ø 0 = \Delta. 1 Introduction An edgecolouring of a graph is an assignment of colours to its edges such that no adjacent edges have the same colour. The chromatic index of a graph is the minimum number of colours required to produce an edgecolouring for that graph. In this paper, we address...