Bounded Scheduling of Process Networks

Parks, T. M. (1995). Bounded Scheduling of Process Networks.

Type

Report

Intellectual base

Grey literature

Year

1995

Link

https://ptolemy.berkeley.edu/papers/95/parksThesis/

Cited by

1 citation across 1 artifact.

Domain-specific

• Kahn Process Networks
  • Parks shows that termination and bounded-buffer questions are undecidable in general and develops bounded scheduling strategies; naively making writes block can introduce artificial deadlock.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:152d62268d86 · see in the full table