Conference Papers

Permanent URI for this collectionhttps://idr.nitk.ac.in/handle/123456789/28506

Browse

Has files: NoSubject: search.filters.subject.Message Passing Interface (MPI)

Search Results

Now showing 1 - 2 of 2
  • No Thumbnail Available
    Item
    Enhancing Movie Recommendation Systems with MapReduce Genetic Algorithms: Addressing Scalability and Accuracy Challenges
    (Institute of Electrical and Electronics Engineers Inc., 2024) Patidar, P.; Posa, S.V.; Girish, K.K.; Rao, S.; Bhowmik, B.
    In the world of big data, the efficacy of movie recommendation systems is crucial for personalizing user experiences in digital entertainment. Traditional methods, including collaborative and content-based filtering, often encounter limitations such as data sparsity, cold start problems, and scalability issues. This paper introduces a novel approach that integrates MapReduce technology with Genetic Algorithms (GAs) to address these chal-lenges. Utilizing the Hadoop framework, our MapReduce Genetic Algorithm (MRGA) efficiently processes extensive datasets by distributing tasks across a cluster of machines. The genetic algorithm component optimizes recommendation accuracy through advanced techniques like selection, crossover, and mutation. Our experimental results, based on the MovieLens 100K dataset, demonstrate that the MRGA approach outperforms traditional collaborative filtering methods in terms of recommendation accuracy and scalability. By leveraging MapReduce's distributed computing power and the GA's optimization capabilities, this research offers a robust solution to improve movie recommendations and handle large-scale data efficiently. © 2024 IEEE.
  • No Thumbnail Available
    Item
    Performance Analysis and Predictive Modeling of MPI Collective Algorithms in Multi-Core Clusters: A Comparative Study
    (Institute of Electrical and Electronics Engineers Inc., 2025) Reddy, M.R.V.S.R.S.; Raju, S.R.; Girish, K.K.; Bhowmik, B.
    Efficient communication is the foundation of parallel computing systems, enabling seamless coordination across multiple processors for optimal performance. At the core of this communication lies the Message Passing Interface, a crucial framework designed to facilitate data exchange between processors through collective operations. However, these MPI operations often face challenges, including fluctuating process counts, varying message sizes, and increased communication overhead. These issues can significantly impact execution times and scalability, leading to potential bottlenecks in large-scale systems. To address these concerns, this paper provides an in-depth evaluation of key MPI collective algorithms - Flat Tree, Chain, and Binary Tree - by examining their performance under varying configurations. By analyzing execution times and communication overhead, the study reveals the trade-offs inherent in each algorithm, offering insights into strategies for reducing communication costs. Through this analysis, we aim to provide valuable guidance to improve the efficiency and scalability of parallel computing, particularly in high-performance systems where communication efficiency is critical. © 2025 IEEE.