Lori L. Pollock
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Lori L. Pollock has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Anthony Danalis
University of Delaware, Department of Computer and Information Sciences, Newark, DE 19716 USA
1 shared publication Cheer‐Sun D. Yang
Computer Science Department, West Chester University of PA, West Chester, PA 19383, U.S.A.
1 shared publicationCindy Norris
Mathematical Sciences, Appalachian State University, Boone, NC 28608, U.S.A.
1 shared publication- David Binkley
Loyola University Maryland
1 shared publication - David C. Shepherd
Division of Computer Science and Engineering, Louisiana State University, Baton Rouge, LA, United States
1 shared publication - Dawn Lawrie
Johns Hopkins University, Baltimore, MD, USA
1 shared publication
Latest Publications
- 1 September 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 44 (11) , 1100-1111
Predicting Future Developer Behavior in the IDE Using Topic Models
While early software command recommender systems drew negative user reaction, recent studies show that users of unusually complex applications will accept and utilize command recommendations. Given this new interest, more than a decade after first attempts, both the recommendation generation (backend) and the user experience (frontend) should be revisited. In this work, we focus on recommendation generation.
- 1 September 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 44 (11) , 1100-1111
Predicting Future Developer Behavior in the IDE Using Topic Models
While early software command recommender systems drew negative user reaction, recent studies show that users of unusually complex applications will accept and utilize command recommendations. Given this new interest, more than a decade after first attempts, both the recommendation generation (backend) and the user experience (frontend) should be revisited. In this work, we focus on recommendation generation.
- 8 August 2013
- Published by Springer Nature in Empirical Software Engineering
- Vol. 19 (6) , 1754-1780
An empirical study of identifier splitting techniques
- 8 August 2013
- Published by Springer Nature in Empirical Software Engineering
- Vol. 19 (6) , 1754-1780
An empirical study of identifier splitting techniques
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15302075,p. 1-8
Automatic MPI application transformation with ASPhALT
This paper describes a source to source compilation tool for optimizing MPI-based parallel applications. This tool is able to automatically apply a "prepushing" transformation that causes MPI programs to aggressively send data as soon as it is available, thus improving communication-computation overlap and improving application performance. In this paper we present asphalt_transformer; the Open64-based component of our framework, ASPhALT, responsible for automatically performing the prepushing transformation. We also present an extensive study of the performance gains witnessed from automatically transformed codes. In particular, we demonstrate how different levels of aggregation affect the performance of parallel programs executing various computation kernels on different clusters. Furthermore, we discuss the differences in performance improvement between the hand-optimized and automatically optimized codes, as well as the effect of automation on time-to-solution.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15302075,p. 1-8
Automatic MPI application transformation with ASPhALT
This paper describes a source to source compilation tool for optimizing MPI-based parallel applications. This tool is able to automatically apply a "prepushing" transformation that causes MPI programs to aggressively send data as soon as it is available, thus improving communication-computation overlap and improving application performance. In this paper we present asphalt_transformer; the Open64-based component of our framework, ASPhALT, responsible for automatically performing the prepushing transformation. We also present an extensive study of the performance gains witnessed from automatically transformed codes. In particular, we demonstrate how different levels of aggregation affect the performance of parallel programs executing various computation kernels on different clusters. Furthermore, we discuss the differences in performance improvement between the hand-optimized and automatically optimized codes, as well as the effect of automation on time-to-solution.
- Open Access
Demand-driven Inlining in a Region-based Optimizer for ILP Architectures
Region-based compilation repartitions a program into more desirable compilation units using profiling information and procedure inlining to enable region formation analysis. Heuristics play a key role in determining when it is most beneficial to inline procedures during region formation. An ILP optimizing compiler using a region-based approach restructures a program to better reflect dynamic behavior and increase interprocedural optimization and scheduling opportunities. This paper presents an interprocedural compilation technique which performs procedure inlining on-demand, rather than as a separate phase, to improve the ability of a region-based optimizer to control code growth, compilation time and memory usage while improving performance. The interprocedural region formation algorithm utilizes a demand-driven, heuristics-guided approach to inlining, restructuring an input program into interprocedural regions. Experimental results are presented to demonstrate the impact of the algorithm and several inlining heuristics upon a number of traditional and novel compilation characteristics within a region-based ILP compiler and simulator.
Open AccessDemand-driven Inlining in a Region-based Optimizer for ILP Architectures
Region-based compilation repartitions a program into more desirable compilation units using profiling information and procedure inlining to enable region formation analysis. Heuristics play a key role in determining when it is most beneficial to inline procedures during region formation. An ILP optimizing compiler using a region-based approach restructures a program to better reflect dynamic behavior and increase interprocedural optimization and scheduling opportunities. This paper presents an interprocedural compilation technique which performs procedure inlining on-demand, rather than as a separate phase, to improve the ability of a region-based optimizer to control code growth, compilation time and memory usage while improving performance. The interprocedural region formation algorithm utilizes a demand-driven, heuristics-guided approach to inlining, restructuring an input program into interprocedural regions. Experimental results are presented to demonstrate the impact of the algorithm and several inlining heuristics upon a number of traditional and novel compilation characteristics within a region-based ILP compiler and simulator.
- 1 January 2003
- Published by Wiley in Software Testing, Verification and Reliability
- Vol. 13 (1) , 3-24
All‐uses testing of shared memory parallel programs
Parallelism has become a way of life for many scientific programmers. A significant challenge in bringing the power of parallel machines to these programmers is providing them with a suite of software tools similar to the tools that sequential programmers currently utilize. Unfortunately, writing correct parallel programs remains a challenging task.In particular, automatic or semi‐automatic testing tools for parallel programs are lacking. This paper takes a first step in developing an approach to providing all‐uses coverage for parallel programs. A testing framework and theoretical foundations for structural testing are presented, including test data adequacy criteria and hierarchy, formulation and illustration of all‐uses testing problems, classification of all‐uses test cases for parallel programs, and both theoretical and empirical results with regard to what can be achieved with all‐uses coverage for parallel programs. Copyright © 2003 John Wiley & Sons, Ltd.
- 1 January 2003
- Published by Wiley in Software Testing, Verification and Reliability
- Vol. 13 (1) , 3-24
All‐uses testing of shared memory parallel programs
Parallelism has become a way of life for many scientific programmers. A significant challenge in bringing the power of parallel machines to these programmers is providing them with a suite of software tools similar to the tools that sequential programmers currently utilize. Unfortunately, writing correct parallel programs remains a challenging task.In particular, automatic or semi‐automatic testing tools for parallel programs are lacking. This paper takes a first step in developing an approach to providing all‐uses coverage for parallel programs. A testing framework and theoretical foundations for structural testing are presented, including test data adequacy criteria and hierarchy, formulation and illustration of all‐uses testing problems, classification of all‐uses test cases for parallel programs, and both theoretical and empirical results with regard to what can be achieved with all‐uses coverage for parallel programs. Copyright © 2003 John Wiley & Sons, Ltd.
- 1 January 1999
- Published by Springer Nature
- p. 1282-1285
Tuple counting data flow analysis and its use in communication optimization
- 1 January 1999
- Published by Springer Nature
- p. 1282-1285
Tuple counting data flow analysis and its use in communication optimization
- 10 April 1998
- Published by Wiley in Software: Practice and Experience
- Vol. 28 (4) , 401-424
The design and implementation of RAP: a PDG-based register allocator
- 10 April 1998
- Published by Wiley in Software: Practice and Experience
- Vol. 28 (4) , 401-424
The design and implementation of RAP: a PDG-based register allocator
- 1 October 1997
- Published by Wiley in Software: Practice and Experience
- Vol. 27 (10) , 1199-1232
Issues and experiences in implementing a distributed tuplespace
- 1 October 1997
- Published by Wiley in Software: Practice and Experience
- Vol. 27 (10) , 1199-1232
Issues and experiences in implementing a distributed tuplespace