Sciweavers

1390 search results - page 143 / 278
» Coordination Patterns for Parallel Computing
Sort
View
IPPS
2007
IEEE
14 years 3 months ago
Automatic Trace-Based Performance Analysis of Metacomputing Applications
The processing power and memory capacity of independent and heterogeneous parallel machines can be combined to form a single parallel system that is more powerful than any of its ...
Daniel Becker, Felix Wolf, Wolfgang Frings, Markus...
SPAA
1993
ACM
14 years 1 months ago
Supporting Sets of Arbitrary Connections on iWarp Through Communication Context Switches
In this paper we introduce the ConSet communication model for distributed memory parallel computers. The communication needs of an application program can be satisfied by some ar...
Anja Feldmann, Thomas Stricker, Thomas E. Warfel
IPPS
2003
IEEE
14 years 2 months ago
Task Pool Teams for Implementing Irregular Algorithms on Clusters of SMPs
The characteristics of irregular algorithms make a parallel implementation difficult, especially for PC clusters or clusters of SMPs. These characteristics may include an unpredi...
Judith Hippold, Gudula Rünger
IPPS
1997
IEEE
14 years 1 months ago
Optimal Scheduling for UET-UCT Generalized n-Dimensional Grid Task Graphs
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
Theodore Andronikos, Nectarios Koziris, George K. ...
KDD
2002
ACM
147views Data Mining» more  KDD 2002»
14 years 9 months ago
Visualized Classification of Multiple Sample Types
The goal of the knowledge discovery and data mining is to extract the useful knowledge from the given data. Visualization enables us to find structures, features, patterns, and re...
Li Zhang, Aidong Zhang, Murali Ramanathan