A taxonomy of parallel sorting
ACM Computing Surveys (CSUR)
Parallel algorithms for the execution of relational database operations
ACM Transactions on Database Systems (TODS)
Distributed management in local area networks
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
Parallel join algorithms on a network of workstations
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
An Analytic/Empirical Study of Distributed Sorting on a Local Area Network
IEEE Transactions on Software Engineering
It’s elementary, my dear watson: time-optimal sorting algorithms on a completely overlapping network
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
We adapt several parallel sorting algorithms (block sorting algorithms) and distributed sorting algorithms for implementation on an Ethernet network with diskless Sun workstations. We argue that the performance of sorting algorithms on local area networks (LANs) should be analyzed in a manner that is different from the ways that parallel and distributed sorting algorithms are usually analyzed. Consequently, we propose an empirical approach which will provide more insight into the performance of the algorithms. We obtain data on communication time, local processing time, and response time (i.e. total running time) of each algorithm for various file sizes and different numbers of processors. Comparing the performance data with our theoretical analysis, we attempt to provide rationale for the behaviour of the algorithms and project the future behaviour of the algorithms as file size, number of processors, or interprocessor communication facilities change.