A taxonomy of parallel sorting
ACM Computing Surveys (CSUR)
An Empirical Study of Distributed Application Performance
IEEE Transactions on Software Engineering
File access performance of diskless workstations
ACM Transactions on Computer Systems (TOCS)
Load balancing in a locally distributed DB system
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Performance evaluation of LAN sorting algorithms
SIGMETRICS '87 Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems
VAXcluster: a closely-coupled distributed system
ACM Transactions on Computer Systems (TOCS)
Distributed management in local area networks
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Measured performance of an Ethernet local network
Communications of the ACM
A Study of Sort Algorithms for Multiprocessor Database Machines
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Parallel join algorithms on a network of workstations
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
A time-optimal distributed sorting algorithm on a line network
Information Processing Letters
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 |
A model for distributed sorting on a local area network (LAN) is presented. This model, contrary to the conventional model, takes into account both local processing time and communication time. This model is intended to provide a framework within which the performances of various distributed sorting algorithms are analyzed and implemented on Ethernet-connected Sun workstations. The empirical results by and large agree with the predictions derivable from the model. They show that local processing, particularly sorting of local subfiles, dominates the whole process, as far as response time is concerned. All algorithms examined have similar asymptotic behavior for large files. For medium-sized files, the degree of communication parallelism has a great impact on algorithm performance.