In recent years, methods for analyzing and parallelizing sequential code using data analysis and loop transformations have been developed. These techniques have proved remarkably successful, and have been used to move from sequential to parallel codes, or to improve efficiency of existing parallel codes. Our research focuses on Fortran code optimisation for parallelisation in Shared Memory architectures by using data analysis and loop source-to-source transformations. Our optimisation strategy, although designed for OpenMP directives, is sufficiently general to be used for pure Fortran code. Our algorithm has been implemented as a tool called Automatic Guidance Module (AGM), and have received high evaluation scores from our industrial partn...
As it is widely known, multi-core computers are broadly used these days, and automatic parallelizati...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/19...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/16...
Current parallelizing compilers cannot identify a significant fraction of parallelizable loops becau...
Current parallelizing compilers cannot identify a significant fraction of parallelizable loops becau...
High Performance Fortran (HPF), as well as its predecessor FortranD,has attracted considerable atten...
Abstract. We present an ongoing research in the area of transforming existing sequential Fortran pro...
Shared-memory multiprocessor systems can achieve high performance levels when appropriate work paral...
High performance Fortran (HPF), as well as its predecessor FortranD, has attracted considerable atte...
Modern computers will increasingly rely on parallelism to achieve high computation rates. Techniques...
With the advent of Distributed Memory Machines (DMMs) numerous work have been undertaken to ease the...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/16...
The goal of this dissertation is to give programmers the ability to achieve high performance by focu...
Vienna Fortran, a machine-independent language extension to Fortran which allows the user to write p...
This work describes the development of a Fortran parsing tool, which extracts parallelising informat...
As it is widely known, multi-core computers are broadly used these days, and automatic parallelizati...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/19...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/16...
Current parallelizing compilers cannot identify a significant fraction of parallelizable loops becau...
Current parallelizing compilers cannot identify a significant fraction of parallelizable loops becau...
High Performance Fortran (HPF), as well as its predecessor FortranD,has attracted considerable atten...
Abstract. We present an ongoing research in the area of transforming existing sequential Fortran pro...
Shared-memory multiprocessor systems can achieve high performance levels when appropriate work paral...
High performance Fortran (HPF), as well as its predecessor FortranD, has attracted considerable atte...
Modern computers will increasingly rely on parallelism to achieve high computation rates. Techniques...
With the advent of Distributed Memory Machines (DMMs) numerous work have been undertaken to ease the...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/16...
The goal of this dissertation is to give programmers the ability to achieve high performance by focu...
Vienna Fortran, a machine-independent language extension to Fortran which allows the user to write p...
This work describes the development of a Fortran parsing tool, which extracts parallelising informat...
As it is widely known, multi-core computers are broadly used these days, and automatic parallelizati...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/19...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/16...