This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Experimentation with Hypercube Database Engines
January/February 1992 (vol. 12 no. 1)
pp. 42-56

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.

Citation:
Ophir Frieder, Vijaykumar A. Topkar, Ramesh K. Karne, Arun K. Sood, "Experimentation with Hypercube Database Engines," IEEE Micro, vol. 12, no. 1, pp. 42-56, Jan.-Feb. 1992, doi:10.1109/40.124381
Usage of this product signifies your acceptance of the Terms of Use.