@article{oai:sucra.repo.nii.ac.jp:00014343,
 author = {伊藤, 和人},
 issue = {3},
 journal = {IEICE transactions on fundamentals of electronics, communications and computer sciences},
 month = {},
 note = {http://search.ieice.org/index.html | http://search.ieice.org/index.html, One of the ways to execute a processing algorithm in high speed is parallel processing on multiple computing resources such as processors and functional units. To identify the minimum number of computing resources, the most important is the scheduling to determine when each operation in the processing algorithm is executed. Among feasible schedules satisfying all the data dependencies in the processing algorithm, an overlapped schedule can achieve the fastest execution speed for an iterative processing algorithm. In the case of processing algorithms with operations which are executed on some conditions, computing resources can be shared by those conditional operations. In this paper, we propose a scheduling method which derives an overlapped schedule where the required number of computing resources is minimized by considering the sharing by conditional operations., copyright(c)1998 
IEICE許諾番号：08RB0009, text, application/pdf},
 pages = {429--438},
 title = {An Overlapped Scheduling Method for an Iterative Processing Algorithm with Conditional Operations},
 volume = {E81-A},
 year = {1998},
 yomi = {イトウ, カズヒト}
}