Functional memory type parallel processor architecture for solving combinational problems

Hiroto Yasuura, Taizou Tsujimoto, Keikichi Tamaru

Research output: Contribution to journalArticle

Abstract

We propose a new parallel processor architecture which is suitable for use with current VLSI technology. We term this architecture FMPP (Functional Memory type Parallel Processor architecture). The integration density of this architecture can be increased in accordance with the regular nature of its structure in a manner similar to memory chips. We regard the simple logic function equivalent to the roughly 100 transistors of each RAM word added, as a l-word bit serial processor. We take the memory to be an SIMD parallel computer system consisting of simple processors for many numbers as there are RAM words. This architecture implements a simple parallel algorithm for solving several combinational problems and combinational optimization problems. We call this algorithm a parallel exhaustive search (PRE).

Original languageEnglish
Pages (from-to)23-31
Number of pages9
JournalElectronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi)
Volume73
Issue number1
Publication statusPublished - Jan 1990
Externally publishedYes

Fingerprint

Random access storage
Data storage equipment
Parallel algorithms
Transistors
Computer systems

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

@article{f2667ea124ab458095a8cd1477659d4d,
title = "Functional memory type parallel processor architecture for solving combinational problems",
abstract = "We propose a new parallel processor architecture which is suitable for use with current VLSI technology. We term this architecture FMPP (Functional Memory type Parallel Processor architecture). The integration density of this architecture can be increased in accordance with the regular nature of its structure in a manner similar to memory chips. We regard the simple logic function equivalent to the roughly 100 transistors of each RAM word added, as a l-word bit serial processor. We take the memory to be an SIMD parallel computer system consisting of simple processors for many numbers as there are RAM words. This architecture implements a simple parallel algorithm for solving several combinational problems and combinational optimization problems. We call this algorithm a parallel exhaustive search (PRE).",
author = "Hiroto Yasuura and Taizou Tsujimoto and Keikichi Tamaru",
year = "1990",
month = "1",
language = "English",
volume = "73",
pages = "23--31",
journal = "Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi)",
issn = "1042-0967",
publisher = "John Wiley and Sons Inc.",
number = "1",

}

TY - JOUR

T1 - Functional memory type parallel processor architecture for solving combinational problems

AU - Yasuura, Hiroto

AU - Tsujimoto, Taizou

AU - Tamaru, Keikichi

PY - 1990/1

Y1 - 1990/1

N2 - We propose a new parallel processor architecture which is suitable for use with current VLSI technology. We term this architecture FMPP (Functional Memory type Parallel Processor architecture). The integration density of this architecture can be increased in accordance with the regular nature of its structure in a manner similar to memory chips. We regard the simple logic function equivalent to the roughly 100 transistors of each RAM word added, as a l-word bit serial processor. We take the memory to be an SIMD parallel computer system consisting of simple processors for many numbers as there are RAM words. This architecture implements a simple parallel algorithm for solving several combinational problems and combinational optimization problems. We call this algorithm a parallel exhaustive search (PRE).

AB - We propose a new parallel processor architecture which is suitable for use with current VLSI technology. We term this architecture FMPP (Functional Memory type Parallel Processor architecture). The integration density of this architecture can be increased in accordance with the regular nature of its structure in a manner similar to memory chips. We regard the simple logic function equivalent to the roughly 100 transistors of each RAM word added, as a l-word bit serial processor. We take the memory to be an SIMD parallel computer system consisting of simple processors for many numbers as there are RAM words. This architecture implements a simple parallel algorithm for solving several combinational problems and combinational optimization problems. We call this algorithm a parallel exhaustive search (PRE).

UR - http://www.scopus.com/inward/record.url?scp=0025263029&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025263029&partnerID=8YFLogxK

M3 - Article

VL - 73

SP - 23

EP - 31

JO - Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi)

JF - Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi)

SN - 1042-0967

IS - 1

ER -