Publication: Control of fork-join processing networks with multiple job types and parallel shared resources
Files
Program
KU-Authors
KU Authors
Co-Authors
Publication Date
Language
Type
Embargo Status
NO
Journal Title
Journal ISSN
Volume Title
Alternative Title
Abstract
A fork-join processing network is a queueing network in which tasks associated with a job can be processed simultaneously. Fork-join processing networks are prevalent in computer systems, healthcare, manufacturing, project management, justice systems, and so on. Unlike the conventional queueing networks, fork-join processing networks have synchronization constraints that arise because of the parallel processing of tasks and can cause significant job delays. We study scheduling in fork-join processing networks with multiple job types and parallel shared resources. Jobs arriving in the system fork into arbitrary number of tasks, then those tasks are processed in parallel, and then they join and leave the network. There are shared resources processing multiple job types. We study the scheduling problem for those shared resources (i.e., which type of job to prioritize at any given time) and propose an asymptotically optimal scheduling policy in diffusion scale.
Source
Publisher
The Institute for Operations Research and the Management Sciences (INFORMS)
Subject
Operations research and management science, Applied mathematics
Citation
Has Part
Source
Mathematics of Operations Research
Book Series Title
Edition
DOI
10.1287/moor.2021.1170