A new approach to schedule operations across nested-ifs and nested-loops
Journal
Microprocessing and Microprogramming
Journal Volume
41
Journal Issue
1
Pages
37-52
Date Issued
1995
Date
1995
Author(s)
Abstract
This paper presents a new global scheduling algorithm for automatic synthesis of the control blocks of special-purpose microprocessors. The main distinction of the proposed algorithm is that it exploits the inheritances of structured programs. The optimization goal is to maximize the speedup of the processor and minimize the size of the control block. If compared with existing global scheduling algorithms such as Trace scheduling, Tree compaction, and Percolation scheduling, the proposed algorithm consistently achieves better results in terms of the speedup of the processor and the size of the control block. © 1995.
Subjects
Control minimization; Fine-grain parallelism; Global mobility; Global scheduling; High-level synthesis
Other Subjects
Control minimization; Fine grain parallelism; Global mobility; Global scheduling; High level synthesis; Algorithms; Electric network synthesis; Optimization; Parallel processing systems; Microprocessor chips
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
04.pdf
Size
1.27 MB
Format
Adobe PDF
Checksum
(MD5):30e7b57c5a71a97292529d357bab0780