Sciweavers

89 search results - page 1 / 18
» The Communication Complexity of Distributed Set-Joins with A...
Sort
View
WCE
2007
13 years 5 months ago
Sparse Matrix Multiplication Using UPC
—Partitioned global address space (PGAS) languages, such as Unified Parallel C (UPC) have the promise of being productive. Due to the shared address space view that they provide,...
Hoda El-Sayed, Eric Wright
PC
1998
196views Management» more  PC 1998»
13 years 4 months ago
DataExchange: High Performance Communications in Distributed Laboratories
Current communications tools and libraries for high performance computing are designed for platforms and applications that exhibit relatively stable computational and communicatio...
Greg Eisenhauer, Beth Plale, Karsten Schwan
ICC
2007
IEEE
136views Communications» more  ICC 2007»
13 years 11 months ago
Multiple-Symbol Differential Detection Based on Combinatorial Geometry
— In this paper, the application of combinatorial geometry to noncoherent multiple–symbol differential detection (MSDD) is considered. The resulting algorithm is referred to as...
Volker Pauli, Lutz H.-J. Lampe, Robert Schober, Ko...
AOSD
2007
ACM
13 years 8 months ago
Generating parallel applications for distributed memory systems using aspects, components, and patterns
Developing and debugging parallel programs particularly for distributed memory architectures is still a difficult task. The most popular approach to developing parallel programs f...
Purushotham V. Bangalore
CASCON
1997
85views Education» more  CASCON 1997»
13 years 6 months ago
Fast detection of communication patterns in distributed executions
Understanding distributed applications is a tedious and di cult task. Visualizations based on process-time diagrams are often used to obtain a better understanding of the executio...
Thomas Kunz, Michiel F. H. Seuren