Pages that link to "Item:Q1210481"
From MaRDI portal
The following pages link to Processing networks with parallel and sequential tasks: Heavy traffic analysis and Brownian limits (Q1210481):
Displaying 13 items.
- The trouble with diversity: Fork-join networks with heterogeneous customer population (Q1327602) (← links)
- Brownian models of open processing networks: Canonical representation of workload. (Q1578618) (← links)
- On positive recurrence of constrained diffusion processes (Q1872212) (← links)
- Heavy-traffic limits for an infinite-server fork-join queueing system with dependent and disruptive services (Q2360879) (← links)
- A fork-join queueing model: Diffusion approximation, integral representations and asymptotics (Q2564188) (← links)
- Gaussian limits for a fork-join network with nonexchangeable synchronization in heavy traffic (Q2806818) (← links)
- Response times in M/M/<i>s</i> fork-join networks (Q4662242) (← links)
- Control of Fork-Join Processing Networks with Multiple Job Types and Parallel Shared Resources (Q5085142) (← links)
- Large Fork-Join Queues with Nearly Deterministic Arrival and Service Times (Q5085144) (← links)
- On the Control of Fork-Join Networks (Q5219729) (← links)
- Robust scheduling for flexible processing networks (Q5233182) (← links)
- Workload Interpretation for Brownian Models of Stochastic Processing Networks (Q5388062) (← links)
- Tail asymptotics for the delay in a Brownian fork-join queue (Q6072902) (← links)
