Skip to main navigation Skip to search Skip to main content

A near-optimal & load balanced resilient system design for high-performance computing platform

  • Nilayam Kumar Kamila
  • , Subhendu Kumar Pani
  • , Rashmi Prava Das
  • , P. K. Bharti
  • , Hamid Esmaeili Najafabadi
  • , Mehdi Gheisari*
  • , Yang Liu*
  • *Corresponding author for this work
  • Shri Venkateshwara University
  • Biju Patnaik University of Technology
  • C. V. Raman College of Engineering
  • University of Calgary
  • Harbin Institute of Technology Shenzhen
  • Saveetha Institute of Medical and Technical Sciences (Deemed to be University)

Research output: Contribution to journalArticlepeer-review

Abstract

With the recent development and advancement of business growth models, information exchange has emerged as a critical component of computer communication technology. To serve dynamic business models with the latest data, most system architecture tends to retrieve data from back-end systems in real-time. Numerous leading organizations have started to think of or are implementing two different platforms: read cluster and write cluster. In this article, we propose a model that adopts a data streaming system and a data caching mechanism for faster access to real-time and non-real-time data. This system only focuses on providing the read data elements and reducing most of the load in the existing cluster(s). Our mathematical and simulation performance analysis shows a clear distinction and comparison between the current and proposed systems architecture.

Original languageEnglish
Pages (from-to)1535-1550
Number of pages16
JournalCluster Computing
Volume26
Issue number2
DOIs
StatePublished - Apr 2023
Externally publishedYes

Keywords

  • Data stream
  • High-performance computing
  • Near-optimal load
  • Optimized load balancing
  • Resilient system

Fingerprint

Dive into the research topics of 'A near-optimal & load balanced resilient system design for high-performance computing platform'. Together they form a unique fingerprint.

Cite this