December 2013 Reducing response time in fork-join systems under heavy traffic via imbalance control
Saul C. Leite, Marcelo D. Fragoso
Author Affiliations +
Adv. in Appl. Probab. 45(4): 1137-1156 (December 2013). DOI: 10.1239/aap/1386857861

Abstract

We consider the problem of reducing the response time of fork-join systems by maintaining the workload balanced among the processing stations. The general problem of modeling and finding an optimal policy that reduces imbalance is quite difficult. In order to circumvent this difficulty, the heavy traffic approach is taken, and the system dynamics are approximated by a reflected diffusion process. This way, the problem of finding an optimal balancing policy that reduces workload imbalance is set as a stochastic optimal control problem, for which numerical methods are available. Some numerical experiments are presented, where the control problem is solved numerically and applied to a simulation. The results indicate that the response time of the controlled system is reduced significantly using the devised control.

Citation

Download Citation

Saul C. Leite. Marcelo D. Fragoso. "Reducing response time in fork-join systems under heavy traffic via imbalance control." Adv. in Appl. Probab. 45 (4) 1137 - 1156, December 2013. https://doi.org/10.1239/aap/1386857861

Information

Published: December 2013
First available in Project Euclid: 12 December 2013

zbMATH: 1290.60091
MathSciNet: MR3161300
Digital Object Identifier: 10.1239/aap/1386857861

Subjects:
Primary: 60K25
Secondary: 93E20

Keywords: heavy traffic analysis , parallel system , Queueing theory

Rights: Copyright © 2013 Applied Probability Trust

JOURNAL ARTICLE
20 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

Vol.45 • No. 4 • December 2013
Back to Top