Approximating Fork-Join Systems via Mixed Model Transformations
Abstract
References
Index Terms
- Approximating Fork-Join Systems via Mixed Model Transformations
Recommendations
Large Fork-Join Queues with Nearly Deterministic Arrival and Service Times
In this paper, we study an N server fork-join queue with nearly deterministic arrival and service times. Specifically, we present a fluid limit for the maximum queue length as N→∞. This fluid limit depends on the initial number of tasks. In order to prove ...
Analysis of the Fork-Join Queue
A fork-join queue is considered as a typical model of parallel processing systems with arrival and departure synchronizations. An approach for obtaining the transient and the steady-state solutions of the fork-join queue in terms of the virtual waiting ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
- General Chairs:
- Simonetta Balsamo,
- William Knottenbelt,
- Program Chairs:
- Cristina L. Abad,
- Weiyi Shang
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
Acceptance Rates
Upcoming Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 127Total Downloads
- Downloads (Last 12 months)127
- Downloads (Last 6 weeks)17
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in