$B;29MJ88%(B

ASPLOS: Architecture Support for Progamming Language and Operating Systems
ICPP: International Conference on Parallel Processing
ISCA: International Symposium on Computer Architecture
FGCS: International Conference on Fith Generation Computer Systems
ISPAN: International Symposium on Parallel Architectures Algorithms and Networks
SPDP: IEEE Symposium on Parallel and Distributed Processing
JSPP: $BJBNs=hM}%7%s%]%8%&%`(B(Joint Symposium on Parallel Processing)

[1]

M.J.Flynn, Some Computer Organizations and Their Effectiveness, IEEE Trans. on Computers, Vol. C-21, No. 9, pp. 948-960, Sep. 1972

[2]

P.H.Enslow Jr., ``Multiprocessor Organization - A Survey,'' ACM Computing Surveys, Vol.9, No.1 Mar. 1977.

[3]

W.C.Athas, C.L.Seitz, Multicomputers: Message-Passing Concurrent Computers, IEEE Computer, Vol. No. 8, Aug. 1988. pp.9-23.

[4]

G.S.Almasi, A.Gottlieb, "Highly Parallel Computing (second edition)," The Benyamin/Cummings Pub. Co. Inc. 1994.

[5]

K.Hwang, "Advanced Computer Architecture - Parallelism, Scalability, Programming," McGRAW-Hill, Inc. 1993.

[6]

H.S.Stone, "High-Performance Computer Architecture," Addison-Wesley Pub. Co., 1990.

[7]

$BIYEDbC<#!"(B "$BJBNs7W;;5!9=@.O@(B," $B><98F2!"(B1986.

[8]

$BIYED!"Kv5H!"(B ``$BJBNs=hM}%^%7%s(B,'' $B%*!<%` [9]

