Reverse Scheduling Strategy For Vector Machines With Mutiple Pipeline Processing Units
| Autor: | Charlemagne Yue, 喻強 |
|---|---|
| Rok vydání: | 1995 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 83 In this paper, we take the concept of reverse scheduling strategy to discuss the scheduling problem of vector machines with multiple pipeline processing units. These machines support two kinds of parallelism: (1) concurrence processing of two independent tasks and (2) chaining of dependent vector tasks. Existing schedule methods only concern the former parallelism and fit the scheduling of scalar instructions. We now propose a strategy that can schedule a sequence of scalar and vector tasks represented by directed acyclic graphs (DAGs). This strategy considers parallelisms of the two types. It performs efficient scheduling in We prove that our strategy can perform optimal schedules in some special cases. We conduct simulation experiments for comparing our strategy with existing scheduling strategies. Results show that our strategy makes better use of multiple pipelines. It outperforms existing scheduling strategies in most cases. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|