Fuzzy arithmetic on systolic arrays

Hassen Dhrif, Dilip Sarkar

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

This paper presents parallel algorithms for fuzzy arithmetic operations on systolic arrays. A large part of the arithmetic on fuzzy numbers is referred to as fuzzy convolutions, which take O(n2) time steps when implemented sequentially. In this paper, we present two parallel algorithms. The first algorithm runs on a linear array machine in O(n) time, using O(n) processors, and thus, achieving optimal time and cost. The second algorithm runs on a mesh-of-trees type of computer architecture in L(log n) time steps, using O(n2) processors. The latter, although not optimal achieved high speedup. Both can be adapted to handle larger linear fuzzy numbers of fuzzy numbers with higher dimension.

Original languageEnglish (US)
Pages (from-to)1283-1301
Number of pages19
JournalParallel Computing
Volume19
Issue number11
DOIs
StatePublished - Jan 1 1993

Fingerprint

Fuzzy Arithmetic
Systolic Array
Systolic arrays
Parallel algorithms
Fuzzy numbers
Computer architecture
Convolution
Parallel Algorithms
Computer Architecture
Linear Array
Higher Dimensions
Costs
Speedup
Mesh

Keywords

  • fuzzy arithmetic
  • linear array of processors
  • mesh-of-trees of processors
  • speed-up analysis
  • Systolic arrays

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Software
  • Hardware and Architecture
  • Computer Networks and Communications
  • Computer Graphics and Computer-Aided Design
  • Artificial Intelligence

Cite this

Fuzzy arithmetic on systolic arrays. / Dhrif, Hassen; Sarkar, Dilip.

In: Parallel Computing, Vol. 19, No. 11, 01.01.1993, p. 1283-1301.

Research output: Contribution to journalArticle

Dhrif, Hassen ; Sarkar, Dilip. / Fuzzy arithmetic on systolic arrays. In: Parallel Computing. 1993 ; Vol. 19, No. 11. pp. 1283-1301.
@article{b859fc2fc4a240d286a27beca170133f,
title = "Fuzzy arithmetic on systolic arrays",
abstract = "This paper presents parallel algorithms for fuzzy arithmetic operations on systolic arrays. A large part of the arithmetic on fuzzy numbers is referred to as fuzzy convolutions, which take O(n2) time steps when implemented sequentially. In this paper, we present two parallel algorithms. The first algorithm runs on a linear array machine in O(n) time, using O(n) processors, and thus, achieving optimal time and cost. The second algorithm runs on a mesh-of-trees type of computer architecture in L(log n) time steps, using O(n2) processors. The latter, although not optimal achieved high speedup. Both can be adapted to handle larger linear fuzzy numbers of fuzzy numbers with higher dimension.",
keywords = "fuzzy arithmetic, linear array of processors, mesh-of-trees of processors, speed-up analysis, Systolic arrays",
author = "Hassen Dhrif and Dilip Sarkar",
year = "1993",
month = "1",
day = "1",
doi = "10.1016/0167-8191(93)90032-G",
language = "English (US)",
volume = "19",
pages = "1283--1301",
journal = "Parallel Computing",
issn = "0167-8191",
publisher = "Elsevier",
number = "11",

}

TY - JOUR

T1 - Fuzzy arithmetic on systolic arrays

AU - Dhrif, Hassen

AU - Sarkar, Dilip

PY - 1993/1/1

Y1 - 1993/1/1

N2 - This paper presents parallel algorithms for fuzzy arithmetic operations on systolic arrays. A large part of the arithmetic on fuzzy numbers is referred to as fuzzy convolutions, which take O(n2) time steps when implemented sequentially. In this paper, we present two parallel algorithms. The first algorithm runs on a linear array machine in O(n) time, using O(n) processors, and thus, achieving optimal time and cost. The second algorithm runs on a mesh-of-trees type of computer architecture in L(log n) time steps, using O(n2) processors. The latter, although not optimal achieved high speedup. Both can be adapted to handle larger linear fuzzy numbers of fuzzy numbers with higher dimension.

AB - This paper presents parallel algorithms for fuzzy arithmetic operations on systolic arrays. A large part of the arithmetic on fuzzy numbers is referred to as fuzzy convolutions, which take O(n2) time steps when implemented sequentially. In this paper, we present two parallel algorithms. The first algorithm runs on a linear array machine in O(n) time, using O(n) processors, and thus, achieving optimal time and cost. The second algorithm runs on a mesh-of-trees type of computer architecture in L(log n) time steps, using O(n2) processors. The latter, although not optimal achieved high speedup. Both can be adapted to handle larger linear fuzzy numbers of fuzzy numbers with higher dimension.

KW - fuzzy arithmetic

KW - linear array of processors

KW - mesh-of-trees of processors

KW - speed-up analysis

KW - Systolic arrays

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

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

U2 - 10.1016/0167-8191(93)90032-G

DO - 10.1016/0167-8191(93)90032-G

M3 - Article

AN - SCOPUS:0027694926

VL - 19

SP - 1283

EP - 1301

JO - Parallel Computing

JF - Parallel Computing

SN - 0167-8191

IS - 11

ER -