Name
Abstract | ||
|---|---|---|
Using Intel's iPSC/2 hypercube, the authors measured the relationship between packet size, method of clustering messages, and internode traffic on the total sustained communication bandwidth. Having measured the costs associated with internode communication, they then analyzed duplicate removal algorithms. They also studied the effects of nonuniformly distributed attribute values and tuples across processors on three proposed duplicate removal algorithms. They chose algorithms to represent the several available in the literature and then evaluated the output collection time. The authors present a brief overview of the iPSC/2's hypercube message-passing system and discuss the results of their experimentation and analysis.<> |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1109/40.124381 | IEEE Micro |
Keywords | Field | DocType |
database management systems,hypercube networks,performance evaluation,special purpose computers,intel's ipsc/2 hypercube,clustering,database engines,hypercube,internode traffic,packet size | Tuple,Computer science,Parallel computing,Network packet,Communication bandwidth,Cluster analysis,Hypercube | Journal |
Volume | Issue | ISSN |
12 | 1 | 0272-1732 |
Citations | PageRank | References |
9 | 1.62 | 13 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ophir Frieder | 1 | 3300 | 419.55 |
| V. A. Topkar | 2 | 14 | 3.88 |
| Ramesh K. Karne | 3 | 9 | 1.62 |
| Arun K. Sood | 4 | 65 | 10.81 |