Abstract
Several parallel architectures exist in computer science literature. Motivated by the experimental overlapping connectivity network, we propose a new theoretical network called a completely overlapping network (CON). This network is an extension of the overlapping connectivity network with multiple buses. In this paper we investigate some properties of this network and demonstrate the use of CON and its usefulness by solving two toy problems: decimal number and one-digit binary number sortings.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anderson, T.E., Culler, D.E., Patterson, D.: A case for NOW (Networks of Workstations). IEEE Micro. 15(1), 54–64 (1995)
Kantabutra, S., Couch, A.: Parallel K-means clustering algorithm on NOWs. NECTEC Technical Journal 1(6) (January 2000)
Drozdowski, M., Wolniewicz, P.: Experiments with scheduling divisible tasks in clusters of workstations. In: Bode, A., Ludwig, T., Karl, W.C., Wismüller, R. (eds.) Euro-Par 2000. LNCS, vol. 1900, pp. 311–319. Springer, Heidelberg (2000)
Hamdi, M., Lee, C.K.: Dynamic load-balancing of image processing applications on clusters of workstations. Parallel Computing 22(11), 1477–1492 (1997)
Wilkinson, B.: On crossbar switch and multiple bus interconnection networks with overlapping connectivity. IEEE Transactions Computers 41, 738–746 (1992)
Wilkinson, B., Farmer, J.M.: Reflective interconnection networks. Computer and Electrical Engineering 20, 289–308 (1994)
Hoganson, K., Wilkinson, B., Carlisle, W.H.: Applications of rhombic multiprocessors. In: Proc. of the International Conference on Parallel and Distributed Processing Techniques and Applications (1997)
Schnorr, C., Shamir, A.: An optimal sorting algorithm for mesh connected computers. In: Proc. of the 18th ACM Symposium Theory Computing (1986)
Nassimi, D., Sahni, S.: Bitonicsort on a mesh connected parallel computer. IEEE Transactions on Computers c-28, 408–419 (1987)
Lang, H.W., Schimmler, M., Schmeck, H., Schroder, H.: Systolic sorting on a mesh-connected network. IEEE Transactions on Computers 34(7), 652–658 (1985)
Marberg, J.M., Gafni, E.: Sorting in constant number of row and column phases on a mesh. Algorithmica 3, 561–572 (1988)
Sasaki, A.: A time-optimal distributed sorting algorithm on a line network. Information Processing Letters 83 (2002)
Knuth, D.E.: The art of computer programming (sorting and searching), vol. 3. Addison-Wesley, Reading (1973)
Abali, B., Ozguner, F., Bataineh, A.: Balanced parallel sort on hypercube multiprocessors. IEEE Transactions 4, 572–581 (1993)
Varman, P.J., Doshi, K.: Sorting with linear speedup on a pipelined hypercube. IEEE Transactions 41, 97–103 (1992)
Tang, T.: Parallel sorting on the hypercube concurrent processor. In: Proc. of Distributed Memory Computing Conference, pp. 237–240 (1990)
Lan, Y., Mohamed, M.A.: Parallel quicksort in hypercubes. In: Proc. of the 1992 ACM/SIGAPP Symposium on Applied Computing (1992)
Gu, Q.P., Gu, J.: Algorithms and average time bounds of sorting on a mesh-connected computer. IEEE Transactions on Parallel and Distributed Systems 5, 308–315 (1994)
Andrea, C., Arpaci-Dusseau, R., Arpaci-Dusseau, H., Culler, D.E., Hellerstein, J.M., Patterson, D.: High performance sorting on networks of workstations. In: Proc. of the 1997 ACM SIGMOD International Conference on Management of Data, vol. 26 (1997)
Brest, J., Vreze, A., Zumer, B.: A sorting algorithm on a PC cluster. In: Proc. of the 2000 ACM Symposium on Applied Computing (March 2000)
Salehmonamed, M., Luk, W.S., Peters, J.G.: Performance evaluation of LAN sorting algorithms. In: ACM SIGMETRICS Conference on Meaurement and Modeling of Computer Systems, May 1987, vol. 15 (1987)
Luk, W.S., Ling, F.: An analytical/empirical study of distributed sorting on a local area network. IEEE Transactions on Software Engineering 15 (1989)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms. MIT Press, Cambridge (1990)
Leighton, F.T.: Introduction to parallel algorithms and architecture: arrays ∙ tree ∙ hypercube. Morgan Kaufmann, San Francisco (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kantabutra, S., Jindaluang, W., Techa-angkoon, P. (2005). It’s Elementary, My Dear Watson: Time-Optimal Sorting Algorithms on a Completely Overlapping Network. In: Pan, Y., Chen, D., Guo, M., Cao, J., Dongarra, J. (eds) Parallel and Distributed Processing and Applications. ISPA 2005. Lecture Notes in Computer Science, vol 3758. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11576235_30
Download citation
DOI: https://doi.org/10.1007/11576235_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29769-7
Online ISBN: 978-3-540-32100-2
eBook Packages: Computer ScienceComputer Science (R0)