@article{oai:mie-u.repo.nii.ac.jp:00005083,
 author = {MATSUBARA, Yoshikazu and 松原, 義和 and OYAMAGUCHI, Michio and 大山口, 通夫 and OHTA, Yoshikatsu and 太田, 義勝},
 journal = {Research reports of the Faculty of Engineering, Mie University},
 month = {Dec},
 note = {application/pdf, 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.},
 pages = {51--68},
 title = {Code Scheduling for Multi-Processor Systems},
 volume = {26},
 year = {2001}
}