Performance Analysis of a Data Diffusion Machine with High Fanout and Split Directories

• Item type: Journal(1)
• 公開日: 1995-07-15
• タイトル: Performance Analysis of a Data Diffusion Machine with High Fanout and Split Directories
• タイトル / 言語: en
• タイトル: Performance Analysis of a Data Diffusion Machine with High Fanout and Split Directories
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: 特集：並列処理
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• その他タイトル / その他のタイトル: 共有メモリアーキテクチャ
• 著者所属: Department of Computer Science University of Bristol U. K.
• 著者所属(英): en
• 著者所属(英): Department of Computer Science, University of Bristol, U. K.
• 著者名: Hitoshi, Oi
• 著者名(英): Hitoshi, Oi
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: The Data Diffusion Machine is a virtual shared memory architecture which has the advantage that data migrates from node to node when needed. However its disadvantages compared with other shared memory architectures such as CC-NUMA are higher miss penalties due to its hierarchical structure in interconnection and contention of the transactions at higher level directories. One way to alleviate these disadvantages is by increasing fanout and splitting directories. We analyze the performance improvement of the DDM by adopting these two schemes by extending the experimental results obtained from the DDM emulator. From the emulation result of mp3d running on 3 x 3 configuration the performance of a DDM with flat 9-node configuration has been estimated. Its execution time is 1.3 times faster than 3x3 configuration. To see the accuracy of our estimation method we have compared the actual execution time and the estimated execution time in the case of a DDM with flat 4-node which can be configured with current DDM emulator with minimum modifications. The relative error was 3%. We also discuss about possible sources of errors in our method.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: The Data Diffusion Machine is a virtual shared memory architecture which has the advantage that data migrates from node to node when needed. However its disadvantages compared with other shared memory architectures such as CC-NUMA are higher miss penalties due to its hierarchical structure in interconnection and contention of the transactions at higher level directories. One way to alleviate these disadvantages is by increasing fanout and splitting directories. We analyze the performance improvement of the DDM by adopting these two schemes by extending the experimental results obtained from the DDM emulator. From the emulation result of mp3d running on 3 x 3 configuration, the performance of a DDM with flat 9-node configuration has been estimated. Its execution time is 1.3 times faster than 3x3 configuration. To see the accuracy of our estimation method, we have compared the actual execution time and the estimated execution time in the case of a DDM with flat 4-node, which can be configured with current DDM emulator with minimum modifications. The relative error was 3%. We also discuss about possible sources of errors in our method.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN00116647
• 書誌情報: 情報処理学会論文誌; 巻 36, 号 7, p. 1662-1668, 発行日 1995-07-15
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7764