A fundamental problem in parallel computing is partitioning data structures in such a way as to minimize communication between processes while keeping the loads balanced. The problem is particularly acute when the underlying data structures are irregular, pointer-based structures. Here we present a methodology for partitioning a general class of dynamic data structures with guaranteed bounds on...

Graph problems are finding increasing applications in high performance computing disciplines. Although many regular problems can be solved efficiently in parallel, obtaining efficient implementations for irregular graph problems remains a challenge. We propose techniques for designing and implementing efficient parallel algorithms for graph problems on symmetric multiprocessors and chip multipr...

A graph curve is a nodal curve C such that each irreducible component of C is smooth, rational and meets exactly 3 others (Bayer and Eisenbud). Here we classify the graph curves with gonality 1 with respect to balanced line bundles in the sense of L. Caporaso.

Fiber Channel fabric, cascading, fabric topology, performance analysis, deadlock avoidance, fairness, deadlock-free routing, balanced routing, irregular topologies The Fiber Channel standard provides a mechanism for interconnecting heterogeneous systems containing peripheral devices and computer systems through optical fiber media. In this paper, we consider how FC switches can be cascaded to f...

Cortical neurons in vivo fire quite irregularly. Previous studies about the origin of such irregular neural dynamics have given rise to two major models: a balanced excitation and inhibition model, and a model of highly synchronized synaptic inputs. To elucidate the network mechanisms underlying synchronized synaptic inputs and account for irregular neural dynamics, we investigate a spatially e...

The quantity g (k) (v) was introduced in [6] as the minimum number of blocks necessary in a pairwise balanced design on v elements, subject to the condition that the longest block has length k. Recently, we have needed to use all possibilities for such minimal covering designs, and we record all non-isomorphic solutions to the problem for v ≤ 13.

Berge defined a hypergraph to be balanced if its incidence matrix is balanced. We consider this concept applied to graphs, and call a graph to be balanced when its clique matrix is balanced. Characterizations of balanced graphs by forbidden subgraphs and by clique subgraphs are proved in this work. Using properties of domination we define four subclasses of balanced graphs. Two of them are char...