Can I read Extracting Task-level Parallelism on EtoBox?

Extracting Task-level Parallelism by Milind Girkar; Constantine D. Polychronopoulos is a Computer Science article available to read on EtoBox.

What is Extracting Task-level Parallelism about?

Automatic detection of __task-level parallelism__ (also referred to as functional, DAG, unstructured, or thread parallelism) at various levels of program granularity is becoming increasingly important for parallelizing and back-end compilers. Parallelizing compilers detect iteration-level or coarser granularity parallelism which is suitable for parallel computers; detection of parallelism at the statement-or operation-level is essential for most modern microprocessors, including superscalar and VLIW architectures. In this article we study the problem of detecting, expressing, and optimizing task-level parallelism, where “task” refers to a program statement of arbitrary granularity. Optimizing the amount of functional parallelism (by allowing synchronization between arbitrary nodes) in sequential programs requires the notion of __precedence__ in terms of paths in graphs which incorporate control and data dependences. Precedences have been defined before in a different context; however, the definition was dependent on the ideas of parallel execution and time. We show that the problem of determining precedences statically is NP-complete. Determining precedence relationships is useful

Who reads Extracting Task-level Parallelism?

Author

Milind Girkar; Constantine D. Polychronopoulos

Publisher

ACM

Published

1995

Language

EN

Field

Computer Science (Physical Sciences)