PERFORMANCE ANALYSIS OF PARALLEL MACHINES USING MULTI-READ MEMORY.

Hideharu Amano, Junji Chikawa, Takaichi Yoshida, Hideo Aiso

Research output: Contribution to journalArticle

Abstract

The multi-read memory is a special type of shared memory which provides multiple data copies and allows multiple PUs to read data simultaneously. This paper analyzes the behavior of parallel machines using the multi-read memory and provides some methods to determine their performance. First, a Markov chain model is applied to n - n systems in which the number of copies is the same as that of PUs. Then a less complex expectation model is introduced as well as approximate expressions for the performance and it is shown that the results are almost the same as those of the Markov chain model. The paper also analyzes n - m systems in which the number of copies is less than that of PUs and obtains approximate expressions for the performance. The results of the behavior analysis clarify the upper limit of the number of PUs, the optimum number of copies and other useful results for implementation of the systems.

Original languageEnglish
Pages (from-to)29-37
Number of pages9
JournalSystems and Computers in Japan
Volume16
Issue number3
Publication statusPublished - 1985 May

Fingerprint

Parallel Machines
Performance Analysis
Data storage equipment
Markov processes
Markov Chain Model
Shared Memory
Model

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Hardware and Architecture
  • Information Systems
  • Theoretical Computer Science

Cite this

PERFORMANCE ANALYSIS OF PARALLEL MACHINES USING MULTI-READ MEMORY. / Amano, Hideharu; Chikawa, Junji; Yoshida, Takaichi; Aiso, Hideo.

In: Systems and Computers in Japan, Vol. 16, No. 3, 05.1985, p. 29-37.

Research output: Contribution to journalArticle

Amano, H, Chikawa, J, Yoshida, T & Aiso, H 1985, 'PERFORMANCE ANALYSIS OF PARALLEL MACHINES USING MULTI-READ MEMORY.', Systems and Computers in Japan, vol. 16, no. 3, pp. 29-37.
Amano, Hideharu ; Chikawa, Junji ; Yoshida, Takaichi ; Aiso, Hideo. / PERFORMANCE ANALYSIS OF PARALLEL MACHINES USING MULTI-READ MEMORY. In: Systems and Computers in Japan. 1985 ; Vol. 16, No. 3. pp. 29-37.
@article{ba482066fd9c43249b49a5edc8fa521f,
title = "PERFORMANCE ANALYSIS OF PARALLEL MACHINES USING MULTI-READ MEMORY.",
abstract = "The multi-read memory is a special type of shared memory which provides multiple data copies and allows multiple PUs to read data simultaneously. This paper analyzes the behavior of parallel machines using the multi-read memory and provides some methods to determine their performance. First, a Markov chain model is applied to n - n systems in which the number of copies is the same as that of PUs. Then a less complex expectation model is introduced as well as approximate expressions for the performance and it is shown that the results are almost the same as those of the Markov chain model. The paper also analyzes n - m systems in which the number of copies is less than that of PUs and obtains approximate expressions for the performance. The results of the behavior analysis clarify the upper limit of the number of PUs, the optimum number of copies and other useful results for implementation of the systems.",
author = "Hideharu Amano and Junji Chikawa and Takaichi Yoshida and Hideo Aiso",
year = "1985",
month = "5",
language = "English",
volume = "16",
pages = "29--37",
journal = "Systems and Computers in Japan",
issn = "0882-1666",
publisher = "John Wiley and Sons Inc.",
number = "3",

}

TY - JOUR

T1 - PERFORMANCE ANALYSIS OF PARALLEL MACHINES USING MULTI-READ MEMORY.

AU - Amano, Hideharu

AU - Chikawa, Junji

AU - Yoshida, Takaichi

AU - Aiso, Hideo

PY - 1985/5

Y1 - 1985/5

N2 - The multi-read memory is a special type of shared memory which provides multiple data copies and allows multiple PUs to read data simultaneously. This paper analyzes the behavior of parallel machines using the multi-read memory and provides some methods to determine their performance. First, a Markov chain model is applied to n - n systems in which the number of copies is the same as that of PUs. Then a less complex expectation model is introduced as well as approximate expressions for the performance and it is shown that the results are almost the same as those of the Markov chain model. The paper also analyzes n - m systems in which the number of copies is less than that of PUs and obtains approximate expressions for the performance. The results of the behavior analysis clarify the upper limit of the number of PUs, the optimum number of copies and other useful results for implementation of the systems.

AB - The multi-read memory is a special type of shared memory which provides multiple data copies and allows multiple PUs to read data simultaneously. This paper analyzes the behavior of parallel machines using the multi-read memory and provides some methods to determine their performance. First, a Markov chain model is applied to n - n systems in which the number of copies is the same as that of PUs. Then a less complex expectation model is introduced as well as approximate expressions for the performance and it is shown that the results are almost the same as those of the Markov chain model. The paper also analyzes n - m systems in which the number of copies is less than that of PUs and obtains approximate expressions for the performance. The results of the behavior analysis clarify the upper limit of the number of PUs, the optimum number of copies and other useful results for implementation of the systems.

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

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

M3 - Article

AN - SCOPUS:0022062951

VL - 16

SP - 29

EP - 37

JO - Systems and Computers in Japan

JF - Systems and Computers in Japan

SN - 0882-1666

IS - 3

ER -