Zobrazit v EDS

Extending the Migration from Asynchronous to Reactive Programming in Java: A Performance Analysis of Caching, CPU-Bound, and Blocking Scenarios.

Uloženo v:
Podrobná bibliografie
Název: Extending the Migration from Asynchronous to Reactive Programming in Java: A Performance Analysis of Caching, CPU-Bound, and Blocking Scenarios.
Autoři: Zbarcea, Andrei, Tudose, Cătălin, Boicea, Alexandru
Zdroj: Applied Sciences (2076-3417); Jan2026, Vol. 16 Issue 1, p90, 40p
Témata: DISTRIBUTED computing, SCALABILITY, SERVICE-oriented architecture (Computer science), CACHE memory, PARALLEL programming, REAL-time computing
Abstrakt: Modern distributed systems increasingly rely on reactive programming to meet the demands of high throughput and low latency under extreme concurrency. While the theoretical advantages of non-blocking I/O are well-established, empirical understanding of its behavior across heterogeneous enterprise workloads remains fragmented. This study presents a unified architectural evaluation of asynchronous (thread-per-request) and reactive (event-loop) paradigms within a functionally equivalent Java microservice environment. Unlike prior studies that isolate specific workloads, this research benchmarks the architectural crossover points across three distinct operational categories: distributed caching, CPU-bound processing, and blocking I/O, under loads up to 1000 concurrent users. The results quantify specific boundary conditions: the reactive model demonstrates superior elasticity in I/O-bound caching scenarios, achieving 75% higher throughput and 68% lower memory footprint. However, this advantage is strictly workload-dependent; both paradigms converge to an identical CPU wall at processor saturation, where the reactive model incurs a quantifiable latency penalty due to event-loop contention. Furthermore, under blocking conditions, the reactive model's memory efficiency (reducing footprint by ~50%) provides resilience against Out-Of-Memory (OOM) failures, even as throughput gains plateau. These findings move beyond generic performance comparisons to provide precise, data-driven guidelines for hybrid architectural adoption in complex distributed systems. [ABSTRACT FROM AUTHOR]
Copyright of Applied Sciences (2076-3417) is the property of MDPI and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Databáze: Complementary Index
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://resolver.ebscohost.com/openurl?sid=EBSCO:edb&genre=article&issn=20763417&ISBN=&volume=16&issue=1&date=20260101&spage=90&pages=90-129&title=Applied Sciences (2076-3417)&atitle=Extending%20the%20Migration%20from%20Asynchronous%20to%20Reactive%20Programming%20in%20Java%3A%20A%20Performance%20Analysis%20of%20Caching%2C%20CPU-Bound%2C%20and%20Blocking%20Scenarios.&aulast=Zbarcea%2C%20Andrei&id=DOI:10.3390/app16010090
    Name: Full Text Finder
    Category: fullText
    Text: Full Text Finder
    Icon: https://imageserver.ebscohost.com/branding/images/FTF.gif
    MouseOverText: Full Text Finder
  – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=Zbarcea%20A
    Name: ISI
    Category: fullText
    Text: Nájsť tento článok vo Web of Science
    Icon: https://imagesrvr.epnet.com/ls/20docs.gif
    MouseOverText: Nájsť tento článok vo Web of Science
Header DbId: edb
DbLabel: Complementary Index
An: 190819411
RelevancyScore: 1082
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 1082.40466308594
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Extending the Migration from Asynchronous to Reactive Programming in Java: A Performance Analysis of Caching, CPU-Bound, and Blocking Scenarios.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Zbarcea%2C+Andrei%22">Zbarcea, Andrei</searchLink><br /><searchLink fieldCode="AR" term="%22Tudose%2C+Cătălin%22">Tudose, Cătălin</searchLink><br /><searchLink fieldCode="AR" term="%22Boicea%2C+Alexandru%22">Boicea, Alexandru</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: Applied Sciences (2076-3417); Jan2026, Vol. 16 Issue 1, p90, 40p
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22DISTRIBUTED+computing%22">DISTRIBUTED computing</searchLink><br /><searchLink fieldCode="DE" term="%22SCALABILITY%22">SCALABILITY</searchLink><br /><searchLink fieldCode="DE" term="%22SERVICE-oriented+architecture+%28Computer+science%29%22">SERVICE-oriented architecture (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22CACHE+memory%22">CACHE memory</searchLink><br /><searchLink fieldCode="DE" term="%22PARALLEL+programming%22">PARALLEL programming</searchLink><br /><searchLink fieldCode="DE" term="%22REAL-time+computing%22">REAL-time computing</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Modern distributed systems increasingly rely on reactive programming to meet the demands of high throughput and low latency under extreme concurrency. While the theoretical advantages of non-blocking I/O are well-established, empirical understanding of its behavior across heterogeneous enterprise workloads remains fragmented. This study presents a unified architectural evaluation of asynchronous (thread-per-request) and reactive (event-loop) paradigms within a functionally equivalent Java microservice environment. Unlike prior studies that isolate specific workloads, this research benchmarks the architectural crossover points across three distinct operational categories: distributed caching, CPU-bound processing, and blocking I/O, under loads up to 1000 concurrent users. The results quantify specific boundary conditions: the reactive model demonstrates superior elasticity in I/O-bound caching scenarios, achieving 75% higher throughput and 68% lower memory footprint. However, this advantage is strictly workload-dependent; both paradigms converge to an identical CPU wall at processor saturation, where the reactive model incurs a quantifiable latency penalty due to event-loop contention. Furthermore, under blocking conditions, the reactive model's memory efficiency (reducing footprint by ~50%) provides resilience against Out-Of-Memory (OOM) failures, even as throughput gains plateau. These findings move beyond generic performance comparisons to provide precise, data-driven guidelines for hybrid architectural adoption in complex distributed systems. [ABSTRACT FROM AUTHOR]
– Name: Abstract
  Label:
  Group: Ab
  Data: <i>Copyright of Applied Sciences (2076-3417) is the property of MDPI and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edb&AN=190819411
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.3390/app16010090
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 40
        StartPage: 90
    Subjects:
      – SubjectFull: DISTRIBUTED computing
        Type: general
      – SubjectFull: SCALABILITY
        Type: general
      – SubjectFull: SERVICE-oriented architecture (Computer science)
        Type: general
      – SubjectFull: CACHE memory
        Type: general
      – SubjectFull: PARALLEL programming
        Type: general
      – SubjectFull: REAL-time computing
        Type: general
    Titles:
      – TitleFull: Extending the Migration from Asynchronous to Reactive Programming in Java: A Performance Analysis of Caching, CPU-Bound, and Blocking Scenarios.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Zbarcea, Andrei
      – PersonEntity:
          Name:
            NameFull: Tudose, Cătălin
      – PersonEntity:
          Name:
            NameFull: Boicea, Alexandru
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Text: Jan2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 20763417
          Numbering:
            – Type: volume
              Value: 16
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: Applied Sciences (2076-3417)
              Type: main
ResultId 1