Abstract
The efficient parallel mapping of numerical problems (over different parallel architectures) is necessary for fast execution of massive data. In fact, it is a challenging task and significant ongoing subject of research. The Bi Swapped Network (BSN) is recently reported 2-level hybrid and symmetrical optoelectronic network architecture, offer major improvements especially for drawbacks aroused due to the asymmetrical behavior of the well known swapped/OTIS network. In this paper, the efficient parallel mapping of binomial function (special cases: Taylor series and Negative Binomial Series) of 2n4 + 1 terms is presented on n × n Bi Swapped Network mesh in 2T + 24(n − 1) electronic and 8 optical moves, Here, we assume T is the time required to compute parallel prefix for each identical cluster (mesh).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Akl, S.G.: The Design and Analysis of Parallel Algorithms. Prentice-Hall, Englewood Cliffs (1989)
Ladner, R.E., Fischer, M.J.: Parallel prefix computation. J. Assoc. Comput. Mach. 27(4), 831–838 (1980)
Horowitz, E., Sahnp, S., Rajasekaran, S.: Fundamentals of Computer Algorithms. Galgotia Publications Pvt. Ltd., Delhi (1998)
Parhami, B.: Introduction to Parallel Processing: Algorithms and Architectures, 1st edn. Springer, Heidelberg (1999). https://doi.org/10.1007/b116777
Grama, A., Karypis, G., Kumar, V., Gupta, A.: Introduction to Parallel Computinc, 2nd edn. Addison Wesley, Boston (2003)
Jha, S.K.: An improved parallel prefix computation on 2D mesh network. In: Interntional Conference of Computational Intelligence: Modelinc, Tehniques and Applications (CIMTA) (2013)
Xiao, W., Chen, W., He, M., Wei, W., Parhamp, B.: Biswapped network and their topological properties. In: Proceedings-Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, pp. 193–198 (2007)
Wei, W., Xiao, W.: Matrix multiplication on the biswapped-mesh network. In: Proceedings Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, pp. 211–215 (2007)
Ye, H., Xiao, W., Wu, J.: Broadcasting on the BSN-hypercube network. In: 2009 Second International Conference on Information and Computing Science, vol. 01, pp. 167–170 (2009)
Wei, W., Xiao, W.: Fault tolerance in the biswapped network. In: Bourgeois, A.G., Zheng, S.Q. (eds.) ICA3PP 2008. LNCS, vol. 5022, pp. 79–82. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-69501-1_10
Wei, W., Xiao, W.: Algorithms of basic communication operation on the biswapped network. In: Bubak, M., van Albada, G.D., Dongarra, J., Sloot, Peter M.A. (eds.) ICCS 2008. LNCS, vol. 5101, pp. 347–354. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-69384-0_40
Wei, W., Xiao, W.: Efficient parallel algorithm for sorting on the biswapped network. J. Comput. Infor. Syst. 4(4), 1365–1370 (2008)
Yu, Y., Wei, W.: Load balancing on the biswapped network. In: Proceedings of the 2nd International Conference on Intelligent Networks and Intelligent Systems, pp. 146–149 (2009)
Wei, W., Li, Y.: Load balancing on heterogeneous biswapped network. In: 3rd International Symposium on Electronic Commerce and Security, IEEE CS, pp. 253–256 (2010)
Wei, W., Li, Y.: Fault-tolerant routing algorithm for BSN-hypercube using unsafety vectors. J. Comput. Inf. Syst. 1(2), 623–630 (2011)
Gupta, A.: Parallel algorithm for binomial series (special cases) using mesh architecture. In: 2nd IEEE International Conference on Parallel, Distributed and Grid Computing (PDGC), Solan, pp. 153–157 (2012)
Xiao, W., Parhami, B., Chen, W., He, M., Wei, W.: Biswapped networks: a family of interconnection architectures with advantages over swapped or OTIS networks. Int. J. Comput. Math. 88(13), 2669–2684 (2011)
Wei, W., Li, Q., Tao, M.: Parallel prefix algorithm on BSN-mesh. In: Fourth International Conference on Emerging Intelligent Data and Web Technologies, pp. 46–50 (2013)
Zhao, C.: Efficient load balancing on biswapped networks. Cluster Comput. 17(2), 403–411 (2014)
Linc, S., Chen, W.: Node-to-set disjoint paths in bi-swapped networks. Comput. J. 57(7), 953–967 (2014)
Wei, W., Li, Q., Tao, M.: BSN-mesh and its basic parallel algorithms. Int. J. Grid Util. Comput. 6(¾), 213–220 (2015)
Sun, L., Tonc, C.: Basic operations on BSN-hypercube multiprocessors. J. Comput. Inf. Syst. 10(12), 5211–5218 (2014)
Gupta, A., Sarkar, B.K.: A new parallel approach for prefix sum on Bi Swapped Network mesh. In: IEEE 2nd International Conference on Next Generation Computing Technologies, pp. 393–396 (2016)
Gupta, A., Sarkar, B.K.: Parallel algorithm for LaGrange’s interpolation on BSN-mesh. In: Singh, R., Choudhury, S. (eds.) Proceeding of International Conference on Intelligent Communication, Control and Devices. Advances in Intelligent Systems and Computing, vol. 479, pp. 673–682. Springer, Singapore (2017). https://doi.org/10.1007/978-981-10-1708-7_77
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Gupta, A., Sarkar, B.K. (2018). An Efficient Parallel Approach for Mapping Finite Binomial Series (Special Cases) on Bi Swapped Network Mesh. In: Bhattacharyya, P., Sastry, H., Marriboyina, V., Sharma, R. (eds) Smart and Innovative Trends in Next Generation Computing Technologies. NGCT 2017. Communications in Computer and Information Science, vol 827. Springer, Singapore. https://doi.org/10.1007/978-981-10-8657-1_20
Download citation
DOI: https://doi.org/10.1007/978-981-10-8657-1_20
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-8656-4
Online ISBN: 978-981-10-8657-1
eBook Packages: Computer ScienceComputer Science (R0)