Ranking and Closest Element Algorithms on Centralized Diamond Architecture

  • Authors

    • Masumeh Damrudi
    • Kamal Jadidy Aval
    2018-09-12
    https://doi.org/10.14419/ijet.v7i4.1.19480
  • closest element, diamond architecture, parallel, ranking, search.

  • Employing an appropriate algorithm, hardware and technique makes operations easier and faster in today digital world. Searching data which is a fundamental operation in computer science is an important problem in different Areas. An efficient algorithm is useful to search a data element in huge amount of data while information is growing in every second. There are various papers on searching algorithms to find data elements whereas different types of query in different areas of works including position, rank, count and closest element exists. Each of these queries may be useful in different computations. This paper proposed two algorithms of these four types of query employing Centralized Diamond architecture which consume constant execution time.

     

     

  • References

    1. [1] D. Eppstein, Z. Galil, "Parallel algorithmic techniques for combinational computation", Annual review of computer science, Vol. 3, No. 1, (1988), pp. 233-283.

      [2] R. Sarnath, X. He, "Efficient parallel algorithms for selection and searching on sorted matrices", Proceedings of Sixth International Parallel Processing Symposium, (1992), pp. 108-111.

      [3] K. A. Berman, J. L. Paul, Algorithms: sequential, parallel, and distributed, Course Technology Ptr, (2005).

      [4] K.T. Yar, N.S.S Aung, "The optimal running time from computational models by comparing two parallel searching procedures", IEEE International Workshop on Open-source Software for Scientific Computation (OSSC), (2009), pp. 73-78.

      [5] M. Damrudi, K. Jadidy Aval. "A Parallel Search on Hypercube Interconnection Network", Journal of Computer Science & Computational Mathematics, Vol.2, No. 1, (2012).

      [6] M. Damrudi, K. Jadidy Aval, "Searching data using centralize diamond architecture", Journal of Communication and Computer, Vol. 8, No. 9, (2011), pp. 807-811.

      [7] Masumeh, D. and A. Kamal Jadidy, Utilizing Centralized Diamond Architecture for Searching Algorithms. Journal of Physics: Conference Series, 2017. 892(1): p. 012001.

      [8] Akl, S.G., The design and analysis of parallel algorithms, Prentice-Hall, Inc. 401, (1989).

      [9] M. Damrudi, K.J. Aval, Diamond architecture with NOD sorting, IEEE Information Computing and Telecommunications, (2009).

      [10] M. Damrudi, K.J. Aval, A new parallel sorting on diamond architecture, Applied Electromagnetics, Wireless & Optical Communications (Electroscience '10), (2010)

  • Downloads

  • How to Cite

    Damrudi, M., & Jadidy Aval, K. (2018). Ranking and Closest Element Algorithms on Centralized Diamond Architecture. International Journal of Engineering & Technology, 7(4.1), 1-3. https://doi.org/10.14419/ijet.v7i4.1.19480