Task Scheduling in a Class of Pipelined Systems.
ILLINOIS UNIV URBANA COORDINATED SCIENCE LAB
Pagination or Media Count:
Statically configured, non-preemptive pipelines are investigated. These pipelines are shown to be equivalent to finite state machines. Each pipeline state corresponds to a compatibility class constructed from the allowed latencies of the pipeline. A basis for evaluating initiation strategies is developed. Several initiation strategies are described and compared. Closed form representation of the cycles resulting from the various strategies is obtained for several classes of pipelines. The complexity and effectiveness of the controllers of the various strategies are investigated. Conditions for which absolutely minimal cycles exist are developed. Pipelines for which all cycles from an arbitrary initial state are absolutely minimal are investigated. Author
- Computer Programming and Software
- Computer Hardware