Muutke küpsiste eelistusi

E-raamat: Analysis of Fork-Join Systems: Network of Queues with Precedence Constraints [Taylor & Francis e-raamat]

(Amazon.com)
Teised raamatud teemal:
  • Taylor & Francis e-raamat
  • Hind: 77,54 €*
  • * hind, mis tagab piiramatu üheaegsete kasutajate arvuga ligipääsu piiramatuks ajaks
  • Tavahind: 110,77 €
  • Säästad 30%
Analysis of Fork-Join Systems: Network of Queues with Precedence ConstraintsSuurem pilt
Teised raamatud teemal:
Taylor & Francis e-raamatudRohkem infot Taylor & Francis e-raamatute kohta
Raamatu kodulehekülg: https://www.taylorfrancis.com/books/9781003150077
With the boom of big data and machine learning and the subsequent need for parallel processing technologies, fork-join queues are more relevant now than ever before. In this book, new estimates of the average response time in fork-join queues are proposed, which form the basis for new research opportunities.

Analysis of Fork-Join Systems: Network of Queues with Precedence Constraints explores numerical approaches to estimate the average response time of fork-join queueing networks and offers never before published simple expressions for the mean response time as conjectures. Extensive experiments are included to demonstrate the remarkable accuracy of the conjectures and algorithms used in the estimation of the average response time.

Graduate students, professors, and researchers in the fields of operations research, management science, industrial engineering, computer science, and electrical engineering will find this book very useful. Students, as well as researchers in both academia and industry, will also find this book of great help when looking for results related to fork-join queues
List of Figures
xi
List of Tables
xiii
Preface xvii
Author Biography xix
Chapter 1 Basic Queueing Theory
1(8)
1.1 Discrete Single-Station Queueing Systems
1(1)
1.2 Kendall Notation
2(2)
1.3 Queueing System Performance
4(5)
1.3.1 Flow Conservation and Stability
4(1)
1.3.2 Performance Metrics
5(1)
1.3.3 Little's Law
6(1)
1.3.4 PASTA
6(3)
Chapter 2 Introduction to Fork-Join Queues
9(8)
2.1 Introduction
9(1)
2.2 Response Time In Fork-Join Queues
10(2)
2.3 Applications
12(3)
2.3.1 Parallel Computing
12(1)
2.3.2 Manufacturing Systems
13(1)
2.3.3 Health Care Systems
13(1)
2.3.4 Wireless Sensor Networks
14(1)
2.4 Organization
15(2)
Chapter 3 Literature Review
17(10)
3.1 Fork-Join Queueing Systems With A Single Level Of Tasks
17(6)
3.2 Generalized Fork-Join Queueing Systems
23(4)
Chapter 4 Symmetric n-Dimensional Fork-Join Queues
27(26)
4.1 System Definition
28(2)
4.2 Response Time Estimation
30(8)
4.2.1 Exponential Service Time Distribution
32(2)
4.2.2 General Service Time Distribution
34(2)
4.2.3 Numerical Examples
36(2)
4.3 Results And Comparisons
38(13)
4.3.1 Comparison with Simulations
39(1)
4.3.2 Approximation by Nelson and Tantawi
40(1)
4.3.3 Approximation by Varma and Makowski
41(2)
4.3.4 Approximation by Ko and Serfozo
43(1)
4.3.5 Approximation by Thomasian and Tantawi
44(7)
4.4 Conclusions
51(2)
Chapter 5 Relaxed Fork-Join Queueing Networks
53(20)
5.1 Symmetric Tandem Fork-Join Queueing Network
54(9)
5.1.1 Response Time Estimation
55(4)
5.1.2 Numerical Example
59(1)
5.1.3 Experimental Results
59(4)
5.2 Heterogeneous Fork-Join Queues
63(5)
5.2.1 System Definition
63(1)
5.2.2 Response Time Estimation
63(3)
5.2.3 Numerical Example and Results
66(2)
5.3 (n,k) Fork-Join Queues
68(2)
5.3.1 Comparison with Simulations
69(1)
5.4 Conclusions
70(3)
Bibliography 73(8)
Index 81
Samyukta Sethuraman is a Senior Research Scientist at Amazon. Her areas of expertise include queueing systems and pricing and yield management. Samyukta holds a Doctorate in Industrial Engineering from Texas A&M University and a Bachelors from Indian Institute of Technology (IIT) Madras. She serves on the advisory council of the Industrial & Systems Engineering Department at Texas A&M University. One of the focus areas of her doctoral thesis was fork-join queueing systems, which formed the basis of this work.
Püsilink: https://www.kriso.ee/db/9781003150077_pe.html
Märksõnad: