Sciweavers

808 search results - page 5 / 162
» Data Communication and Parallel Computing on Twisted Hypercu...
Sort
View
ICPADS
1998
IEEE
13 years 11 months ago
An Optimal Routing Scheme for Multiple Broadcast
The dynamic broadcast problem is the communication problem where source packets to be broadcast to all the other nodes are generated at each node of a parallel computer accordingt...
Chi-Hsiang Yeh, Emmanouel A. Varvarigos, Hua Lee
ICPADS
2000
IEEE
13 years 11 months ago
Optimal Fault-Tolerant Routing in Hypercubes Using Extended Safety Vectors
1 Reliable communication in cube-based multicomputers using the extended safety vector concept is studied in this paper. In our approach, each node in a cube-based multicomputer o...
Jie Wu, Feng Gao, Zhongcheng Li, Yinghua Min
SC
1995
ACM
13 years 11 months ago
Communication Optimizations for Parallel Computing Using Data Access Information
Given the large communication overheads characteristic of modern parallel machines, optimizations that eliminate, hide or parallelize communication may improve the performance of ...
Martin C. Rinard
ICPP
2003
IEEE
14 years 23 days ago
Communication and Memory Optimal Parallel Data Cube Construction
Ruoming Jin, Ge Yang, Karthik Vaidyanathan, Gagan ...
PODC
2005
ACM
14 years 1 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder