JPS588359A - 還元プロセサの同時処理回路網および処理方法 - Google Patents

還元プロセサの同時処理回路網および処理方法

Info

Publication number
JPS588359A
JPS588359A JP57101268A JP10126882A JPS588359A JP S588359 A JPS588359 A JP S588359A JP 57101268 A JP57101268 A JP 57101268A JP 10126882 A JP10126882 A JP 10126882A JP S588359 A JPS588359 A JP S588359A
Authority
JP
Japan
Prior art keywords
storage means
processor
cell
message
nodes
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
JP57101268A
Other languages
English (en)
Japanese (ja)
Other versions
JPH0253811B2 (enExample
Inventor
カ−ル・フレドリツク・ハ−ゲンマイヤ−・ジユニア
ゲアリ・リ−・ロツグスドン
ブレント・セシル・ボルトン
ロバ−ト・ロ−レンス・マイナ−・ジユニア
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.)
Unisys Corp
Original Assignee
Burroughs Corp
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 Burroughs Corp filed Critical Burroughs Corp
Publication of JPS588359A publication Critical patent/JPS588359A/ja
Publication of JPH0253811B2 publication Critical patent/JPH0253811B2/ja
Granted legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
    • G06F15/163—Interprocessor communication
    • G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
    • G06F15/17337—Direct connection machines, e.g. completely connected computers, point to point communication networks
    • G06F15/17343—Direct connection machines, e.g. completely connected computers, point to point communication networks wherein the interconnection is dynamically configurable, e.g. having loosely coupled nearest neighbor architecture
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44—Arrangements for executing specific programs
    • G06F9/448—Execution paradigms, e.g. implementations of programming paradigms
    • G06F9/4494—Execution paradigms, e.g. implementations of programming paradigms data driven

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Devices For Executing Special Programs (AREA)
  • Multi Processors (AREA)
JP57101268A 1981-07-07 1982-06-11 還元プロセサの同時処理回路網および処理方法 Granted JPS588359A (ja)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US28106581A 1981-07-07 1981-07-07
US281065 1981-07-07

Publications (2)

Publication Number Publication Date
JPS588359A true JPS588359A (ja) 1983-01-18
JPH0253811B2 JPH0253811B2 (enExample) 1990-11-19

Family

ID=23075796

Family Applications (1)

Application Number Title Priority Date Filing Date
JP57101268A Granted JPS588359A (ja) 1981-07-07 1982-06-11 還元プロセサの同時処理回路網および処理方法

Country Status (3)

Country Link
EP (1) EP0069314B1 (enExample)
JP (1) JPS588359A (enExample)
DE (1) DE3276971D1 (enExample)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS60184666U (ja) * 1984-05-17 1985-12-07 株式会社　丹下紙工品製作所 製本の構造体

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4498133A (en) * 1981-12-10 1985-02-05 Burroughs Corp. Selector switch for a concurrent network of processors
US4482996A (en) * 1982-09-02 1984-11-13 Burroughs Corporation Five port module as a node in an asynchronous speed independent network of concurrent processors
US4734848A (en) * 1984-07-17 1988-03-29 Hitachi, Ltd. Combination reduction processing method and apparatus

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS50120746A (enExample) * 1974-02-28 1975-09-22

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4307446A (en) * 1979-05-02 1981-12-22 Burroughs Corporation Digital communication networks employing speed independent switches

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS50120746A (enExample) * 1974-02-28 1975-09-22

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS60184666U (ja) * 1984-05-17 1985-12-07 株式会社　丹下紙工品製作所 製本の構造体

Also Published As

Publication number Publication date
EP0069314B1 (en) 1987-08-12
EP0069314A2 (en) 1983-01-12
EP0069314A3 (en) 1983-03-30
DE3276971D1 (en) 1987-09-17
JPH0253811B2 (enExample) 1990-11-19

Similar Documents

Publication Publication Date Title
EP0069313B1 (en) Reduction processor for executing programs stored as treelike graphs employing variable-free applicative language codes
McCarthy et al. LISP 1.5 programmer's manual
US4502118A (en) Concurrent network of reduction processors for executing programs stored as treelike graphs employing variable-free applicative language codes
Foderaro et al. The FRANZ Lisp Manual
US9298437B2 (en) Unrolling quantifications to control in-degree and/or out-degree of automaton
CN101957743A (zh) 并行数字信号处理器
US20080126757A1 (en) Cellular engine for a data processing system
ul Rojas Conditional branching is not necessary for universal computation in von Neumann computers
US4654780A (en) Parallel register transfer mechanism for a reduction processor evaluating programs stored as binary directed graphs employing variable-free applicative language codes
US4611278A (en) Wraparound buffer for repetitive decimal numeric operations
EP0069314B1 (en) A concurrent network of reduction processors for executing programs stored as treelike graphs employing vaiable-free applicative language codes
US5099450A (en) Computer for reducing lambda calculus expressions employing variable containing applicative language code
RU2066067C1 (ru) Центральный процессор для многопроцессорной вычислительной системы
JPH034936B2 (enExample)
US4575795A (en) Apparatus for detecting a predetermined character of a data string
Griswold et al. Reference manual for the Icon programming language
Hoevel et al. The Structure of Directly Executed Languages: A New Theory of Interpretive System Design.
CA1210156A (en) Concurrent network of reduction processors for executing programs stored as treelike graphs employing variable-free applicative language codes
Okuno et al. TAO: A fast interpreter-centered system on lisp machine ELIS
US6230264B1 (en) Parameterless language in a machine for implementation thereof
KR100196270B1 (ko) 마이크로프로세서
CA1211221A (en) Reduction processor for executing programs stored as treelike graphs employing variable-free applicative language codes
JPS61110240A (ja) 最適化コンパイラ
Bandman et al. Parallel microprogramming as a tool for multi-microprocessor systems
Metcalf Aspects of FORTRAN in large-scale programming