$BB<2,MN0l(B ``$BJBNs=hM}(B,'' $B><98F2!"(B 1986.

[10]

$B3^86GnFA!"(B "$BJBNs=hM}5;=Q(B," $B%3%m%J [11]

$B5]>l!";38}(B "$B%G!<%?6nF07?JBNs7W;;5!(B,'' $B%3%s%T%e!<%?%"!<%-%F%/%A%c%7%j!<%:(B, $B%*!<%` [12]

C.Mead, L.Conway, "Introduction to VLSI systems," Addison-Wesley Pub. Co., 1980.

[13]

D.B.Skillicorn, ``A Taxonomy for Computer Architectures,'' Computer, Nov. 1988. pp.46-57.

[14]

R.Duncan, ``A Survey of Parallel Computer Architectures,'' Computer, Feb. 1990. pp.5-16.

[15]

K.J.Thurber, L.D.Wald, ``Associative and Parallel Processors,'' ACM Computing Surveys, Vol.7 No.4 Dec. 1976. pp.215-255.

[16]

IEEE Draft: ``Futurebus+ P986.1 Draft 8.2'', Feb. 1990.

[17]

$B>.NS=$(B: ``1G$B%P%$%H(B/$BIC;~Be$KFMF~$7$?L)7k9g%^%k%A%W%m%;%5MQ%P%9(B'', $BF|7P%(%l%/%H%m%K%/%9(B, no.593, Oct. 1993.

[18]

Texas Instruments: ``SuperSPARC User's Guide'', 1992.

[19]

T.Nakagawa, et al. ``A multi-microprocessor approach to discrete system simulation,'' Proc. of CompCon Spring 1980.

[20]

T.Terasawa, O.Yamamoto, T.Kudoh, H.Amano, ``A performance evaluation of the multiprocessor testbed ATTEMPT-0,'', Parallel Computing, 21, 1995. pp.701-730.

[21]

B.Wilkinson, ``Computer Architecture -Design and Performance-,'' Prentice Hall International Ltd. 1991 ($B9b665AB$(B $B4FLu!"EOJU(B $B>0!">.NS??Li(B $BLu!"!V7W;;5!@_7W5;K!(B -$B%^%k%A%W%m%;%C%5(B $B%7%9%F%`O@(B-$B!W%H%C%Q%s!"(B1994.

[22]

E.F.Gehringer, J.Abullarade, M.H.Gulyn, A Survey of Commercial Parallel Processors, Computer Architecture News, Sep. 1988

[23]

D.Lenoski, et al., The Stanford DASH Multiprocessor, Computer, Vol. 25, No. 3, 1992. pp. 63-79.

[24]

$BpJs=hM}!"(BVol.33, No.2 Feb. 1992. pp.143-152.

[25]

J.Archibald, J.-L.Baer, Cache-Coherence Protocols: Evaluation Using a Multiprocessor Simulation Model, ACM Trans. on Computer Systems, Vol.4, No.4, 1986. pp. 273-298.

[26]

M.Annaratone and R.Ruehl, ``Performance measurements on a commercail multiprocessor running parallel code,'' ISCA89, 1989. pp.315-324.

[27]

M.S.Papamarcos and J.H.Patel: ``A LOW-OVERHEAD COHERENCE SOLUTION FOR MULTIPROCESSORS WITH PRIVATE CACHE MEMORIES'', ISCA84, pp.348-354.

[28]

$B;{_7(B $BBnLi(B, $B0f>e(B $B7I2p(B, $B9u_7(B $BHtEMLp(B, $BE7Ln(B $B1Q@2(B: ``$B%*%s%A%C%W%^%k%A%W%m%;%C%5$N%-%c%C%7%e%a%b%j$N8!F$(B'', $B?.3X5;Js(B, {\bf CPSY95}-17, 1995.

[29]

R.H.Katz, et al, ``IMPLEMENTING A CACHE CONSISTENCY PROTOCOL'', ISCA85, pp.276-283.

[30]

C.P.Thacker, L.C.Stewart and E.H.Satterthwaite Jr., ``Firefly: A Multiprocessor Workstation,'' IEEE Trans. on Comput., Vo.37, No.8, 1988. pp.909-920.

[31]

McCreight E.M.: ``THE DRAGON COMPUTER SYSTEM An Early Overview'', NATO ASI Series E-No.96, 1985. pp.83-101.

[32]

P.Sweazey, A.J.Smith, A Class of Compatible Cache Consistency Protocols and their Support by the IEEE Futurebus, ISCA86, pp. 414-423.

[33]

$B9b66(B $B5AB$(B $BJT(B, $BJBNs=hM}5!9=(B $BBh(B5$B>O(B, Maruzen Advanced Techrology $BEE;R!&>pJs!&DL?.(B $BJT(B, $B4]A1(B, 1989

[34]

A.R.Karlin, M.S.Manasse, L.Rudolph and D.D.Sleator, ``Competitive Snooping Caching,'' Proc. of 27th Annual Symposim on Foundations of Computer Science, Oct. 1986.

[35]

S.J.Eggers, R.H.Katz, Evaluating the Performance of Four Snooping Cache Coherency Protocols, ISCA89, pp. 2-15.

[36]

$BNkLZB'5W!"@6?eLPB'!";3FbD9>5!"(B ``$B6&M-5-217?JBNs%7%9%F%`$N [37]

$B>>K\(B $B>0!"(B ``$B:YN3EYJBNs [38]

J.R.Goodman, ``Using Cache Memory to Reduce Processor-Memory Traffic,'' ISCA83, pp. 124-131.

[39]

B.R.Preiss, V.C.Hamacher, A Cache-based Message Passing Scheme for a Shared-bus Multiproceesor, ISCA88, pp. 358-364.

[40]

H.Amano, T.Terasawa, T.Kudoh, Cache with Synchronization Mechanism, Proc. of IFIP 11th World Computer Congress, pp.1001-1006, Aug. 1989

[41]

T.Matsumoto, T.Tanaka, T.Moriyama, S.Uzuhara, ``MISC: a mechanism for Integrated Synchronization and Communication using Snoop Caches,'' ICPP91, I161-I167.

[42]

$B8^Eg!">>K\!"?9!"CfEg!"IYED!"(B ``Virtual Queue: $BD6JBNs7W;;5!8~$-%a%C%;!<%8DL?.5!9=(B,'' JSPP95, pp.225-232.

[43]

$B>>K\>0!"(B ``$B%9%L!<%W%-%c%C%7%e@)8f5!9=$N(BDOACROSS$B%k!<%W$X$NE,MQ(B,'' $B>pJs=hM}3X2qO@J8;o(B Vo.34, No.4, 1993. pp.616-627.

[44]

$B1:>k(B $B91M:(B, ``$B%-%c%C%7%e%a%b%j$N0lCW@-$K$D$$$F(B,'' $B>pJs=hM}(B Vol. 32, No. 1, 1991. pp.64-73.

[45]

P.Stenstrom, ``A Survey of Cache Coherence Schemes for Multiprocessors,'' IEEE Computer, Vol. 23, No. 6, 1990, pp. 12-24.

[46]

$B%U%#%k%^%s(B,$B%U%j!<%I%^%s(B $B6&Cx(B, $B1+5\(B, $BHxFb(B, $B9b66(B $B6&Lu(B, ``$B6(D47?7W;;%7%9%F%`(B,'' $B%^%0%m%&%R%k(B, 1986

[47]

L.Rudlph, Z.Segall, ``Dynamic Decentralized Cache Schemes for MIMD Parallel Processors,'' ISCA84, pp. 340-347.

[48]

J.Lee, U.Ramachandran, ``Synchronization with Multiprocessor Caches,'' ISCA90, pp. 27-37.

[49]

B.J.Smith, ``A Pipelined, Shared Resource MIMD Computer,'' ICPP78, pp. 6-8.

[50]

J.Konicek, et al., ``The Organization of the Cedar System,'' ICPP91, pp. 49-66.

[51]

Arvind, R.A.Iannucci, ``A Critique of Multiprocessing von Neumann Style,'' ISCA83, pp. 426-436.

[52]

R.Gupta, ``The Fuzzy Barrier,'' A Mechanism for High Speed Synchronization of Processors, ASPLOS III, 1989. pp.54-63.

[53]

$B9bLZ!"M-ED!"A>OB!"(B''$B:YN3EYJBNs2A(B,'' JSPP91, pp.269-276.

[54]

$B>>K\(B $B>0(B, Elastic Barrier: $B0lHL2=$5$l$?%P%j%"7?F14|5!9=(B, $B>pJs=hM}3X2qO@J8;o(B, Vol. 32, No. 7, pp. 886-896, Jul. 1991

[55]

M.T.O'Keefe, H.G.Dietz, ``Hardware Barrier Synchronization: Static Barrier MIMD (SBM),'' ICPP90, pp.I35-I42

[56]

M.T.O'Keefe, H.G.Dietz, ``Hardware Barrier Synchronization: Dynamic Barrier MIMD (DBM),'' ICPP90, pp.I43-I46.

[57]

$B;32H!"B<>e!"(B ``$B%P%j%"F14|%b%G%k(B -Taxonomy$B$H?7%b%G%k$NDs0F(B,'' JSPP93. pp.119-126.

[58]

$BFA1J(B, $BB<>e(B, $B;32H(B, ``$B%a%b%j%3%s%7%9%F%s%7%#!&%b%G%k(B-- $B?7$7$$%b%G%k$NDs0F$*$h$S$=$NG=NOHf3S(B --,'' JSPP93, pp.253-260.

[60]

J.Kuskin et al. ``The Stanford FLASH Multiprocessor,'' ISCA94, pp.302-313.

[61]

A.Agarwal et al. ``The MIT Alewife Machine: A large scale distibuted memory multiprocessor,'' Proc. of Workshop on Scalable Shared Memory Multiproessors, Kluwer Academic Pub. 1991.

[62]

K.Hiraki et al. ``Overview of the JUMP-1, an MPP Prototype for General-Purpose Parallel Computations,'' SPAN94.

[63]

D.Chaiken, C.Fields, K.Kurihara, A.Agarwal, Directory-Based Cache Coherence in Large-Scale Multiprocessors, IEEE Computer, Vol. 23, No. 6, 1990. pp. 49-58.

[64]

C.K.Tang, Cache System Design in the Tightly Coupled Multiprocessor System, In AFIPS Conf. Proc., National Computer Conference, 1976, pp. 749-753.

[65]

L.M.Censier, P.Feautrier, A New Solution to Coherence Problems in Multicache Systems, IEEE Trans. on Computers, Vol. C-27, No. 12, 1978, pp. 1112-1118.

[66]

P.Stenstrom, A Cache Consistency Protocol for Multiprocessors with Multistage Networks, ISCA89, pp. 407-415.

[67]

J.Archibald, J.-L.Baer, An Economical Solution to the Cache Coherence Problem, ISCA84, pp. 355-362.

[68]

W.D.Weber, A.Gupta, Analysis of Cache Invalidation Patterns in Microprocessors, Proc. of ASPLOS III, 1989. pp. 243-256.

[69]

S.J.Eggers, R.H.Katz, A Characterization of Sharing in Parallel Programs and its Application to Coherence Protocol Evaluation, ISCA88, pp. 373-382.

[70]

A.Agarwal, R.Simoni, J.Hennessy, M.Horowitz, An Evaluation of Directory Schemes for Cache Coherence, ISCA88, pp. 280-289.

[71]

D.Chaiken, J.Kubiatowicz, A.Agarwal, LimitLESS Directories: A Scalable Cache Coherence Scheme, ASPLOS IV, pp. 224-234, Apr. 1991

[72]

D.V.James, A.T.Laundrie, S.Gjessing, G.S.Sohi, Distributed-Directory Scheme: Scalable Coherent Interface, IEEE Computer, Vol. 23, No. 6, pp. 74-77, Jun. 1990

[73]

M.Thapar, B.Delagi, Distributed-Directory Scheme: Stanford Distributed-Directory Protocol, IEEE Computer, Vol. 23, No. 6, pp. 78-80, Jun. 1990

[74]

R.Simoni, M.Horowitz, Dynamic Pointer Allocation for Scalable Cache Coherence Directories, Proc. of Int'l Symp. on Shared Memory Multiprocessing (ISSMM), pp. 72-81, Tokyo, Apr. 1991

[75]

E.Hagersten, A.Landin and S.Haridi, ``DDM - A Cache-Only Memory Architecture,'' IEEE Computer, Vol.25, No.9, 1992. pp.44-56.

[76]

L.Lamport, How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs, IEEE Trans. on Computers, Vol. C-28, No. 9, 1979. pp. 690-691.

[77]

M.Dubois, C.Scheurich, F.Briggs, Memory Access Buffering in Multiprocessors, ISCA86, pp. 434-442.

[78]

C.Scheurich, M.Dubois, Correct Memory Operation of Cache-Based Multiprocessors, ISCA87, pp. 234-243.

[79]

S.V.Adve, M.D.Hill, Weak Ordering - A New Definition, ISCA90, pp. 2-14.

[80]

K.Gharachorloo, et al., Memory Consistency and Event Ordering in Scalable Shared-Memory Multiprocessors, ISCA90, pp. 15-26.

[81]

K.Gharachorloo, A.Gupta, J.Hennessy, Performance Evaluation of Memory Consistency Models for Shared-Memory Multiprocessors, ASPLOS IV, pp. 245-257, Apr. 1991

[82]

J.R.Goodman, Cache Consistency and Sequentiial Consistency, Computer Science Technical Report No.1006, Univ. of Wisconsin Madison, Feb. 1991

[83]

S.V.Adve, M.D.Hill, A Unified Formalization of Four Shared-Memory Models, Computer Science Technical Report No.1051, Univ. of Wisconsin Madison, Sep. 1991

[84]

J.R.Goodman, M.K.Vernon, P.J.Woest, Efficient Synchronization Primitives for Large-Scale Cache-Coherent Multiprocessors, Proc. of ASPLOS III, pp. 64-75, Apr. 1989

[85]

P.J.Woest, J.R.Goodman, An Analysis of Synchronization Mechanisms in Shared-Memory Multiprocessors, Proc. of Int'l Symp. on Shared Memory Multiprocessing (ISSMM), pp. 152-1165, Tokyo, Apr. 1991

[86]

J.M.Mellor-Crummey, M.L.Scott, Synchronization Without Contention, Proc. of ASPLOS IV, pp. 269-278, Apr. 1991

[87]

E.F.Gehringer, A.K.Jones, A.A.Segall, The CM* Testbed, IEEE Computer, Vol. 15, No. 10, pp. 38-50, Oct. 1982

[88]

A.W.Wilson Jr., Hierarchical Cache/Bus Architecture for Shared Memory Multiprocessors, ISCA87, pp. 244-252.

[89]

J.R.Goodman, P.J.Woest, The Wisconsin Multicube: A New Large-Scale Cache-Coherent Multiprocessor, ISCA88, pp. 422-431.

[90]

D.Lenoski, et al., The Directory-Based Cache Coherence Protocol for the DASH Multiprocessor, ISCA90, pp. 148-159.

[91]

$B>>K\(B, $BJ?LZ(B, ``Memory Based Processor $B$K$h$kJ,;66&M-%a%b%j(B,'' JSPP93, pp. 245-252.

[92]

T.Kudoh, et al. ``Hierarchical bit-map directory schemes on the RDT interconnection network for a massively parallel processor JUMP-1,'' ICPP95, pp.I186-I193.

[93]

D.H.D. Warren and S.Haridi, ``Data Diffusion Machine - A Scalable Shared Virtual Memory Multiprocessor,'' Proc. of FGCS88, 1988, pp.943-952.

[94]

Kendall Square Research, ``Technical Summary,'' 1992.

[95]

P.Stenstrom, T.Joe and A.Gupta, ``Comparative Performance Evaluation of Cache-Coherent NUMA and COMA Architecture,'' ISCA92, pp.80-91.

[96]

S.Sakai et al., ``RICA: Reduced Interprocessor-Communication Architecture,'' SPDP93. pp.122-126.

[97]

P.Stenstrom, M.Brorsson and L.Sandberg, ``An Adaptive Cache Coherence Protocol Optimized for Migratory Sharing,'' ISCA93. pp.109-118.

[98]

$B?9!"J!Eg!"8^Eg!"CfEg!"IYED!"(B ``Self-Cleanup Cache$B$NDs0F(B,'' JSPP95, pp.265-272.

[99]

K.Li, ``IVY: A Shared Virtual Memory System for Parallel Computing,'' ICPP88, pp.94-101.

[100]

S.K.Reinhardt, J.R.Larus, D.A.Wood, ``Tempest and Typhoon: User-Level SHared Memory,'' ISCA94, pp.325-336.

[101]

$BE7Ln!"@>!"@>B [102]

D.H.Lawrie, ``Access and Alignment of Data in an Array Processor,'' IEEE Trans. on Comput. Vol.C-24, No.12, Dec. 1975. pp.1145-1155.

[103]

H.J.Siegel, and S.D.Smith, ``Study of multistage SIMD interconnection networks,'' ISCA78, pp.223-229.

[104]

C.Wu, T.Feng, ``On a Class of Multistage Interconnection Networks,'' IEEE Trans. on Comput. Vol.C-29, No.8, Aug. 1980. pp.694-702.

[105]

T.Feng, ``Data Manipulating Functions in Parallel Processors and Their Implementations,'' IEEE Trans. on Comput. Vol. C-23, No.3, Mar. 1974. pp.309-318.

[106]

T.J.McMillen, H.J.Siegel, ``Routing Schemes for the Augmented Data Manipulator Network in an MIMD System,'' IEEE Trans. on Comput. Vol. C-31, No.12, Dec. 1982. pp.1202-1214.

[107]

G.J.Lipovski, M.Malek, ``Parallel Computing -Theory and Comparisons-,'' A Wiley-Interscience Pub., 1987.

[108]

D.M.Dias and J.R.Jump, ``Analysis and Simulation of Buffered Delta Networks,'' IEEE Trans. on Comput. Vol.C-30, No.4, Apr. 1981. pp.273-280.

[109]

P.Yew, D.H.Lawrie, ``An Easily Controlled Network for Frequently Used Permutations,'' IEEE Trans. on Comput. Vol. C-30 No.4 Apr. 1981. pp.296-298.

[110]

V.E.Benes, ``On Rearrangeable Three-Stage Connecting Networks,'' The Bell System Tech. Journal Vol. XLI, No.5, 1962. pp.1481-1491.

[111]

Clos,C. : ``A study of non-blocking switching networks,'' Bell System Tech. J. 32, 2 Mar. (1953). pp.406-424.

[112]

K.E.Batcher, ``Sorting networks and their applications,'' Proc. Joint Computer Conference, Apr. 1968. pp.307-314.

[113]

S.G.Akl, ``Parallel Sorting Algorithms,'' Academic Press, 1985.

[114]

N.J.Narasimha, ``The Batcher-Banyan selfrouting network: universality and simplification,'' IEEE Trans. on Comput. COM-36, No.10, Oct. 1988. pp.1175-1178.

[115]

K.Gaye, H.Amano, ``A Batcher Double Omega network with Combining,'' IEICE Trans. on information and systems, Vol.E75-D No.3 1992. pp.307-314.

[116]

T.Hanawa, H.Amano and Y.Fujikawa, ``Multistage Interconnection Network with multiple outlets,'' ICPP94, I1-I8.

[117]

Tobagi, F.A. Kwok, T.:{\em The Tandem Banyan Switching Fabric: a Simple High-Performance Fast Packet Switch">[], Proc. of INFOCOM91, (1991).

[118]

$B:d85(B,$B9S@n(B,$B@5LZ(B,$B0f>e(B,$BE7Ln(B: $B<+8J%k!<%A%s%0%9%$%C%A$N9=@.$H(B $B$=$NI>2A(B,$B?.3X5;Js(B ISSE88-30 8, (1988).

[119]

G.B.Adams III, and H.J.Siegel, ``The Extra Stage Cube: A Fault-Tolerant Interconnection Network for Supersystems,'' IEEE Trans. on Comput. Vol. C-31, No.5 May 1982. pp.443-454.

[120]

Amano, H. Zhou, L. Gaye, K.:{\em SSS(Simple Serial Synchoronized)-MIN: A novel multi stage interconnection architecture for multiprocessors">[], Proc. of IFIP Congress 92, 1992. pp.571-577.

[121]

$BE7Ln(B, $B<~(B, $BF#@n(B: SSS (Simple Serial Synchronized)$B7?%^%k%A%9%F!<%8(B $B%M%C%H%o!<%/(B, $B>pJs=hM}3X2qO@J8;o(BVol.34, No.5, pp. 1134-1143, (1993).

[122]

G.F.Pfister, V.A.Norton, ``Hot Spot'' Contention and Combining in Multistage Interconnection Networks, IEEE Trans. on Computers, Vol. C-34, No. 10, pp. 943-948, Oct. 1985

[123]

A.Gottlieb, et al. The NYU Ultracomputer -- Designing an MIMD Shared Memory Parallel Computer, IEEE Trans. on Computers, Vol. C-32, No. 2, pp. 175-189, Feb. 1983

[124]

S.R.Dickey and O.E.Percus, ``Performance differences among combining switch architectures,'' ICPP92, I110-I117.

[125]

A Cost-Effective Combining Structure for Large-Scale Shared Memory Multiprocessors,'' IEEE Trans. on Comput. Vol 41, No.11 Nov. 1992. pp.1420-1429.

[126]

S.R.Dickey and T.Kenner ``Combining Switches for the NYU Ultracomputer,'' Prof. of Frontiers to Massively Parallel Processing Dec. 1992. pp.521-523.

[127]

M.Sasahara et al., ``SNAIL: a multiproessor based on the simple serial synchronized multistage interconnectin network architecture,'' ICPP94, pp.I117-I120.

[128]

$B:{86!";{ED!"BgOB!"H9!"E7Ln!"(B ``SSS$B7?(BMIN$B$K4p$E$/%^%k%A%W%m%;%C%5(BSNAIL,'' $B>pJs=hM}3X2qO@J8;o(B Vol.36, No.7, Jul. 1995. pp.1640-1651.

[129]

A.V.Veidenbaum, A Compiler-Assisted Cache Coherence Solution for Multiprocessors, Proc. of ICPP, pp. 1029-1036, Aug. 1986

[130]

J.Edler, et al., Issues Related to MIMD Shared-memory Computers: the NYU Ultracomputer Approach, Proc. of 12th ISCA, pp. 126-135, Jun. 1985

[131]

W.C.Brantley, K.P.McAuliffe, J.Weiss, RP3 Processor-Memory Element, Proc. of ICPP, pp. 782-789, Aug. 1985

[132]

R.L.Lee, P.-C.Yew, D.H.Lawrie, Multiprocessor Cache Design Considerations, Proc. of 14th ISCA, pp. 253-262, Jun. 1987

[133]

R.Cytron, S.Karlovsky, K.P.McAuliffe, Automatic Management of Programmable Caches, Proc. of ICPP, Vol. II, pp. 229-238, Aug. 1988

[134]

H.Cheong, A.V.Veidenbaum, A Cache Coherence Scheme with Fast-Selective Invalidation, Proc. of 15th ISCA, pp. 299-307, May 1988

[135]

H.Cheong, A.V.Veidenbaum, Stale Data Detection and Coherence Enforcement Using Flow Analysis, Proc. of ICPP, Vol. I, pp. 138-145, Aug. 1988

[136]

H.Cheong, A.V.Veidenbaum, A Version Control Approach to Cache Coherence, Proc. of Int'l Conf. Superconputing 89, pp. 322-330, Jun. 1989

[137]

S.L.Min, J.-L.Baer, A Timestamp-based Cache Coherence Scheme, Proc. of ICPP, Vol. I, pp. 23-32, Aug. 1989

[138]

H.E.Mizrahi, J.L.Baer, E.D.Lazowska, J.Zahorjan, ``Introducing Memory into the Switch Elements of Multiprocesssor Interconnection Networks,'' ISCA89, pp.158-166.

[139]

A.K.Nanda, L.N.Bhuyan, ``Design and Analysis of Cache Coherent Multistage Interconnection Networks,''IEEE Trans. on Computers, Vol.42, No.4, 1993. pp.458-470.

[140]

L.N.Bhuyan, A.K.Nanda and T.Askar, ``Performance and Reliability of the Multistage Bus Network,'' ICPP94, pp.I150-I157.

[141]

Broomell,G. and Heath,J.R. : ``Classification Categories and Historical Development of Circuit Switching Topologies,'' ACM Computing Surveys, Vol.15, No.2, Jun. 1983. pp.93-133.

[142]

G.B.Adams III, D.P.Agrawal, H.J.Siegel, ``Fault-Tolerant Multistage Interconnection Networks,'' IEEE Computer, 20, Jun. 1987. pp.12-27.

[143]

$B9u@n!"Aj0k!"(B ``$B7k9gJ}<0(B,'' $B>pJs=hM}!"(BVol.27, No.9 1986. pp.1005-1021.

[144]

$B1|@n=T;K!"(B ``$BJBNs7W;;5!%"!<%-%F%/%A%c(B,'' $B%3%m%J [145]

K.Hwang, et al. ``Computer Architecture and parallel processing,'' McGrow-Hill Book Co. pp.410-421, 1984.

[146]

J.Beetem, M.Demmeau and D.Weingarten, ``The GF-11 Supercomputer,'' ISCA85, pp.108-115.

[147]

G.E.Schmidt, The Butterfly Parallel Processor, Proc. of Int'l Conf. Supercomputing, 1987. pp. 362-365.

[148]

H.F.Jordan, ``Perofrmance measurements on HEP - a pipelined MIMD computer,'' ISCA83, pp.207-212.

[149]

G.F.Pfister, et al., The IBM Research Parallel Processor Prototype (RP3): Introduction and Architecture, ICPP85, pp.764-771.

[150]

Konicek, J. et al,: {\em The Organization of the Cedar System}, ICPP91, pp.49-56.

[151]

$B8MED!"@>ED!"9b66!"(BMichell$B!";38}!"(B ``$BM%@hEY@hAw$jJ}<0$K$h$kpJs=hM}3X2qO@J8;o!"(BVol.36, No.7, Jul. 1995. pp.1619-1629.

[152]

$BEDB2A(B,'' JSPP95. pp.129-136.

[153]

$B9b66!">.CS!"EDCf!"(B ``$BJBNs?dO@%^%7%s(BPIE64$B$NAj8_7k9gLV$N:n@.$*$h$SI>2A(B,'' JSPP90. pp.89-96.

[154]

C.S.Raghavendra, A.Varma, ``INDRA: A Class of Interconnection Networks with Redundatnt Paths,'' 1984 Real-Time System Symp., Computer Society Press, Silver Spring, Md., 1984, pp.153-164.

[155]

R.J.McMillen and H.J.Siegel, ``A Fault-Tolerant Multistage Interconnection Network for Multiprocessor Systems Using Dynamic Redundancy,'' ISCA82, pp.63-72.

[156]

V.P.Kumar and S.M.Reddy, ``Augumented Shuffle-Exchange Multistage Interconnection Networks,'' Computer, June 1987, pp.30-40.

[157]

D.Cantor, ``On Nonblocking Switching Networks,'' Networks, Vol.1 No.4, 1971, pp.367-377.

[158]

K.Y.Lee, W.Hegazy, ``The Extra stage Gamma Network,'' ISCA86, pp.175-182.

[159]

L.Ciminiera and A.Serra, ``A Connecting Network with Fault Tolerance Capabilities,'' IEEE Trans. Computers, June 1986, pp.578-580.

[160]

S.M.Reddy and V.P.Kumar, ``On Fault Tolerant Multistage Interconnection Networks,'' ICPP84, pp.155-164.

[161]

D.S.Parker and C.S.Raghavendra, ``The Camma Network: A Multiprocessor Interconnection Network with Redundant Pathes,'' ISCA82, pp.73-80.

[162]

K.E.Batcher, ``The Flip Network in STARAN,'' ICPP76, pp.65-71.

[163]

H.Amano, `` A Fault Torelant Batcher Network,'' ICPP90, pp.I441-I444

[164]

C.Chan and H.Amano, `` An Extended Fault Torelant Batcher Network,'' IEEE Workshop on Fault Tolerant Paralle and Distributed systems, 1992, pp.209-216.

[165]

J.P.Shen, J.P.Hayes, ``Fault-Tolerance of Dynamic Full Access Interconnection Networks,'' IEEE Trans. on Computers, Vol.C-33, No.3. 1984. pp.241-248.

[166]

K.Padmanabhan and D.H.Lawrie, ``A Class of Redundant Path Mulitistage Interconnection Networks,'' IEEE Trans. on Computers, No.12. 1983. pp.1099-1108.

[167]

L.M.Ni and P.K.McKinley, "A Survey of Wormhole Routing Techniques in Direct Network", Computer, Feb. 1993. pp.62-76.

[168]

M.R.Samatham and D.K.Pladhan, "The De Bruijn Multiprocessor Network: A versatile Parallel Processing and Sorting Network for VLSI", IEEE Trans. on Computer, Vol.C-38, No.4, 1989. pp.567-581.

[169]

J.C.Bermond and C.Peyrat, "De Bruijn and Kautz Networks: A competitor for the Hypercube", North-Holland,1989.

[170]

D.K.Pradhan, "Fault-Tolerant Multiprocessor Link and Bus Network Architectures", IEEE Trans, Comput., Vol. C-34, No.1 1985. pp.35-45.

[171]

$B;y6L!":d0f!";38}!"(B ``$B9bJBNs7W;;5!(BEM-4$B$H$=$NJBNs@-G=I>2A(B,'' $BEE;R>pJsDL?.3X2qO@J8;o(B, J75-D-I,No.8,1992. pp.607-614.

[172]

$B2#ED!">>2,!"2,K\!"9-Ln!":d0f!"(B ``$BD6JBNs8~$1Aj8_7k9gLV(BMDCE$B$NDs0F$HI>2A(B,'' $B>pJs=hM}3X2qO@J8;o(B, Vol.36, No.7, Jul. 1995. pp.1600-1609.

[173]

S.B.Akers, D.Harel and B.Krishnamurthy, "The Star Graph: An attractive alternative to the n-cube", ICPP87, pp.393-400.

[174]

F.P.Preparata and J.Vuillemin, "The cube-coonected cycles: A versatile network for parallel computation", Comm, ACM, Vol.24, No.5, 1981. pp.300-309.

[175]

K.Hwang and J.Ghosh, "Hypernet: A Commuinication-Efficient Architecture for Constructing Massibely Parallel Computers", IEEE Trans. on Computers. Vol.36, No.12, 1987. pp.1450-1466.

[176]

N.Tzeng and S.Wei, "Enhanced Hypercubes", IEEE Trans. on comput, Vol.40, No.3, Mar. 1992. pp.284-294

[177]

S.Latifi And A.E.Amawy, ``On folded hypercubes,'' ICPP89. pp.I180-I187.

[178]

J.M.Kumar and M.Patnaik, "Extended Hypercune: A Hierarchical Interconnection Networks of Hypercubes", IEEE Trans. on Computers., Vol.3, No.1, 1992. pp.45-57.

[179]

$B@P@n(B $BJY(B, ``$BD>7B$H@\B3?t$,>.$5$$9bJBNs7W;;5!8~$-%M%C%H%o!<%/(B CCTcube,'' $BEE;R>pJsDL?.3X2qO@J8;o(B, J73-D-I, No.6, 1992. pp.599-602.

[180]

A.H.Esfahanian, L.M.Ni, and B.E.Sagan, ``The Twisted N-CUbe with Application to Multiprocessing,'' IEEE Trans. Comput., Vol.40, No.1, 1991. pp.88-93.

[181]

K.Efe, "The Crossed Cube Architecture for Prallel Processing", IEEE Trans. on comput, Vol.3, No.5, 1992. pp.513-524.

[182]

R.Beivide and et al., "Optimal Distance Networks of Low Degree for parallel computers", IEEE Trans. on Computers, Vol.C-40, No.10, 1991. pp.1109-1124.

[183]

R.Miller, V.K.P-Kumar, D.I.Reisis and Q.F.Stout, "Meshes with recofigurable buses", MIT conference on advanced researchin VLSI, 1988.

[184]

H.Li and M.Maresca, "Poly>morphic-Torus Network", IEEE Trans. on comput, Vol. C-38, No.9, 1989. pp.1345-1351.

[185]

$B>>;3(B, $B@D;3(B, ``$B:F5"%H!<%i%97k9g%"!<%-%F%/%A%c(B,'' $B>pJs=hM}3X2qO@J8;o(B, Vol.33, No.2, 1992. pp.49-58.

[186]

$BNS!"(BChuang, $BKY9>!"(B ``$BJ,3d:F9=@.2DG=$J%H!<%i%9%M%C%H%o!<%/!"(B'' JSPP93. pp.175-182.

[187]

F.T.Boesch and R.Tindel, "Circulants and their connectivities", "J. of graph theory", Vol.8, 1985. pp.487-499.

[188]

$B4d:j!"(B $B%$%<%j!":4F#!"(B ``$BD6JBNs7W;;5!MQ(BVLSI$B$KE,$7$?7k9gLV$N0lDs0F(B,'' $BEE;R>pJsDL?.3X2qO@J8;o(B, J75-D-I, No.8, 1992. pp.583-591.

[189]

$BML!"E7Ln!"pJsDL?.3X2qO@J8;o(B, J78-D-I, No.2, 1995. pp.118-128.

[190]

K.W.Tang and S.A.Padubidri, "Routing and diameter analysis of diagonal mesh networks", ICPP92, pp.I143-I150.

[191]

$BNk2,!"F#ED!"CfB.Lx(B ``$BD6JBNs(BAI$B%^%7%s$N9=A[(B,'' $BBh(B35$B2s>p=hA4Bg(B,3C5,1987.

[192]

$BCf1[!"EDCf!"_@Cf!"LLED(B ``$BJBNs7W;;5!(BH2P$B$NMWAG%W%m%;%C%54VHsF14|%G!<%?DL?.(B,'' $BBh(B38$B2s>p=hA4Bg(B,6T7,1989.

[193]

T.Fukazawa et al., ``R256: a research parallel processor for scientific computation", ISCA89, pp.344-351.

[194]

T.H.Szymanski, "A Fiber-Optic Hypermesh for SIMD/MIMD machines", IEEE Supercomputing 90, 1990. pp.103-110.

[195]

T.H.Szymanski, "O(logN/loglogN) randomized routing in degree-logN Hypermeshes", ICPP91. pp.I443-I450.

[196]

$BLnLZ(B $BC#IW(B, ``$B2J3X5;=Q7W;;%7%_%e%l!<%7%g%sD6JBNs7W;;5!(BADENA,'' $B>pJs=hM}(B, Vol.32,No.4,1991. pp.377-387.

[197]

C.E.Leiserson, "Fat-trees: Universal netowrks for harware-efficient supercomputing", IEEE Trans. on comput, Vol.34, No.10, 1985. pp.892-901.

[198]

$BB [199]

$BB [200]

P.Kermani and L.Kleinrock, ``Virtual Cut-Through: A New Computer Communication Switching Techniques,'' Computer Networks, Vol.3, No.4 1979. pp.267-286.

[201]

W.J.Dally, ``Virtual Channel Flow Control,'' IEEE Trans. Parallel and Distributed Systems, Vol.3, No.2, Mar.1992. pp.194-205.

[202]

M.P.Merlin, J.P.Schweitzer, ``Deadlock Avoidance in Store-and-Forward Netowrks -1: Store-and-Forward Deadlock,'' IEEE Trans. on Comm. Vol. COM-28, No.3, 1980. pp.345-354.

[203]

$BKY9>!"@PH*!"CS:d!"(B ``$BJBNs7W;;5!(BAP1000$B$K$*$1$kAj8_7k9gLV$N%k!<%A%s%0J}<0(B,'' $BEE;R>pJsDL?.3X2qO@J8;o(BD-I, Vol.J75-D-I No.8, 1992. pp.600-606.

[204]

W.J.Dally and C.L.Seitz, ``Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,'' IEEE Trans. on Comput. Vol.C-36, No.5, 1987. pp.547-553.

[205]

S.Konstantinidou and L.Snyder, ``Chaos router: architecture and performance,'' ISCA91, pp.212-221.

[206]

D.H.Linder and J.C.Harden, ``An adaptice and fault tolerant wormhole routing strategy for k-ary n-cubes,'' IEEE Trans. on Comput. Vol.C-40, No.1, 1991. pp.2-12.

[207]

A.A.Chien and J.J.Kim, ``Planar-Adaptive Routing: Low-cost Adaptive Networks for Multiprocessors,'' ISCA92. pp.268-277.

[208]

C.J.Glass and L.M.Ni, ``Maximally Fully Adaptive Routing in 2D Meshes,'' ISCA92. pp.278-287.

[209]

W.J.Dally and H.Aoki, ``Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels,'' IEEE Trans. on Parallel and Distributed Systems, Vol.4, No.4 1993. pp.466-475.

[210]

J.Duato, ``A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks,'' IEEE Trans. on Parallel and Distributed Systems, Vol.4 No.12, 1993. pp.1320-1331.

[211]

J.Duato, ``A Necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks,'' ICPP94. pp.I142-I149.

[212]

$BA>:,!"KQ!"CfB [213]

C.L.Seitz, ``The Cosmic Cube,'' Comm. ACM. Vol.28, NO.1 1985. pp.22-33.

[214]

C.W.Strevens, ``The Transputer,'' ISCA85. pp.292-300.

[215]

$BLZB [216]

$B%@%K%(%k!&%R%j%9Cx!"4nO"@n(B $BM%Lu(B ``$B%3%M%/%7%g%s%^%7%s(B,'' $B%Q!<%=%J%k%a%G%#%"!"(B1990.

[217]

T.Eicken, D.E.Culler, S.C.Goldstein, K.E.Schauser, ``Active Messages: a Mechanism for Integrated Communication and Computation,'' ISCA92. pp.256-266.

[218]

$B=BBt?J(B, ``$BD6N)J}BN7k9g$HBg0h%P%97k9g$h$j@.$k0lAj8_7k9g%b%G%k$K$D$$$F(B,'' $B>pJs=hM}3X2qO@J8;o!"(BVol.32, No.4 1991. pp.533-543.

[219]

B.W.Arden and H.Lee, ``Analysis of Chordal Ring Network'', IEEE Trans. on Computers, C-30, No.4, 1981, pp.291-295.

[220]

J.J.Park, K.Y.Chwa, ``Recursive Circulant: A New Topology for Multicomputer Networks,'' ISPAN94, pp.73-80.

[221]

C.Chen, D.P.Agrawal, R.Burke, ``dBCube: A New Class of Hierarchical Multiprocessor Interconnection Networks with Area Efficient Layout,'' IEEE Trans. on Computers, Vol.4, No.12, 1993. pp.1332-1344.

[222]

W.J.Dally, ``Express Cubes: Improving the performance of k-ary n-cube interconnectin networks,'' IEEE Trans. on Computers, Vol.40, No.9 1991. pp.1016-1023.

[223]

W.J.Hsu, ``Fibonacci Cubes: A New Interconnection Topology'', IEEE Trans. on parallel and distributed systems, Vol.4, No.1, 1993. pp.3-12.

[224]

$BLn!9BNJBNs7W;;$NKd$a9~$_2DG=$JBP>N%M%C%H%o!<%/(B,'' CPSY94-50, 1994.

[225]

Q.M.Malluhi and M.A.Bayoumi, ``The Hierarchical Hypercube: A New Interconnection Topology for Massively Parallel Systems,'' IEEE Trans. on Parallel and Distributed Systems, Vol.5, No.1 1994. pp.17-30.

[226]

E.Ganesan and D.K.Pradhan, ``The Hyper-deBruijn Networks: Scalable Versatile Architecture'', IEEE Trans. on Parallel and Distributed Systems'', Vol.4, No. 9, 1993. pp.962-978.

[227]

D.A.Carlson, ``Performing Tree and Prefix Computations on Modified Mesh-Oriented Parallel Computer,'' ICPP85,

[228]

$B0f8}!"KY8}!"(B ``$BD6JBNs7W;;5!8~$-%W%m%;%C%57k9gLV(BSRT,'' CPSY95-69, 1995.

[229]

$B=);3!">.CS!"EDCf!"(B ``$BJ,;66&M-%a%b%j7?D6JBNs7W;;5!$K$*$1$k%G%#%l%/%H%jJ}<0$HAj8_7k9gLV$K(B $B$D$$$F(B,'' CPSY94-49, 1994.

[230]

$B9)F#!"J!Eh!"9%BB [231]

R.A.Finkel, M.H.Solomon, ``Processor Interconnection Strategies,'' IEEE Trans. Computer, Vol.C-29, No.5, 1980. pp.443-454.

[232]

R.A.Finkel, M.H.Solomon, ``The Lens Interconnection Strategy,'' IEEE Trans. Computer, Vol.C-30, No.12, 1981. pp.360-371.

[233]

$B8EED!"BgM'!"4d:j!"(B ``$B3J;R$K%j%s%/$rIU2C$9$k [234]

A.M.Despain, D.A.Patterson, ``X-TREE: A Tree Structured Multiprocessor Computer Architecture,'' ISCA78, pp.144-151.

[235]

$B?7@$Be%3%s%T%e!<%?5;=Q3+H/5!9=JT(B, ``$BJBNs%"!<%-%F%/%A%c$K4X$9$k5;=QF08~D4::8&5fJs9p=q(B,'' $BJ?@.(B5$BG/EYHG(B.

[236]

$B@PH*(B, $B0pLn(B, $BKY9>(B, $B@6?e(B, $BCS:d(B, ``$B9bJBNs7W;;5!(B AP-1000 $B$N%"!<%-%F%/%A%c(B,'' $BEE;R>pJsDL?.3X2qO@J8;o(B, J75-D-1-8, pp.637-645

[237]

$BGO>l(B,$B5H1J(B, ``$BJBNs%*%V%8%'%/%H;X8~%H!<%?%k%"!<%-%F%/%A%c(B A-NET$B$K$*$1$k8@8l$H%"!<%-%F%/%A%c$NE}9g(B,'' $BEE;R>pJsDL?.3X2qO@J8;o(B, Vol.J75-D-I, No.8, 1992.

[238]

H.Kadota et.al, ``Parallel Computer ADENART -Its Architecture and Application-,'' ICS91, pp.1-8.

[239]

$B@P0f8wM:(B, ``$B9bJBNs7W;;5!(BCAP,'' $BEE;R>pJsDL?.3X2qO@J8;o(B, Vol.J71-D, NO.8, pp.1375-1382, 1988.

[240]

$BCfED(B $BB>(B, ``$BJBNs2sO)%7%_%e%l!<%7%g%s%^%7%s(BCenju,'' $B>pJs=hM}(B,Vol.31, No.5, pp.593-601, 1990.

[241]

$B4];3(B,$BB>(B, ``$BJBNs%3%s%T%e!<%?(BCenju-3$B$N(B $B%"!<%-%F%/%A%c$H$=$NI>2A(B,'' $BEE;R>pJsDL?.3X2qO@J8;o(B Vol.J78-D-I, No.2, pp.73-81, 1995.

[242]

$B%@%K%(%k!&%R%j%9Cx(B,$B4nO"@nM%Lu(B, ''$B%3%M%/%7%g%s%^%7%s(B,'' $B%Q!<%=%J%k%a%G%#%"(B,1990.

[243]

$BCfED(B,$BKY8}(B,$B9bLZ(B,$B@nE:(B,$B=E0f(B,''$B%/%i%9%?J}<0(B $B%^%k%A%W%m%;%C%5%7%9%F%`(B,'' $BEE;R>pJsDL?.3X2q;o(B, Vol.J70-D No.8, pp.1469-1477, 1987.

[244]

$BF|K\%7%s%-%s%0%^%7%s%:(B($B3t(B), $B%3%M%/%7%g%s%^%7%s(B CM-5, 1991.

[245]

$BF#ED(B,$BB>(B ``$B%a%b%j=8@Q7?(BSIMD$B%W%m%;%C%5(BIMAP,'' $BEE;R>pJsDL?.3X2q;o(B, Vol.J78-D-I No.2, pp.82-90, 1995.

[246]

Intel Corp., Paragon XP/S product overview, 1991.

[247]

$BF|K\%/%l%$(B($B3t(B), CRAY MPP $B%W%m%8%'%/%H(B, 1992$B%;%_%J!<;qNA(B.

[248]

S.J.Stolfo, ``Five Parallel Allgorithms for Production SYstem Execution on the DADO Machine,'' AAAI '84, pp.300-306, 1984.

[249]

B.J.Smith, ``Architecture and applications of the HEP multiprocessor computer system,'' Proc. of SPIE, pp.241-248, 1985.

[250]

Meiko. CS-2 Product Description, 1992.

[251]

Kendall Square Research. Technical Summery, 1992.

[252]

Parsytec GmbH. Parsytec GC Technical Summery, 1991.

[253]

$BF|K\(BNCR, $B@$3&:G9bB.$N(BUNIX$BHFMQ5!(B NCR3600 $BD6JBNs=hM}%3(B $B%s%T%e!<%?H/Gd(B, NCR journal, 303, 1992.

[254]

C.L.Seitz, ``THE COSIC CUBE,'' CACM, vol.28 No.1, pp.22-33, Jan.1985

[255]

K.A.Frenkel: Evaluating Two Massively Parallel Machines, CACM, Vol.29, No.7, pp.752-758, 1986

[256]

R.Kober : The Multiprocessor System SMS201, COMPCON Fall, pp.225-230, 1978

[257]

Swan, R.J., et al. : The implementation of the CM\* multiprocessor, Proc. of NCC, 46, pp.645-655, 1977

[258]

Wulf, W.A. and S.P Harbison, ``Reflections in a pool of Processors: an experience report on C.mmp\/Hydra,'' Carnegie-Mellon University Dept. of Computer Science Report CMU-CS-78-103

[259]

W.J.Dally, et al. ``The J-machine: A fine grain concurrent computer,'' Proc. 12th IFIP Congress.

[260]

S.Rorkar, et.al, ``iWarp: An integrated solutin to high speed parallel computing,'' Supercomputing'88.

[261]

$B9b66(B, $B1sF#(B, $B>>Hx(B, $BDHC+(B : $BFs?JLZ7k9g7W;;5!(B Coral 68K$B$N3+H/$H(B $B$=$NI>2A(B, $B>pJs=hM}3X2qO@J8;o(B, Vol30, No1, pp.46-57, 1989.

[262]

$BCf_74n;0O:(B, $BKQ(B $BBYM4(B, $BCfB<(B $B9((B, $BCfED0iCK(B, $B;32<5A9T(B, $B4d:jMN0l(B: CP-PACS $B$N%"!<%-%F%/%A%c$N35MW(B, $B>pJs=hM}3X2q8&5fJs9p(B, 94-ARC-108, pp.57-64, 1994.

[263]

$BKv5H(B,$B:G=j(B,$BM-ED(B,''$B3,AX9=B$9bB?=EJBNs7W;;5!(B $BpJs=hM}3X2qO@J8;o(B Vol.25, No.5, pp.813-822, 1984.

[264]

T.Highchi et,al. ``IXM2: A Parallel Associative Processor,'' ISCA91, pp.22-33.

[265]

$B@1LnNO(B,''PAX$B%3%s%T%e!<%?(B,'' $B%*!<%` [266]

$B3^86GnFA(B, $B@.ED@?G7=u(B, $B66K\(B $B?F(B: OSCAR $B$N%"!<%-%F%/%A%c(B, $B?.3XO@(B (D), J71-D, 8, 1988.

[267]

$B>.H*(B,$BB>(B ``$B%V%m!<%I%-%c%9%H%a%b%j$r;}$DJBNs7W;;5!$N;n:n(B,'' $BEE;RDL?.3X2qEE;R7W;;5!8&5f2q(B EC31-37, 1981.

[268]

$B8EED(B,$B5H@n(B,$B4d:j(B, ``$BJ|Aw(B+$B5s [269]

$B>.CS(B, $BEDCf(B: $BJBNs?dO@%(%s%8%s(B PIE64, $BJBNs%3%s%T%e!<%?%"!<%-%F%/(B $B%A%c(B, bit$BNW;~A}4)(B, Vol.21, No.4, pp.488-497, 1989.

[270]

$B:d0f(B,$BB>(B,'' $BD6JBNs7W;;5!(BRWC-1$B$N4pK\9=A[(B,'' JSPP'93, pp.87-94.

[271]

$BBgB<(B $B0l$[$+(B : $B%3%s%T%e!<%?%0%i%U%#%C%/%9%7%9%F%`(B LINKS-1$B$K$*(B $B$1$kJBNs=hM}$N@-G=I>2A(B, $BEE;R>pJsDL?.3X2qO@J8;o(B, J68-D, 4$B9f(B, pp.733-740. 1985

[272]

Gearge H.Barnes, Richard M.Brown, Masao Kato, David J,Kuck, Daniel L.Slotnick: The ILLIAC IV Computer, IEEE Trans. on Computers, Vol.C-17, No.8, pp.746-757, Aug. 1968.

[273]

P.M Flandars, et al.: Experience gained in programming the pilot DAP, a parallel processor with 1024 processing elements, Parallel Computer-Parallel Mathematics, pp.269-273, IMACS, North Holland, 1977.

[274]

K.E.Batcher: STARAN Parallel Processor System Hardware, NCC, pp.405-410, 1974

[275]

$B9b665AB$JT(B, ``$BJBNs=hM}5!9=(B'', $BBh(B3$B>O(B,$B4]A1(B,1989.

[276]

$B>>ED(B, $B4%(B, $BO; [277]

$B0pMU(B, ``$B:GBg(B1$BK|(B6384$B%W%m%;%5$rEk:\$9$k(B 1.3GFLOPS $B$N(B SIMD $B%^(B $B%7%s(B,'' $BF|7P%(%l%/%H%m%K%/%9(B, 6-25: 102-103, 1990.

[278]

$BEgED(B, $BJ?LZ(B, $B@>ED(B, ``$B2J3X5;=Q7W;;MQ%G!<%?6nF0(B $B7W;;5!(B Sigma-I $B$N%"!<%-%F%/%A%c(B,'' $B?.3XJs(B, EC83-20, 1983.

[279]

S.Sakai, et. al. ``An Architecture of a Dataflow Single Chip Processor,'' ISCA89, pp.46-53.

[280]

$B?7Ui(B,$BIYED(B,$BGk86(B,''3$BpJsDL?.3X2qO@J8;o(B,J71-D, 8, pp.1446-1453, 1988.

[281]

Papadopoulos,G.M. and Traub,K.R. : Monsoon: An explicit token-store architecture, Proc. 17th Annu. Int. Symp. Computer Architecture, pp.342-351, 1991.

[282]

A. Davis, S.V.Robinson, ``The architecuture of the FAIM-I Symbolic Multiprocessoing System,'' Proc. IJCAL, pp.32-38, 1985.

[283]

N.Matelan, ``The Flex/32 Multicomputer,'' ISCA85. pp.209-213.

[284]

R.Perron C. Mundie, ``The architecture of the Alliant FX/8 computer,'' CompCon Spring, pp.390-393, 1986.

[285]

$B>.CS(B,$BBg?9(B,$B:4!9LZ(B, ``$BO@M}%7%_%e%l!<%7%g%s%^%7%s$N(B $B%O!<%I%&%'%"9=@.(B,'' $B>pJs=hM}3X2qO@J8;o(B, Vol.25, No.5, pp.873-881, 1984.

[286]

$BKRLn(B,$B;0LZ(B,''PAA: $BHFMQ%7%_%e%l!<%?(BHOSS$B$K$*$1$kJBNs(B $B1i;;%5%V%7%9%F%`(B,'' $B?.3XJs(BEC82-27, 1982.

[287]

$BEE;R9)6H?66=6(2q(B, ``$B%_%K%3%s%T%e!<%?$N5;=QF08~$K4X$9$k(B $BD4::Js9p=q(B,'' 62-C-582, 1987.

[288]

T.Sawabe, T.Fujii, S.Nakada, N.Ohta, S.Ono, ``A 15GFLOPS parallel DSP system for super high definition image processing,'' IEICE Trans. Fundamentals, Vol.E75-A, No.7, pp.786-793. 1992.

[289]

$BEDCf(B,$BBPLZ(B,$B>>K\(B,$BJ?LZ(B, ``$BJBNs7W;;5!%W%m%H%?%$%W$*Cc$N?e(B5$B9f(B.'' $BBh(B3$B2s(BFPGA/PLD Conference and exibition, pp. 505-513, 1995.

[290]

H.J.Siegel, ``PASM: A partitionable SIMD/MIMD System for Image Processing and Pattern Recognition,'' IEEE Trans. on Computers, C-30, No.12, pp.934-945, 1981.

[291]

N.Tanabe, et.al. ``Base-m n-cube: High performance interconnection networks for highly parallel computer Prodigy,'' ICPP91, pp.I509-516

[292]

H.Amano, T.Boku, T.Kudoh, ``$(SM)^2$-II: A Large Scale Multiprocessor for Sparse Matrix Calculations,'' IEEE Trans. on Computers,. Vol.39, No.7 1990.

[293]

$BLnB<@k@8(B, ``IBM Power $BJBNs%5!<%P(B9076 SP2$B%7%9%F%`(B,'' $BEE;R>pJsDL?.3X2qO@J8;o(B Vol.J78-D-I, No.2, pp.68-72, 1995.

[294]

``$B1i;;=hM}@-G=$r6/2=$7$?D6JBNs%3%s%T%e!<%?(B,'' $BF|N)I>O@(B Vol.77, No.11, pp.825, 1995.

[295]

M.Kitsuregawa, et. al. ``Overview of the Super Database Computer (SDC-I),'' IEICE Trans. electron. Vol.E77-C, NO.7, 1994.

[296]

S.Frank A.Inselberg, ``Synapse tightly coupled multiprocessors: a new approach to solve old problems,'' Proc. NCC, pp.41-50, 1984.

[297]

Fujitsu Ltd. Vector Parallel Supercomputer VPP500, 1992 $B%;%_%J!<;qNA(B.

[298]

$B0KF#Bs(B,$B>.H*@55.(B, ''$B%H!<%i%9!&%j%s%0!&%P%93,AX7?JBNs%^%7%s(B,'' $B>p=h8&Js(B ARC-112-7, 1995.

[299]

G.F.Pfister, et.al. ``The IBM Research Parallel Processor Prototype,'' ICPP85, pp.764-789.

[300]

M.M.Dennuau, ``The Yorktown Simulation Engine,'' 19th DAC, pp.60-64, 1982.

[301]

$B>.CS(B,$BCfED(B,$B3a86(B,''$B3,AX%l%Y%kJBNsO@M}%7%_%e%l!<%7%g%s(B $B%^%7%s(BMAN-YO,'' $BEE;R>pJsDL?.3X2qO@J8;o(B, Vol. J71-D, No.8 pp.1391-1398, 1988.