ANALYSIS OF PARALLEL COMPUTING METHODS AND ALGORITHMS

Yusupova Janar; Davronov Murodjon; Choponov Otajon; Allayarov Shohzodbek,  Omonov Sardorbek

doi:10.5281/zenodo.8226125

Yusupova Janar, Davronov Murodjon, Choponov Otajon, Allayarov Shohzodbek, Omonov Sardorbek

Abstract. Parallel computing is the process of executing multiple sets of instructions simultaneously. This reduces the total time to compute. Parallelism can be achieved by using parallel computers, which are computers with a large number of processors. Parallel computers require an operating system that supports parallel algorithms, programming languages, compilers, and multiprocessing

Keywords: online judge, program, learning programming, online platforms, ACM ICPC

References:

1. GL Miller, R. Peng, and SC Xu. Parallel graph decompositions using random shifts. In SPAA, pages 196–203, 2013. 2. J. Reif. Optimal parallel algorithms for integer sorting and graph connectivity. TR-08-85, Harvard University, 1985. 3. Y. Shiloach and U. Vishkin. An O (log n) parallel connectivity algorithm. J. Algorithms, 1982. 4. Y. Gu, J. Shun, Y. Sun, and GE Blelloch. A top-down parallel semisort. In SPAA, 2015. 5. J.Yusupova, O.Choponov, Sh.Allayarov. “Parallel data testing on "online hakam" systems for programming students”. Science and innovation International scientific journal, pages 331-334, 2023. https://doi.org/10.5281/zenodo.8102514.