Parallel attribute evaluation: structure of evaluators and detection of paralleism

Kuiper, M.F.; Swierstra, S. Doaitse

doi:10.1007/3-540-53101-7_5

Cited by 4 publications

(5 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…None of them considered complex tree traversals as attribute grammars. On the other hand, there have been many studies on parallel evaluation of attribute grammars [3], [14], [16], [17], [19], [23], [30], [31], but most of them do not guarantee parallel speedups. A notable exception is Reps' scan grammars [30], which provided an efficiency-guaranteed parallel implementation for an attribution that scans leaves by using an associative operator.…”

Section: Related Workmentioning

confidence: 99%

Using Algebraic Properties and Function Fusion to Evaluate Tree Accumulations in Parallel

Morihata

2019

Journal of Information Processing

View full text Add to dashboard Cite

Parallel evaluation of tree processing using accumulation parameters tends to be difficult because the accumulation parameters may introduce data dependencies between computations for subtrees. Some proposals have broken these data dependencies by using algebraic properties such as associativity and commutativity, but, none has achieved both the capability of complex tree traversals like attribute grammars and a theoretical guarantee of parallel speedup. This paper proposes a tree processing language based on macro tree transducers and provides a parallel evaluation algorithm for programs written in the language. The language can express complex accumulations like attribute grammars, and moreover, the number of parallel computational steps for evaluation is proportional to the height of the input tree. This paper also shows that combining the proposed approach with function fusion for macro tree transducers leads to improvement in the parallel computational complexity. Although comparable complexity improvement can be obtained from known parallel algorithms, the proof and parallel evaluation algorithm here are remarkably simpler.

show abstract

Section: Related Workmentioning

confidence: 99%

Using Algebraic Properties and Function Fusion to Evaluate Tree Accumulations in Parallel

Morihata

2019

Journal of Information Processing

View full text Add to dashboard Cite

show abstract

“…All that is known is that the input will be structured according to the productions of the AG. It turns out however that grammar analysis yields good results which can serve as a basis for an appropriate input division at run time ( [15]). Hence the latter approach is followed here.…”

Section: The Construction Of Segmentsmentioning

confidence: 99%

“…Instead there is only imprecise information about the dependency graph at run time. Grammar analysis can be a basis for horizontal melting and for tree oriented segments [15] suggests a method for computing independent segments. For the more general similarly partitioned AGs an automatic method still is a research topic.…”

Section: Coarse Grain Segmentsmentioning

confidence: 99%

“…Hence the vertical melting can be achieved through the same efficient mechanisms as the context switches in sequential evaluation such as recursive descent or maintenance of a stack. Although similarly partitioned AGs are less flexible than arbitrary grouping of attributes it is a generalization of tree oriented segments (used in [15] and [2]), because with the restriction that "all attributes of a symbol be in one segment" tree oriented segments are obtained.…”

Section: The Construction Of Segmentsmentioning

confidence: 99%

“…Since parallel computers are emerging more and more, there are investigations about how the generated programs can be executed (and thus hopefully be sped up) on these machines ( [12], [ll], [7], [15], [19]). …”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Parallel ordered attribute grammars

Klein¹

Proceedings of the 1992 International Conference on Computer Languages

View full text Add to dashboard Cite

Ordered Attributed Grammars (OAG) are extended f o r use on parallel computers. A partition of the attributes of a tree leads to parallel evaluation if each partition is taken care of by a separate process. Visit sequences f o r parallel ordered attribute gramm a r s ( P O A G ) are constructed and it is shown that the P O A G class i s of the s a n e power as the OAG class. The construction leads always t o deadlock free attribute evaluators. The approach taken provides a uniform basis for a wide range of implementations on parallel computers, allowing fine grain or coarse grain parallelism, shared m e m o r y or distributed memory architectures, with synchronous or asynchronous communication. Several kinds of partitions are discussed and some ezperimental results and experiences are described.

show abstract

A survey of parallel attribute evaluation methods

Jourdan

1991

Attribute Grammars, Applications and Systems

View full text Add to dashboard Cite

Parallel attribute evaluation: structure of evaluators and detection of paralleism

Cited by 4 publications

References 5 publications

Using Algebraic Properties and Function Fusion to Evaluate Tree Accumulations in Parallel

Using Algebraic Properties and Function Fusion to Evaluate Tree Accumulations in Parallel

Parallel ordered attribute grammars

A survey of parallel attribute evaluation methods

Contact Info

Product

Resources

About