Code Scheduling for Multi-Processor Systems
スポンサーリンク
概要
- 論文の詳細を見る
This paper considers the scheduling problem of multi-processor systems under the condition that each processor is uniform and every instruction executes in one cycle. We propose two linear time scheduling algorithms which are respectively applicable to the two classes of dependence graphs, one of which consists of graphs with instructions of in-degree at most 2, and the other class of in-degree at most 3. We show that these algorithms produce optimal schedulings when these dependence graphs satisfy some more restricted conditions.
- Faculty of Engineering, Mie Universityの論文
- 2001-12-27
Faculty of Engineering, Mie University | 論文
- Approximate Method of Elastic Buckling Strength Analysis for Irregular Frames
- Elastic Buckling Strength of Steel Frames Connected to Core Wall
- Calculations of Energy Shift of the Conduction Band-Edge in Doped and Compensated GaP
- Estimation of the Glass Transition Pressure of Liquids under Very High Pressure by Viscoelastic Analysis
- Information Extraction from Electronic Mail