Analytic Modeling of Cache Coherence Based Parallel Computers
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we propose an analytic model using a semi-markov process for parallel computers which provides hardware support for a cache coherence mechanism. The model proposed here, the Semi-markov Memory and Cache coherence Interference model, can be used for the performance prediction of cache coherence based parallel computers since it can be easily applied to descriptions of the waiting states due to network contention or memory interference of both normal data accesses and cache coherence requests. Conventional analytic models using stochastic processes to describe parallel computers have the problem of numerical explosion in the number of states necessary as the system size increases even for simple parallel computers without cache coherence mechanisms. The number of states required by constructing our proposing analytic model, however, does not depend on the system size but only on the kind of cache coherence protocol. For example, the number of states for the Synapse cache coherence protocol is only 20, as is described in this paper. Using the proposed analytic model, we investigate several comparative experiments with widely known simulation results. We found that there is only a 7.08 % difference between the simulation and our analytic model, while our analytic model can predict the performance of a 1,024 processor system in the order of microseconds.
- 社団法人電子情報通信学会の論文
- 1996-07-25
著者
-
JOE Kazuki
Graduate School of Humanity and Science, Nara Womens University
-
Joe Kazuki
Graduate School Of Information Science Nara Institute Of Science And Technology
-
Joe Kazuki
The Graduate School Of Information Science Nara Institute Of Science And Technology
-
Joe Kazuki
Graduate School Of Human Culture Nara Women's University
-
Fukuda Akira
Graduate School Of Information Science Nara Institute Of Science And Technology
-
Fukuda Akira
Graduate School of Information Science and Electrical Engineering, Kyushu University
関連論文
- Efficient Query-by-Content Audio Retrieval by Locality Sensitive Hashing and Partial Sequence Comparison
- Multipoint Relay Selections with QoS Support in Link State Routing Protocol for Multi-Hop Wireless Networks
- Logic-based Binding Time Analysis for Java Using Reaching Definitions
- A Case Study of Development of a Java Bytecode Analyzer Framework Using AspectJ
- Node Mobility Aware Routing for Mobile Ad Hoc Network
- 3P046 動きの特徴を用いたタンパク質構造の時系列解析(蛋白質-構造機能相関,第48回日本生物物理学会年会)
- Efficient Query-by-Content Audio Retrieval by Locality Sensitive Hashing and Partial Sequence Comparison
- Analytic Modeling of Cache Coherence Based Parallel Computers
- A Multi-Objective Genetic Algorithm for Program Partitioning and Data Distribution Using TVRG
- Multipoint Relay Selections with QoS Support in Link State Routing Protocol for Multi-Hop Wireless Networks
- Modulo Interval Arithmetic and Its Application to Program Analysis (特集 並列処理)
- Removal Rate Simulation of Dissolution-Type Electrochemical Mechanical Polishing
- An Information Announcement System Based on WWW for Mobile Computers(Special Section on Fundamentals of Multi-dimensional Mobile Information Network)
- An Improvement of Program Partitioning Based Genetic Algorithm
- Collaborative Filtering for Position Estimation Error Correction in WLAN Positioning Systems
- A Combined Data and Program Partitioning Algorithm for Distributed Memory Multiprocessors
- Effective Caching for NetNews Servers
- An SMT-Based Approach to Bounded Model Checking of Designs in State Transition Matrix
- Energy-efficient Data Collection Method with Multiple Deadlines for Wireless Sensor Networks
- A Case Study of Development of a Java Bytecode Analyzer Framework Using AspectJ