Parallelizing Exponential Search Algorithms with MPI and CUDA for High-Performance Computing

Vedant Shreeyansh; Abhay S. Gad; B. Ashwath Rao; N. Gopalakrishna Kini

doi:10.1109/INCIP64058.2025.11019520

Parallelizing Exponential Search Algorithms with MPI and CUDA for High-Performance Computing

Vedant Shreeyansh
, Abhay S. Gad
, B. Ashwath Rao
, N. Gopalakrishna Kini

School of Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Citation (Scopus)

Abstract

Exponential search is an algorithm for searching unbounded taken care of lists. The exponential seek approach can be used to find the vicinity of a specified value in a taken care of array. Parallel index lookups in Exponential seek can enhance their performance, specifically for massive lists. This work provides an example of the exponential seek set of rules, which employ CUDA to enforce GPU parallelism and MPI to achieve parallel memories. We've mentioned a method to evaluate exponential studies and exhibit development in performance. The effects show that we can acquire relatively quicker outcomes than sequential techniques, specifically for big arrays.

Original language	English
Title of host publication	Proceedings - International Conference on Next Generation Communication and Information Processing, INCIP 2025
Editors	Mahipal Bukya, Pramod Kumar, Sanyog Rawat, Mahesh Jangid
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	285-288
Number of pages	4
ISBN (Electronic)	9798331528140
DOIs	https://doi.org/10.1109/INCIP64058.2025.11019520
Publication status	Published - 2025
Event	2025 International Conference on Next Generation Communication and Information Processing, INCIP 2025 - Bangalore, India Duration: 23-01-2025 → 24-01-2025

Publication series

Name	Proceedings - International Conference on Next Generation Communication and Information Processing, INCIP 2025

Conference

Conference	2025 International Conference on Next Generation Communication and Information Processing, INCIP 2025
Country/Territory	India
City	Bangalore
Period	23-01-25 → 24-01-25

All Science Journal Classification (ASJC) codes

Electrical and Electronic Engineering
Energy Engineering and Power Technology
Electronic, Optical and Magnetic Materials
Computer Networks and Communications
Computer Science Applications
Control and Systems Engineering

Access to Document

10.1109/INCIP64058.2025.11019520

Cite this

Shreeyansh, V., Gad, A. S., Rao, B. A., & Kini, N. G. (2025). Parallelizing Exponential Search Algorithms with MPI and CUDA for High-Performance Computing. In M. Bukya, P. Kumar, S. Rawat, & M. Jangid (Eds.), Proceedings - International Conference on Next Generation Communication and Information Processing, INCIP 2025 (pp. 285-288). (Proceedings - International Conference on Next Generation Communication and Information Processing, INCIP 2025). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/INCIP64058.2025.11019520

Shreeyansh, Vedant ; Gad, Abhay S. ; Rao, B. Ashwath et al. / Parallelizing Exponential Search Algorithms with MPI and CUDA for High-Performance Computing. Proceedings - International Conference on Next Generation Communication and Information Processing, INCIP 2025. editor / Mahipal Bukya ; Pramod Kumar ; Sanyog Rawat ; Mahesh Jangid. Institute of Electrical and Electronics Engineers Inc., 2025. pp. 285-288 (Proceedings - International Conference on Next Generation Communication and Information Processing, INCIP 2025).

@inproceedings{edfbe3552e014e16a0a610e86afa3468,

title = "Parallelizing Exponential Search Algorithms with MPI and CUDA for High-Performance Computing",

abstract = "Exponential search is an algorithm for searching unbounded taken care of lists. The exponential seek approach can be used to find the vicinity of a specified value in a taken care of array. Parallel index lookups in Exponential seek can enhance their performance, specifically for massive lists. This work provides an example of the exponential seek set of rules, which employ CUDA to enforce GPU parallelism and MPI to achieve parallel memories. We've mentioned a method to evaluate exponential studies and exhibit development in performance. The effects show that we can acquire relatively quicker outcomes than sequential techniques, specifically for big arrays.",

author = "Vedant Shreeyansh and Gad, \{Abhay S.\} and Rao, \{B. Ashwath\} and Kini, \{N. Gopalakrishna\}",

note = "Publisher Copyright: {\textcopyright} 2025 IEEE.; 2025 International Conference on Next Generation Communication and Information Processing, INCIP 2025 ; Conference date: 23-01-2025 Through 24-01-2025",

year = "2025",

doi = "10.1109/INCIP64058.2025.11019520",

language = "English",

series = "Proceedings - International Conference on Next Generation Communication and Information Processing, INCIP 2025",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "285--288",

editor = "Mahipal Bukya and Pramod Kumar and Sanyog Rawat and Mahesh Jangid",

booktitle = "Proceedings - International Conference on Next Generation Communication and Information Processing, INCIP 2025",

address = "United States",

}

