Sciweavers

1519 search results - page 74 / 304
» Network Partitioning of Data Parallel Computations
Sort
View
EUROPAR
2007
Springer
14 years 1 months ago
Distributed Computation of All Node Replacements of a Minimum Spanning Tree
In many network applications the computation takes place on the minimum-cost spanning tree (MST) of the network; unfortunately, a single link or node failure disconnects the tree. ...
Paola Flocchini, Toni Mesa Enriquez, Linda Pagli, ...
HPCN
1997
Springer
14 years 1 months ago
Parallel Solution of Irregular, Sparse Matrix Problems Using High Performance Fortran
For regular, sparse, linear systems, like those derived from regular grids, using High Performance Fortran (HPF) for iterative solvers is straightforward. However, for irregular ma...
Eric de Sturler, Damian Loher
RTSS
2007
IEEE
14 years 3 months ago
An Energy-Driven Design Methodology for Distributing DSP Applications across Wireless Sensor Networks
Wireless sensor network (WSN) applications have been studied extensively in recent years. Such applications involve resource-limited embedded sensor nodes that have small size and...
Chung-Ching Shen, William Plishker, Shuvra S. Bhat...
HPDC
1998
IEEE
14 years 1 months ago
Efficient Coupling of Parallel Applications Using PAWS
PAWS (Parallel Application WorkSpace) is a software infrastructure for use in connecting separate parallel applications within a component-like model. A central PAWS Controller co...
Peter H. Beckman, Patricia K. Fasel, William F. Hu...
HPCC
2007
Springer
14 years 3 months ago
Towards a Complexity Model for Design and Analysis of PGAS-Based Algorithms
Many new Partitioned Global Address Space (PGAS) programming languages have recently emerged and are becoming ubiquitously available on nearly all modern parallel architectures. PG...
Mohamed Bakhouya, Jaafar Gaber, Tarek A. El-Ghazaw...