Solving problems on concurrent processors
Solving problems on concurrent processors
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
The iPSC/2 direct-connect communications technology
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
A hash-based join algorithm for a cube-connected parallel computer
Information Processing Letters
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Database Operations in a Cube-Connected Multicomputer System
IEEE Transactions on Computers
Performance Analysis of a Message-Oriented Knowledge-Base
IEEE Transactions on Computers
A parallel database-driven protocol verification system prototype
Software—Practice & Experience
Computational Complexity of Sorting and Joining Relations with Duplicates
IEEE Transactions on Knowledge and Data Engineering
Limiting Factors of Join Performance on Parallel Processors
Proceedings of the Fifth International Conference on Data Engineering
Parallel Sorting Methods for Large Data Volumes on a Hypercube Database Computer
IWDM '89 Proceedings of the Sixth International Workshop on Database Machines
Theory of Relational Databases
Theory of Relational Databases
On-Line Task Migration in Hypercubes Through Double Disjoint Paths
IEEE Transactions on Computers - Special issue on mobile computing
IEEE Transactions on Parallel and Distributed Systems
Site and Query Scheduling Policies in Multicomputer Database Systems
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
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.