JPS58149569A - スカラ配列化による並列化処理方式 - Google Patents

スカラ配列化による並列化処理方式

Info

Publication number
JPS58149569A
JPS58149569A JP3119782A JP3119782A JPS58149569A JP S58149569 A JPS58149569 A JP S58149569A JP 3119782 A JP3119782 A JP 3119782A JP 3119782 A JP3119782 A JP 3119782A JP S58149569 A JPS58149569 A JP S58149569A
Authority
JP
Japan
Prior art keywords
program
intermediate code
loop
section
existence
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.)
Granted
Application number
JP3119782A
Other languages
English (en)
Japanese (ja)
Other versions
JPS6319908B2 (GUID-C5D7CC26-194C-43D0-91A1-9AE8C70A9BFF.html
Inventor
Yukio Kamiya
幸男 神谷
Koichiro Hotta
耕一郎 堀田
Masaaki Takiuchi
滝内　政昭
Toshihiro Hirabayashi
平林　俊弘
Masaki Aoki
正樹 青木
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Fujitsu Ltd
Original Assignee
Fujitsu Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Fujitsu Ltd filed Critical Fujitsu Ltd
Priority to JP3119782A priority Critical patent/JPS58149569A/ja
Publication of JPS58149569A publication Critical patent/JPS58149569A/ja
Publication of JPS6319908B2 publication Critical patent/JPS6319908B2/ja
Granted legal-status Critical Current

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)
JP3119782A 1982-02-27 1982-02-27 スカラ配列化による並列化処理方式 Granted JPS58149569A (ja)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP3119782A JPS58149569A (ja) 1982-02-27 1982-02-27 スカラ配列化による並列化処理方式

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP3119782A JPS58149569A (ja) 1982-02-27 1982-02-27 スカラ配列化による並列化処理方式

Publications (2)

Publication Number Publication Date
JPS58149569A true JPS58149569A (ja) 1983-09-05
JPS6319908B2 JPS6319908B2 (GUID-C5D7CC26-194C-43D0-91A1-9AE8C70A9BFF.html) 1988-04-25

Family

ID=12324690

Family Applications (1)

Application Number Title Priority Date Filing Date
JP3119782A Granted JPS58149569A (ja) 1982-02-27 1982-02-27 スカラ配列化による並列化処理方式

Country Status (1)

Country Link
JP (1) JPS58149569A (GUID-C5D7CC26-194C-43D0-91A1-9AE8C70A9BFF.html)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5640568A (en) * 1993-11-26 1997-06-17 International Business Machines Corporation Inline expansion method for programming languages having array functions

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5640568A (en) * 1993-11-26 1997-06-17 International Business Machines Corporation Inline expansion method for programming languages having array functions

Also Published As

Publication number Publication date
JPS6319908B2 (GUID-C5D7CC26-194C-43D0-91A1-9AE8C70A9BFF.html) 1988-04-25

Similar Documents

Publication Publication Date Title
US4710872A (en) Method for vectorizing and executing on an SIMD machine outer loops in the presence of recurrent inner loops
US5852734A (en) Method and compiler for parallel execution of a program
Payne et al. An algorithm for constructing optimal binary decision trees
US6550059B1 (en) Method for generating optimized vector instructions from high level programming languages
JP2500079B2 (ja) プログラムの最適化方法及びコンパイラ・システム
US5418958A (en) Register allocation by decomposing, re-connecting and coloring hierarchical program regions
JPH03172936A (ja) 手順間レジスタ割付けを伴うコンピュータプログラムのコンパイル方法及び装置
Levine et al. A comparative study of automatic vectorizing compilers
Granston et al. Detecting redundant accesses to array data
JPH04503416A (ja) データフローマルチプロセサシステム
US5367684A (en) Register allocation using an improved register candidate usage matrix
US4853872A (en) Program execution method in a system having plural computers
JP3261239B2 (ja) データ転送の一括化処理方法
Nicolau Loop quantization: A generalized loop unwinding technique
JPS58149569A (ja) スカラ配列化による並列化処理方式
Jouvelot et al. Communication effects for message-based concurrency
Li PARALLEL PROCESSING OF COMBINATORIAL SEARCH PROBLEMS (DIVIDE-AND-CONQUER, BRANCH-AND-BOUND, LOGIC PROGRAMMING, DYNAMIC)
JPH0346863B2 (GUID-C5D7CC26-194C-43D0-91A1-9AE8C70A9BFF.html)
JPH037989B2 (GUID-C5D7CC26-194C-43D0-91A1-9AE8C70A9BFF.html)
JPS58149565A (ja) ベクトル・レングス制御範囲分割処理方式
Couturier et al. Bicolored independent sets and bicliques
Uribe-Hurtado et al. Dynamic time warping dissimilarity matrices
JPS58149567A (ja) ベクトル・レングス制御範囲融合処理方式
JPS6321946B2 (GUID-C5D7CC26-194C-43D0-91A1-9AE8C70A9BFF.html)
Hluchy et al. Solving method for optimal load balancing and communication minimization