2020/02/04 by Erhun Özkan, Ozkan, Erhun
Business, Management and Accounting · Computer Science · #60F17 #60K25 #90B22 #90B36 #93E20 #Advanced Queuing Theory Analysis #Age of Information Optimization #FOS: Mathematics #Optimization and Control (math.OC) #Petri Nets in System Modeling #Probability (math.PR)
paper · pdf · doi:10.48550/arxiv.2002.01496
openalex publication_date 2020/02/04 · openalex created_date 2022/07/26 · openalex updated_date 2026/07/28
A fork-join processing network is a queueing network in which tasks\nassociated with a job can be processed simultaneously. Fork-join processing\nnetworks are prevalent in computer systems, healthcare, manufacturing, project\nmanagement, justice system, etc. Unlike the conventional queueing networks,\nfork-join processing networks have synchronization constraints that arise due\nto the parallel processing of tasks and can cause significant job delays. We\nstudy scheduling control in fork-join processing networks with multiple job\ntypes and parallel shared resources. Jobs arriving in the system fork into\narbitrary number of tasks, then those tasks are processed in parallel, and then\nthey join and leave the network. There are shared resources processing multiple\njob types. We study the scheduling problem for those shared resources (that is,\nwhich type of job to prioritize at any given time) and propose an\nasymptotically optimal scheduling policy in diffusion scale.\n