Reproducing the Behavior of a Parallel Program by Using Dataflow Execution Models (Special Issue on Parallel and Distributed Supercomputing)
スポンサーリンク
概要
- 論文の詳細を見る
We present a general framework with which we can evaluate the flexibility and efficiency of various replay systems for parallel programs. In our approach, program monitoring is modeled by making a virtual dataflow program graph, referred to as a VDG, that includes all the instructions executed by the program. The behavior of the program replay is modeled on the parallel interpretation of a VDG based on two basic parallel execution models for dataflow program graphs: a data-driven model and a demand-driven model. Previous attempts to replay parallel programs, known as Instant Replay and P-Sequence, are also modeled as variations of the data-driven replay, i.e. the data-driven interpretation of a VDG. We show that the demand-driven replay, i.e. the demand-driven interpretation of a VDG, is more flexible in program replay than the data-driven replay since it allows better control of parallelism and a more selective replay. We also show that we can implement a demand-driven replay that requires almost the same amount of data to be saved during program monitoring as does the data-driven replay, and which eliminates any centralized bottleneck during program monitoring by optimizing the demand propagation and using an effective data structure.
- 社団法人電子情報通信学会の論文
- 1997-04-25
著者
-
TAKAHASHI Naohisa
NTT Software Laboratories
-
MIEI Takeshi
NTT Software Laboratories
-
Miei T
Ntt Software Laboratories
関連論文
- CORErouter-I: An Experimental Parallel IP Router Using a Cluster of Workstations (Special Issue on Network Interworking)
- Reproducing the Behavior of a Parallel Program by Using Dataflow Execution Models (Special Issue on Parallel and Distributed Supercomputing)
- An n^3u Upper Bound on the Complexity for Deciding the Truth of a Presburger Sentence Involving Two Variables Bounded Only by Existential Quantifiers