Processing Networks with Parallel and Sequential Tasks: Heavy Traffic Analysis and Brownian Limits

@inproceedings{Nguyen1993ProcessingNW,
  title={Processing Networks with Parallel and Sequential Tasks: Heavy Traffic Analysis and Brownian Limits},
  author={Vi{\^e}n Nguyen},
  year={1993}
}

Citations

Publications citing this paper.
SHOWING 1-10 OF 30 CITATIONS

Large fork-join networks with nearly deterministic service times

VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Communication-Aware Scheduling of Serial Tasks for Dispersed Computing

Power control in saturated fork-join queueing systems

VIEW 2 EXCERPTS
CITES BACKGROUND & METHODS

Dynamic Control of the Join-Queue Lengths in Saturated Fork-Join Stations

VIEW 3 EXCERPTS
CITES METHODS & BACKGROUND

Gaussian Limits for a Fork-Join Network with Nonexchangeable Synchronization in Heavy Traffic

VIEW 2 EXCERPTS
CITES BACKGROUND