AN EMPIRICAL METHODOLOGY FOR EXPLORING RECONFIGURABLE ARCHITECTURES

被引:10
作者
LIGON, WB
RAMACHANDRAN, U
机构
[1] College of Computing, Georgia Institute of Technology, Atlanta, GA
关键词
D O I
10.1006/jpdc.1993.1115
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Recent research in reduced instruction set computer architectures has emphasized the importance of the empirical approach to designing computer architectures: architectural features are analyzed for utility and cost with respect to the system software that uses them. This approach has resulted in architectural simulators that allow computer designers to vary the features of the architecture being simulated and to analyze how the addition or removal of these features affects the cost and performance of the architecture. In this paper we apply this technique to a new area: reconfigurable architectures. Our approach is to use an empirical methodology that emphasizes the interaction between the target software and the reconfigurability features of parallel architectures. We have developed a set of tools, the reconfigurable architecture workbench, that assists in this methodology by allowing parallel programs to be simulated on a target architecture in order to study the performance implications of various reconfigurability features. The workbench is based on a framework, the PCI model, which describes the range of parallel programs, parallel architectures, and reconfiguration features. We present details of the design and implementation of a prototype workbench, GT-RAW. GT-RAW is being used to study the utility of one dimension of reconfiguration for image processing and image understanding applications. We present an example of the experiments that are being conducted with GT-RAW as a demonstration of our empirical methodology. © 1993 Academic Press, Inc.
引用
收藏
页码:323 / 337
页数:15
相关论文
共 26 条
  • [1] Bronson E. C., 1990, IEEE Transactions on Parallel and Distributed Systems, V1, P195, DOI 10.1109/71.80147
  • [2] CHEN S, 1983, P NATO ADV RES WORKS
  • [3] ENSLOW PH, 1977, COMPUT SURV, V9, P103, DOI 10.1145/356683.356688
  • [4] FENG TY, 1972, 1972 P SAG COMP C RA, P5
  • [5] VERY HIGH-SPEED COMPUTING SYSTEMS
    FLYNN, MJ
    [J]. PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, 1966, 54 (12): : 1901 - &
  • [6] HANDLER W, 1977 P INT IEEE C PA, P7
  • [7] DATA PARALLEL ALGORITHMS
    HILLIS, WD
    STEELE, GL
    [J]. COMMUNICATIONS OF THE ACM, 1986, 29 (12) : 1170 - 1183
  • [8] Hillis WD, 1985, CONNECTION MACHINE
  • [9] FFT ALGORITHMS FOR SIMD PARALLEL PROCESSING SYSTEMS
    JAMIESON, LH
    MUELLER, PT
    SIEGEL, HJ
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1986, 3 (01) : 48 - 71
  • [10] KARTASHEV SI, 1979, IEEE T COMPUT, V28, P704, DOI 10.1109/TC.1979.1675238