In this work, we show that the standard graph-partitioning-based decomposition of sparse
matrices does not reflect the actual communication volume requirement for parallel matrix …

The one-dimensional decomposition of nonuniform workload arrays with optimal load
balancing is investigated. The problem has been studied in the literature as the “chains-on …

Using depth-first search, the authors develop and analyze the performance of a routing
scheme for hypercube multicomputers in the presence of an arbitrary number of faulty …

In this work, we show the deficiencies of the graph model for decomposing sparse matrices
for parallel matrix-vector multiplication. Then, we propose two hypergraph models which …

The task-to-processor mapping problem is addressed in the context of a local-memory
multicomputer with a hypercube interconnection topology. Two heuristic cluster-based …

Networking of personal computers and workstations is becoming commonplace in academic
and industrial environments. A cluster of workstations provides engineers with a familiar …

Two spanning trees rooted at some vertex r in a graph G are said to be independent if for
each vertex v of G, v≠ r, the paths from r to v in two trees are vertex-disjoint. A set of …

The numerical solution of large systems of linear equations lies at the heart of many
scientific computing efforts. Sparse systems with several hundreds of thousands of …

The development of a mathematical modular framework based on Petri network (PN) theory
to model a traffic network is the subject of this paper. Traffic intersections are the primitive …

A new mapping heuristic is developed, based on the recently proposed Mean Field
Annealing (MFA) algorithm. An efficient implementation scheme, which decreases the …