Highly concurrent scalar processing. Doctoral thesis
Technical Report
·
OSTI ID:5975786
High-speed scalar processing is an essential characteristic of high-performance general purpose computer systems. Efficient concurrent execution of scalar code is difficult due to data dependencies and conditional branches. This thesis proposes a code-scheduling heuristic called the decision tree scheduling (DTS) technique for general scalar code, and an optimal code scheduling algorithm called the simple loop scheduling (SLS) algorithm for a restricted class of innermost loops. Also proposed is a highly concurrent machine architecture that takes advantage of these scheduling techniques.
- Research Organization:
- Illinois Univ., Urbana (USA). Coordinated Science Lab.
- OSTI ID:
- 5975786
- Report Number(s):
- AD-A-163195/1/XAB; UILU-ENG-86-2203
- Country of Publication:
- United States
- Language:
- English
Similar Records
Super-scalar processor design
Development of a concurrent tree search program
Algorithms for scheduling and network problems. Doctoral thesis
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:5902890
Development of a concurrent tree search program
Technical Report
·
Fri Oct 01 00:00:00 EDT 1982
·
OSTI ID:7091838
Algorithms for scheduling and network problems. Doctoral thesis
Technical Report
·
Sun Sep 01 00:00:00 EDT 1991
·
OSTI ID:6098008