On the Design and Analysis of Parallel and Distributed Algorithms

2023/11/10 by Rajendra Purohit, Purohit, Rajendra, K. R. Chowdhary +3
Computer Science · #Cloud Computing and Resource Management #Distributed #Distributed and Parallel Computing Systems #FOS: Computer and information sciences #Graph Theory and Algorithms #Parallel #and Cluster Computing (cs.DC)

paper · pdf · doi:10.48550/arxiv.2311.05857

openalex publication_date 2023/11/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Arrival of multicore systems has enforced a new scenario in computing, the parallel and distributed algorithms are fast replacing the older sequential algorithms, with many challenges of these techniques. The distributed algorithms provide distributed processing using distributed file systems and processing units, while network is modeled as minimum cost spanning tree. On the other hand, the parallel processing chooses different language platforms, data parallel vs. parallel programming, and GPUs. Processing units, memory elements and storage are connected through dynamic distributed networks in the form of spanning trees. The article presents foundational algorithms, analysis, and efficiency considerations.

Related

• Analysis of Distributed Algorithms for Big-data
• A Distributed Parallel Algorithm for Minimum Spanning Tree Problem
• The study of distributed computing algorithms by multithread applications
• Towards Parallel Computing on the Internet: Applications, Architectures, Models and Programming Tools
• A Study of Performance Programming of CPU, GPU accelerated Computers and SIMD Architecture