Shreeyansh, V, Gad, AS, Rao, BA & Kini, NG 2025, Parallelizing Exponential Search Algorithms with MPI and CUDA for High-Performance Computing. in M Bukya, P Kumar, S Rawat & M Jangid (eds), Proceedings - International Conference on Next Generation Communication and Information Processing, INCIP 2025. Proceedings - International Conference on Next Generation Communication and Information Processing, INCIP 2025, Institute of Electrical and Electronics Engineers Inc., pp. 285-288, 2025 International Conference on Next Generation Communication and Information Processing, INCIP 2025, Bangalore, India, 23-01-25. https://doi.org/10.1109/INCIP64058.2025.11019520

Parallelizing Exponential Search Algorithms with MPI and CUDA for High-Performance Computing. / Shreeyansh, Vedant; Gad, Abhay S.; Rao, B. Ashwath et al.
Proceedings - International Conference on Next Generation Communication and Information Processing, INCIP 2025. ed. / Mahipal Bukya; Pramod Kumar; Sanyog Rawat; Mahesh Jangid. Institute of Electrical and Electronics Engineers Inc., 2025. p. 285-288 (Proceedings - International Conference on Next Generation Communication and Information Processing, INCIP 2025).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Parallelizing Exponential Search Algorithms with MPI and CUDA for High-Performance Computing

AU - Shreeyansh, Vedant

AU - Gad, Abhay S.

AU - Rao, B. Ashwath

AU - Kini, N. Gopalakrishna

PY - 2025

Y1 - 2025

N2 - Exponential search is an algorithm for searching unbounded taken care of lists. The exponential seek approach can be used to find the vicinity of a specified value in a taken care of array. Parallel index lookups in Exponential seek can enhance their performance, specifically for massive lists. This work provides an example of the exponential seek set of rules, which employ CUDA to enforce GPU parallelism and MPI to achieve parallel memories. We've mentioned a method to evaluate exponential studies and exhibit development in performance. The effects show that we can acquire relatively quicker outcomes than sequential techniques, specifically for big arrays.

AB - Exponential search is an algorithm for searching unbounded taken care of lists. The exponential seek approach can be used to find the vicinity of a specified value in a taken care of array. Parallel index lookups in Exponential seek can enhance their performance, specifically for massive lists. This work provides an example of the exponential seek set of rules, which employ CUDA to enforce GPU parallelism and MPI to achieve parallel memories. We've mentioned a method to evaluate exponential studies and exhibit development in performance. The effects show that we can acquire relatively quicker outcomes than sequential techniques, specifically for big arrays.

UR - https://www.scopus.com/pages/publications/105010194645

UR - https://www.scopus.com/pages/publications/105010194645#tab=citedBy

U2 - 10.1109/INCIP64058.2025.11019520

DO - 10.1109/INCIP64058.2025.11019520

M3 - Conference contribution

AN - SCOPUS:105010194645

T3 - Proceedings - International Conference on Next Generation Communication and Information Processing, INCIP 2025

SP - 285

EP - 288

BT - Proceedings - International Conference on Next Generation Communication and Information Processing, INCIP 2025

A2 - Bukya, Mahipal

A2 - Kumar, Pramod

A2 - Rawat, Sanyog

A2 - Jangid, Mahesh

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2025 International Conference on Next Generation Communication and Information Processing, INCIP 2025

Y2 - 23 January 2025 through 24 January 2025

ER -

Shreeyansh V, Gad AS, Rao BA , Kini NG. Parallelizing Exponential Search Algorithms with MPI and CUDA for High-Performance Computing. In Bukya M, Kumar P, Rawat S, Jangid M, editors, Proceedings - International Conference on Next Generation Communication and Information Processing, INCIP 2025. Institute of Electrical and Electronics Engineers Inc. 2025. p. 285-288. (Proceedings - International Conference on Next Generation Communication and Information Processing, INCIP 2025). doi: 10.1109/INCIP64058.2025.11019520

Parallelizing Exponential Search Algorithms with MPI and CUDA for High-Performance Computing

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this