Analysis of Fork-Join Systems
eBook - ePub

Analysis of Fork-Join Systems

Network of Queues with Precedence Constraints

  1. 104 pages
  2. English
  3. ePUB (mobile friendly)
  4. Available on iOS & Android
eBook - ePub

Analysis of Fork-Join Systems

Network of Queues with Precedence Constraints

About this book

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

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
No, books cannot be downloaded as external files, such as PDFs, for use outside of Perlego. However, you can download books within the Perlego app for offline reading on mobile or tablet. Learn more here.
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access Analysis of Fork-Join Systems by Samyukta Sethuraman in PDF and/or ePUB format, as well as other popular books in Mathematics & Industrial Engineering. We have over one million books available in our catalogue for you to explore.

Information

Publisher
CRC Press
Year
2022
Print ISBN
9780367712631
eBook ISBN
9781000570816

Table of contents

  1. Cover Page
  2. Half-Title Page
  3. Series Page
  4. Title Page
  5. Copyright Page
  6. Dedication Page
  7. Contents
  8. List of Figures
  9. List of Tables
  10. Preface
  11. Author Biography
  12. Chapter 1 ◾ Basic Queueing Theory
  13. Chapter 2 ◾ Introduction to Fork-Join Queues
  14. Chapter 3 ◾ Literature Review
  15. Chapter 4 ◾ Symmetric n-Dimensional Fork-Join Queues
  16. Chapter 5 ◾ Relaxed Fork-Join Queueing Networks
  17. Bibliography
  18. Index