Searching for authors named "Jeanne Ferrante" – sorted by Relevance.
-
Determining Asynchronous Pipeline Execution Times
- Asynchronous pipelining is a form of parallelism in which processors execute different loop tasks (loop statements) as opposed to different loop iterations. An asynchronous pipeline schedule for a loop is an assignment of loop tasks to processors, plus an order on instances of tasks assigned to the
- Cited by 3 (1 self) – Add To MetaCart
-
Determining Asynchronous Acyclic Pipeline Execution Times
- Pipeline execution is a form of parallelism in which subcomputations of a repeated computation, such as statements in the body of a loop, are executed in parallel. A measure of the execution time of a pipeline is needed to determine if pipelining is an effective form of parallelism for a loop, and t
- Cited by 3 (2 self) – Add To MetaCart
-
Static Slicing in the Presence of GOTO Statements
- A static program slice is an extract of a program which can help our understanding of the behavior of the program; it has been proposed for use in debugging, optimization, parallelization, and integration of programs. This paper considers two types of static slices: executable and non-executable. Ef
- Cited by 59 (3 self) – Add To MetaCart
-
ILP versus TLP on SMT
- Abstract By sharing processor resources among threads at a very fine granularity, a simultaneous multithreading processor (SMT) renders thread-level parallelism (TLP) and instruction-level parallelism (ILP) operationally equivalent. Under what circumstances are they performance equivalent? In this p
- Cited by 1 (0 self) – Add To MetaCart
-
Space-Limited Procedures: A Methodology for Portable High-Performance
- This paper presents the generic program approach to achieving portable high-performance. This approach has three phases. In the first, a generic program, defining a family of semantically-equivalent program variants, is written. In the second, the generic program is specialized to the variant that
- Cited by 15 (3 self) – Add To MetaCart
-
A Modal Model of Memory
- . We consider the problem of automatically guiding program transformations for locality, despite incomplete information due to complicated program structures, changing target architectures, and lack of knowledge of the properties of the input data. Our system, the modal model of memory, uses limited
- Cited by 9 (1 self) – Add To MetaCart
-
Phi-Predication for Light-Weight If-Conversion
- Predicated execution can eliminate hard to predict branches and help to enable instruction level parallelism. Many current predication variants exist where the result update is conditional based upon the outcome of the guarding predicate. However, conditional writing of a register creates a naming p
- Cited by 6 (1 self) – Add To MetaCart
-
Guard: Gossip used for autonomous resource detection
- A growing trend in the development and deployment of grid computing systems is decentralization. Decentralizing these systems helps make them more scalable and robust, but poses several challenges. In this paper we address one such problem-that of locating computing resources meeting specified requi
- Cited by 3 (0 self) – Add To MetaCart
-
Folklore Confirmed: Reducible Flow Graphs are Exponentially Larger
- Many program analysis techniques used by compilers are applicable only to programs whose control flow graphs are reducible. Node-splitting is a technique that can be used to convert any control flow graph to a reducible one. However, as has been observed for various node-splitting algorithms, there
- Cited by 4 (0 self) – Add To MetaCart

