JPS6319905B2 - - Google Patents
Info
- Publication number
- JPS6319905B2 JPS6319905B2 JP57031194A JP3119482A JPS6319905B2 JP S6319905 B2 JPS6319905 B2 JP S6319905B2 JP 57031194 A JP57031194 A JP 57031194A JP 3119482 A JP3119482 A JP 3119482A JP S6319905 B2 JPS6319905 B2 JP S6319905B2
- Authority
- JP
- Japan
- Prior art keywords
- unit
- intermediate code
- processing
- vector
- parallel
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/40—Transformation of program code
- G06F8/41—Compilation
- G06F8/45—Exploiting coarse grain parallelism in compilation, i.e. parallelism between groups of instructions
Landscapes
- Engineering & Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Advance Control (AREA)
- Executing Machine-Instructions (AREA)
- Complex Calculations (AREA)
- Devices For Executing Special Programs (AREA)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP3119482A JPS58149566A (ja) | 1982-02-27 | 1982-02-27 | ベクトル演算の並列実行最適化処理方式 |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP3119482A JPS58149566A (ja) | 1982-02-27 | 1982-02-27 | ベクトル演算の並列実行最適化処理方式 |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| JPS58149566A JPS58149566A (ja) | 1983-09-05 |
| JPS6319905B2 true JPS6319905B2 (enrdf_load_stackoverflow) | 1988-04-25 |
Family
ID=12324609
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| JP3119482A Granted JPS58149566A (ja) | 1982-02-27 | 1982-02-27 | ベクトル演算の並列実行最適化処理方式 |
Country Status (1)
| Country | Link |
|---|---|
| JP (1) | JPS58149566A (enrdf_load_stackoverflow) |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS53108254A (en) * | 1977-03-02 | 1978-09-20 | Nec Corp | Information processor |
-
1982
- 1982-02-27 JP JP3119482A patent/JPS58149566A/ja active Granted
Also Published As
| Publication number | Publication date |
|---|---|
| JPS58149566A (ja) | 1983-09-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US5303357A (en) | Loop optimization system | |
| Kuck et al. | The Burroughs scientific processor (BSP) | |
| JP3311462B2 (ja) | コンパイル処理装置 | |
| US5339429A (en) | Parallel processing system and compiling method used therefor | |
| JPH0397059A (ja) | 並列プロセッサで処理する並列な命令ストリームを同期させる方法 | |
| JPH07319710A (ja) | コンパイル処理方法 | |
| JPS6319905B2 (enrdf_load_stackoverflow) | ||
| Hong et al. | The design of the SACLIB/PACLIB kernels | |
| JPH06103462B2 (ja) | ベクトル・レングス制御範囲分割処理方式 | |
| JPH0346863B2 (enrdf_load_stackoverflow) | ||
| Dhamdhere et al. | Characterization of program loops in code optimization | |
| JPH04307624A (ja) | ループ最適化方法及び装置 | |
| JPS58149567A (ja) | ベクトル・レングス制御範囲融合処理方式 | |
| JPH046020B2 (enrdf_load_stackoverflow) | ||
| JPS6319908B2 (enrdf_load_stackoverflow) | ||
| JPH0152779B2 (enrdf_load_stackoverflow) | ||
| JP3394353B2 (ja) | 機械語命令スケジューリング装置 | |
| Saucier et al. | Implementations of IF-statements in the TODOS microarchitecture synthesis system | |
| JPS6321946B2 (enrdf_load_stackoverflow) | ||
| Mason et al. | Optimizing irregular communication patterns in UNH C* | |
| JPH0512752B2 (enrdf_load_stackoverflow) | ||
| Uehara et al. | An automatic vectorizing/parallelizing Pascal compiler V-Pascal ver. 3 | |
| JPH037989B2 (enrdf_load_stackoverflow) | ||
| JPS59180669A (ja) | 領域不変ベクトルの割付方式 | |
| Hatcher et al. | C*-Linda: A programming environment with multiple data-parallel modules and parallel I/O |