@techreport{oai:ipsj.ixsq.nii.ac.jp:00024615,
 author = {笠原, 博徳 and 本多, 弘樹 and Premchaiswadi, Wichian and 小椋, 章央 and 茂木, 章善 and 成田, 誠之助 and Hironori, Kasahara and Hiroki, Honda and Wichian, Premchaiswadi and Akio, Ogura and Akiyoshi, Mogi and Seinosuke, Narita},
 issue = {60(1990-ARC-083)},
 month = {Jul},
 note = {本論文ではマルチプロセッサシステムOSCAR　（__?ptimally　<Sc>___?heduled　A__?dvanced　Multiprocessor__?．）上での、細粒度タスクの並列処理手法について述べる。ここでOSCAR上での細粒度タスクとは各々が単一あるいは複数浮動小数点命令命令からなるタスクを意味する。本手法ではデータ転送を考慮したスタティックスケジューリングを用いることにより、同期及びデータ転送の最小化及び、各プロセッサのレジスタの最適使用が可能となる。本手法を用いたコンパイラはすでにOSCAR上にインプリメントされており、本論文では、OSCAR上での性能評価についても述べる。, This paper proposes a compilation scheme for parallel processing of near fine grain tasks, each of which consists of several operations or a statment. on a multiprocessor system called OSCAR(O__-ptimally <Sc>___-heduled A__-dvanced Multiprocessor__-). The scheme generates optimized parallel machine codes which minimize synchronization overhead and data transfer overhead and optimally use registers of each processor by using static multiprocessor scheduling algorithms considering data transfer among processors. This scheme can effectively be combined with compilation scheme for macro-dataflow computation which uses parallelism among coarse grain tasks like loops, basic blocks and subroutines and for the traditional loop concurrentization which use palallelism among medium grain tasks like iterations. A compiler using the proposed scheme has been implemented on OSCAR which has been designed to take full advantage of the static scheduling. In this paper the performance evaluation of the scheme on OSCAR is also described.},
 title = {OSCAR上での細粒度タスクの並列処理},
 year = {1990}
}