Sciweavers

776 search results - page 34 / 156
» Distributed Information Regularization on Graphs
Sort
View
101
Voted
HPCN
1997
Springer
15 years 4 months ago
Visualizing the Iteration Space in PEFPT
Abstract. Su cient and precise semantic information is essential to interactive parallel programming. In this paper, we present afeasible implementation of the iteration space depe...
Qi Wang, Yijun Yu, Erik H. D'Hollander
ISPA
2007
Springer
15 years 6 months ago
Binomial Graph: A Scalable and Fault-Tolerant Logical Network Topology
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. The logical network topologies must also suppo...
Thara Angskun, George Bosilca, Jack Dongarra
117
Voted
CORR
2011
Springer
149views Education» more  CORR 2011»
14 years 7 months ago
Solving k-Set Agreement with Stable Skeleton Graphs
In this paper we consider the k-set agreement problem in distributed round-based systems where processes communicate by message passing. We capture the synchrony and reliability o...
Martin Biely, Peter Robinson, Ulrich Schmid
133
Voted
EJC
2011
14 years 7 months ago
Distributive lattices, polyhedra, and generalized flows
A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...
Stefan Felsner, Kolja B. Knauer
123
Voted
LCPC
1994
Springer
15 years 4 months ago
Optimizing Array Distributions in Data-Parallel Programs
Data parallel programs are sensitive to the distribution of data across processor nodes. We formulate the reduction of inter-node communication as an optimization on a colored gra...
Krishna Kunchithapadam, Barton P. Miller