PARALLEL CONTEXT-SENSITIVE COMPILATION

被引：1

作者：

ASTHAGIRI, CR ^{[1
]}

POTTER, JL ^{[1
]}

机构：

[1] KENT STATE UNIV,DEPT MATH & COMP SCI,KENT,OH 44242

来源：

SOFTWARE-PRACTICE & EXPERIENCE | 1994年 / 24卷 / 09期

关键词：

CONTEXT-SENSITIVE COMPILATION; MASSIVE PARALLELISM; ASSOCIATIVE PROCESSING; SIMD COMPUTERS; PATTERN MATCHING;

D O I：

10.1002/spe.4380240903

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

The searching power of massively parallel associative computers is an under used and under investigated capability that can be used to facilitate software development. This paper describes the development of a context sensitive compiler for pattern-matching languages using that searching power. The described compiler was implemented on the STARAN parallel computer and the compiled OPS5 programs were also executed on the STARAN obtaining an estimated throughput of 6000 rules per second. The described compilation of production rules into equivalent procedural rules is completely data parallel, with the degree of parallelism depending on the number of tokens in the program being compiled. During any one step of the context-sensitive analysis, the entire program is processed in constant time.

引用

页码：801 / 822

页数：22

共 16 条

[1] BAKER JW, 1990, 3RD SYMPOSIUM ON THE FRONTIERS OF MASSIVELY PARALLEL COMPUTATION, P110, DOI 10.1109/FMPC.1990.89446
[2] BATCHER KE, 1974, NATIONAL COMPUTER C, P406
[3] RETE A FAST ALGORITHM FOR THE MANY PATTERN MANY OBJECT PATTERN MATCH PROBLEM
FORGY, CL
[J]. ARTIFICIAL INTELLIGENCE, 1982, 19 (01) : 17 - 37
[4] FOSTER CC, 1976, CONTEXT ADDRESSABLE
[5] HIGH-SPEED IMPLEMENTATIONS OF RULE-BASED SYSTEMS
GUPTA, A
FORGY, C
NEWELL, A
[J]. ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1989, 7 (02): : 119 - 146
[6] GUPTA A, 1984, 13TH P INT C PAR PRO, P83
[7] Hillis WD, 1985, CONNECTION MACHINE
[8] HILYER BK, 1986, J PARALLEL DISTRIBUT, V3, P236
[9] Marcotty M., 1986, PROGRAMMING LANGUAGE
[10] MIRANKER DP, 1987, JUL P AAAI 87, P42

← 1 2 →