Analysis of Fork-Join Systems: Network of Queues with Precedence Constraints

by Samyukta Sethuraman

Overview

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

Product Details

ISBN-13:	9780367712648
Publisher:	CRC Press
Publication date:	10/09/2024
Series:	Emerging Operations Research Methodologies and Applications
Pages:	104
Product dimensions:	5.44(w) x 8.50(h) x (d)

About the Author

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.

Table of Contents

I. INTRODUCTION TO FORK-JOIN QUEUES. II. REVIEW OF LITERATURE ON FORK-JOIN QUEUES. III. SYMMETRIC n-DIMENSIONAL FORK-JOIN QUEUES. IV. COMPLEX FORK-JOIN QUEUEING NETWORKS.