Speedup of ordinary programs
- Author:
- Utpal Banerjee
Abstract
No abstract available.
Cited By
- Sun P, Gabrielli G and Jones T Speculative vectorisation with selective replay Proceedings of the 48th Annual International Symposium on Computer Architecture, (223-236)
Anand K, Elwazeer K, Kotha A, Smithson M, Barua R and Keromytis A (2016). A Stack Memory Abstraction and Symbolic Analysis Framework for Executables, ACM Transactions on Software Engineering and Methodology, 25:2, (1-38), Online publication date: 16-May-2016.- Kotha A, Anand K, Creech T, ElWazeer K, Smithson M, Yellareddy G and Barua R (2015). Affine Parallelization Using Dependence and Cache Analysis in a Binary Rewriter, IEEE Transactions on Parallel and Distributed Systems, 26:8, (2154-2163), Online publication date: 1-Aug-2015.
- Oancea C and Rauchwerger L Scalable conditional induction variables (CIV) analysis Proceedings of the 13th Annual IEEE/ACM International Symposium on Code Generation and Optimization, (213-224)
- Samadi M, Hormati A, Lee J and Mahlke S Paragon Proceedings of the 5th Annual Workshop on General Purpose Processing with Graphics Processing Units, (64-73)
- Oancea C and Rauchwerger L Logical inference techniques for loop parallelization Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation, (509-520)
- Oancea C and Rauchwerger L (2012). Logical inference techniques for loop parallelization, ACM SIGPLAN Notices, 47:6, (509-520), Online publication date: 6-Aug-2012.
- Kotha A, Anand K, Smithson M, Yellareddy G and Barua R Automatic Parallelization in a Binary Rewriter Proceedings of the 2010 43rd Annual IEEE/ACM International Symposium on Microarchitecture, (547-557)
- Xu B, Qian J, Zhang X, Wu Z and Chen L (2005). A brief survey of program slicing, ACM SIGSOFT Software Engineering Notes, 30:2, (1-36), Online publication date: 1-Mar-2005.
- Horwitz S, Reps T and Binkley D (2004). Interprocedural slicing using dependence graphs, ACM SIGPLAN Notices, 39:4, (229-243), Online publication date: 1-Apr-2004.
- Burke M and Cytron R (2004). Interprocedural dependence analysis and parallelization, ACM SIGPLAN Notices, 39:4, (139-154), Online publication date: 1-Apr-2004.
- Petersen P and Padua D (1996). Static and Dynamic Evaluation of Data Dependence Analysis Techniques, IEEE Transactions on Parallel and Distributed Systems, 7:11, (1121-1132), Online publication date: 1-Nov-1996.
- Müller A and Rühl R Extending high performance Fortran for the support of unstructured computations Proceedings of the 9th international conference on Supercomputing, (127-136)
- Reps T and Rosay G (1995). Precise interprocedural chopping, ACM SIGSOFT Software Engineering Notes, 20:4, (41-52), Online publication date: 1-Oct-1995.
- Reps T and Rosay G Precise interprocedural chopping Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering, (41-52)
- Reps T, Horwitz S, Sagiv M and Rosay G (1994). Speeding up slicing, ACM SIGSOFT Software Engineering Notes, 19:5, (11-20), Online publication date: 1-Dec-1994.
- Reps T, Horwitz S, Sagiv M and Rosay G Speeding up slicing Proceedings of the 2nd ACM SIGSOFT symposium on Foundations of software engineering, (11-20)
- Zhu G, Xie L and Sun Z (1994). A path-based method of parallelizing C++ programs, ACM SIGPLAN Notices, 29:2, (19-24), Online publication date: 1-Feb-1994.
- Tseng S, King C and Tang C A New Loop Partition Method-Clustering Proceedings of the IFIP WG10.3. Working Conference on Architectures and Compilation Techniques for Fine and Medium Grain Parallelism, (53-64)
- Petersen P and Padua D Static and dynamic evaluation of data dependence analysis Proceedings of the 7th international conference on Supercomputing, (107-116)
- Psarris K On exact data dependence analysis Proceedings of the 6th international conference on Supercomputing, (303-312)
- Eisenbeis C and Sogno J A general algorithm for data dependence analysis Proceedings of the 6th international conference on Supercomputing, (292-302)
- Horwitz S and Reps T The use of program dependence graphs in software engineering Proceedings of the 14th international conference on Software engineering, (392-411)
- Wolfe M and Tseng C (1992). The Power Test for Data Dependence, IEEE Transactions on Parallel and Distributed Systems, 3:5, (591-601), Online publication date: 1-Sep-1992.
- Girkar M and Polychronopoulos C (1992). Automatic Extraction of Functional Parallelism from Ordinary Programs, IEEE Transactions on Parallel and Distributed Systems, 3:2, (166-178), Online publication date: 1-Mar-1992.
- Goff G, Kennedy K and Tseng C (1991). Practical dependence testing, ACM SIGPLAN Notices, 26:6, (15-29), Online publication date: 1-Jun-1991.
- Maydan D, Hennessy J and Lam M (1991). Efficient and exact data dependence analysis, ACM SIGPLAN Notices, 26:6, (1-14), Online publication date: 1-Jun-1991.
- Goff G, Kennedy K and Tseng C Practical dependence testing Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation, (15-29)
- Maydan D, Hennessy J and Lam M Efficient and exact data dependence analysis Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation, (1-14)
- Pugh W Uniform techniques for loop optimization Proceedings of the 5th international conference on Supercomputing, (341-352)
- Psarris K, Kong X and Klappholz D Extending the I test to direction vectors Proceedings of the 5th international conference on Supercomputing, (330-340)
- Wolfe M Experiences with data dependence abstractions Proceedings of the 5th international conference on Supercomputing, (321-329)
- Lu L and Chen M Subdomain dependence test for massive parallelism Proceedings of the 1990 ACM/IEEE conference on Supercomputing, (962-972)
- Klappholz D, Psarris K and Kong X On the perfect accuracy of an approximate subscript analysis test Proceedings of the 4th international conference on Supercomputing, (201-212)
- Klappholz D, Psarris K and Kong X (1990). On the perfect accuracy of an approximate subscript analysis test, ACM SIGARCH Computer Architecture News, 18:3b, (201-212), Online publication date: 1-Sep-1990.
- Su H and Yew P (1989). On data synchronization for multiprocessors, ACM SIGARCH Computer Architecture News, 17:3, (416-423), Online publication date: 1-Jun-1989.
- Su H and Yew P On data synchronization for multiprocessors Proceedings of the 16th annual international symposium on Computer architecture, (416-423)
- Hendren L and Nicolau A Intererence analysis tools for parallelizing programs with recursive data structures Proceedings of the 3rd international conference on Supercomputing, (205-214)
- Gikar M and Polychronopoulos C Compiling issues for supercomputers Proceedings of the 1988 ACM/IEEE conference on Supercomputing, (164-173)
- Horwitz S, Prins J and Reps T On the adequacy of program dependence graphs for representing programs Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (146-157)
- Uht A and Kolen J (1988). On the combination of hardware and software concurrency extraction methods, ACM SIGMICRO Newsletter, 19:1-2, (53-57), Online publication date: 1-Jun-1988.
- Li Z and Yew P (1988). Efficient interprocedural analysis for program parallelization and restructuring, ACM SIGPLAN Notices, 23:9, (85-99), Online publication date: 1-Sep-1988.
- Li Z and Yew P Efficient interprocedural analysis for program parallelization and restructuring Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems, (85-99)
- Wallace D Dependence of multi-dimensional array references Proceedings of the 2nd international conference on Supercomputing, (418-428)
- Brandes T The importance of direct dependences for automatic parallelization Proceedings of the 2nd international conference on Supercomputing, (407-417)
- Lichnewsky A and Thomasset F Introducing symbolic problem solving techniques in the dependence testing phases of a vectorizer Proceedings of the 2nd international conference on Supercomputing, (396-406)
- Allen F, Burke M, Cytron R, Ferrante J and Hsieh W A framework for determining useful parallelism Proceedings of the 2nd international conference on Supercomputing, (207-215)
- Polychronopoulus C and Banerjee U (1987). Processor Allocation for Horizontal and Vertical Parallelism and Related Speedup Bounds, IEEE Transactions on Computers, 36:4, (410-420), Online publication date: 1-Apr-1987.
- Uht A, Polychronopoulos C and Kolen J On the combination of hardware and software concurrency extraction methods Proceedings of the 20th annual workshop on Microprogramming, (133-141)
- Padua D and Wolfe M (1986). Advanced compiler optimizations for supercomputers, Communications of the ACM, 29:12, (1184-1201), Online publication date: 1-Dec-1986.
- Burke M and Cytron R (1986). Interprocedural dependence analysis and parallelization, ACM SIGPLAN Notices, 21:7, (162-175), Online publication date: 1-Jul-1986.
- Burke M and Cytron R Interprocedural dependence analysis and parallelization Proceedings of the 1986 SIGPLAN symposium on Compiler construction, (162-175)
- Banerjee U and Gajski D (1984). Fast Execution of Loops with IF Statements, IEEE Transactions on Computers, 33:11, (1030-1033), Online publication date: 1-Nov-1984.
- Banerjee U and Gajski D Fast execution of loops with if statements Proceedings of the 11th annual international symposium on Computer architecture, (126-132)
- Banerjee U and Gajski D (1984). Fast execution of loops with if statements, ACM SIGARCH Computer Architecture News, 12:3, (126-132), Online publication date: 1-Jun-1984.
- Abu-Sufah W, Kuck D and Lawrie D (1981). On the Performance Enhancement of Paging Systems Through Program Analysis and Transformations, IEEE Transactions on Computers, 30:5, (341-356), Online publication date: 1-May-1981.
- Kuck D, Kuhn R, Padua D, Leasure B and Wolfe M Dependence graphs and compiler optimizations Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (207-218)
Recommendations
Another view on parallel speedup
Supercomputing '90: Proceedings of the 1990 ACM/IEEE conference on SupercomputingIn this paper three models of parallel speedup are studied. They are fixed-size speedup, fixed-time speedup and memory-bounded speedup. Two sets of speedup formulations are derived for these three models. One set requires more information and gives more ...