A PRODUCT FORM SOLUTION FOR TREE NETWORKS WITH DIVISIBLE LOADS

DOI10.1142/S0129626411000035zbMath1253.90082OpenAlexW2067687151MaRDI QIDQ3144912

Thomas G. Robertazzi

Publication date: 12 December 2012

Published in: Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129626411000035

zbMATH Keywords

queueing networksdivisible load schedulingproduct from solution

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Cites Work

• Unnamed Item
• Scheduling a divisible task in a two-dimensional toroidal mesh
• Scheduling divisible loads in a three-dimensional mesh of processors.
• Divisible load scheduling and Markov chain models
• Mean-Value Analysis of Closed Multichain Queuing Networks
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• Closed Queuing Systems with Exponential Servers
• Computational algorithms for closed queueing networks with exponential servers

This page was built for publication: A PRODUCT FORM SOLUTION FOR TREE NETWORKS WITH DIVISIBLE LOADS