Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(polyhedral model). Showing records 1 – 30 of 39 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

Degrees

Country

▼ Search Limiters


University of Illinois – Urbana-Champaign

1. Zuo, Wei. A polyhedral-based systemc modeling and generation framework for effective low-power design space exploration.

Degree: MS, Electrical & Computer Engr, 2016, University of Illinois – Urbana-Champaign

 With the prevalence of systems-on-chips there is a growing need for automation and acceleration of the design process. A classical approach is to take a… (more)

Subjects/Keywords: SoC design space exploration; polyhedral model

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zuo, W. (2016). A polyhedral-based systemc modeling and generation framework for effective low-power design space exploration. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/95498

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Zuo, Wei. “A polyhedral-based systemc modeling and generation framework for effective low-power design space exploration.” 2016. Thesis, University of Illinois – Urbana-Champaign. Accessed May 08, 2021. http://hdl.handle.net/2142/95498.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Zuo, Wei. “A polyhedral-based systemc modeling and generation framework for effective low-power design space exploration.” 2016. Web. 08 May 2021.

Vancouver:

Zuo W. A polyhedral-based systemc modeling and generation framework for effective low-power design space exploration. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2016. [cited 2021 May 08]. Available from: http://hdl.handle.net/2142/95498.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zuo W. A polyhedral-based systemc modeling and generation framework for effective low-power design space exploration. [Thesis]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/95498

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Colorado State University

2. Zou, Yun. Automatic parallelization of "inherently" sequential nested loop programs.

Degree: MS(M.S.), Computer Science, 2011, Colorado State University

 Most automatic parallelizers are based on detection of independent operations, and most of them cannot do anything if there is a true dependence between operations.… (more)

Subjects/Keywords: scan and reduction; recurrence equations; semiring; automatic parallelization; polyhedral model

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zou, Y. (2011). Automatic parallelization of "inherently" sequential nested loop programs. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/70841

Chicago Manual of Style (16th Edition):

Zou, Yun. “Automatic parallelization of "inherently" sequential nested loop programs.” 2011. Masters Thesis, Colorado State University. Accessed May 08, 2021. http://hdl.handle.net/10217/70841.

MLA Handbook (7th Edition):

Zou, Yun. “Automatic parallelization of "inherently" sequential nested loop programs.” 2011. Web. 08 May 2021.

Vancouver:

Zou Y. Automatic parallelization of "inherently" sequential nested loop programs. [Internet] [Masters thesis]. Colorado State University; 2011. [cited 2021 May 08]. Available from: http://hdl.handle.net/10217/70841.

Council of Science Editors:

Zou Y. Automatic parallelization of "inherently" sequential nested loop programs. [Masters Thesis]. Colorado State University; 2011. Available from: http://hdl.handle.net/10217/70841


Colorado State University

3. Yuki, Tomofumi. Beyond shared memory loop parallelism in the polyhedral model.

Degree: PhD, Computer Science, 2013, Colorado State University

 With the introduction of multi-core processors, motivated by power and energy concerns, parallel processing has become main-stream. Parallel programming is much more difficult due to… (more)

Subjects/Keywords: determinism; distributed memory; polyhedral model; tiling; uniformization; X10

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Yuki, T. (2013). Beyond shared memory loop parallelism in the polyhedral model. (Doctoral Dissertation). Colorado State University. Retrieved from http://hdl.handle.net/10217/78875

Chicago Manual of Style (16th Edition):

Yuki, Tomofumi. “Beyond shared memory loop parallelism in the polyhedral model.” 2013. Doctoral Dissertation, Colorado State University. Accessed May 08, 2021. http://hdl.handle.net/10217/78875.

MLA Handbook (7th Edition):

Yuki, Tomofumi. “Beyond shared memory loop parallelism in the polyhedral model.” 2013. Web. 08 May 2021.

Vancouver:

Yuki T. Beyond shared memory loop parallelism in the polyhedral model. [Internet] [Doctoral dissertation]. Colorado State University; 2013. [cited 2021 May 08]. Available from: http://hdl.handle.net/10217/78875.

Council of Science Editors:

Yuki T. Beyond shared memory loop parallelism in the polyhedral model. [Doctoral Dissertation]. Colorado State University; 2013. Available from: http://hdl.handle.net/10217/78875


Indian Institute of Science

4. Bhaskaracharya, Somashekaracharya G. Automatic Storage Optimization of Arrays Affine Loop Nests.

Degree: PhD, Faculty of Engineering, 2018, Indian Institute of Science

 Efficient memory usage is crucial for data-intensive applications as a smaller memory footprint ensures better cache performance and allows one to run a larger problem… (more)

Subjects/Keywords: Automatic Storage Optimization; Dataflow Programs; Affine Loop Nests; Lattice-Boltzmann Method; Diamond Tiling; Blur Filter - Interleaved Schedule; Blur filter - Tiled Execution; Affine Hyperplane; Polyhedral Model; Polyhedral Storage Optimizer; Polyhedral Compilation; PolyGLoT; Polyhedral Loop Transformation; Graphical Dataflow Language; Intra-Array Sorage Optimization; Arrays Storage Optimization; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bhaskaracharya, S. G. (2018). Automatic Storage Optimization of Arrays Affine Loop Nests. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/3208

Chicago Manual of Style (16th Edition):

Bhaskaracharya, Somashekaracharya G. “Automatic Storage Optimization of Arrays Affine Loop Nests.” 2018. Doctoral Dissertation, Indian Institute of Science. Accessed May 08, 2021. http://etd.iisc.ac.in/handle/2005/3208.

MLA Handbook (7th Edition):

Bhaskaracharya, Somashekaracharya G. “Automatic Storage Optimization of Arrays Affine Loop Nests.” 2018. Web. 08 May 2021.

Vancouver:

Bhaskaracharya SG. Automatic Storage Optimization of Arrays Affine Loop Nests. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2018. [cited 2021 May 08]. Available from: http://etd.iisc.ac.in/handle/2005/3208.

Council of Science Editors:

Bhaskaracharya SG. Automatic Storage Optimization of Arrays Affine Loop Nests. [Doctoral Dissertation]. Indian Institute of Science; 2018. Available from: http://etd.iisc.ac.in/handle/2005/3208


University of California – Irvine

5. Shivam, Aniket. Polygonal Iteration Space Partitioning using the Polyhedral Model.

Degree: Computer Science, 2016, University of California – Irvine

 Loop-nests in most scientific applications perform repetitive operations on array(s) and account for most of the program execution time. Traditional loop transformations, such as tiling,… (more)

Subjects/Keywords: Computer science; Loop Transformations; Non-Uniform Reuse Pattern Loops; Polygonal Iteration Space Partitioning; Polyhedral Model

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Shivam, A. (2016). Polygonal Iteration Space Partitioning using the Polyhedral Model. (Thesis). University of California – Irvine. Retrieved from http://www.escholarship.org/uc/item/6fr1t6km

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Shivam, Aniket. “Polygonal Iteration Space Partitioning using the Polyhedral Model.” 2016. Thesis, University of California – Irvine. Accessed May 08, 2021. http://www.escholarship.org/uc/item/6fr1t6km.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Shivam, Aniket. “Polygonal Iteration Space Partitioning using the Polyhedral Model.” 2016. Web. 08 May 2021.

Vancouver:

Shivam A. Polygonal Iteration Space Partitioning using the Polyhedral Model. [Internet] [Thesis]. University of California – Irvine; 2016. [cited 2021 May 08]. Available from: http://www.escholarship.org/uc/item/6fr1t6km.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Shivam A. Polygonal Iteration Space Partitioning using the Polyhedral Model. [Thesis]. University of California – Irvine; 2016. Available from: http://www.escholarship.org/uc/item/6fr1t6km

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Victoria

6. Leben, Jakob. A programming language based on recurrence equations and polyhedral compilation for stream processing.

Degree: Department of Computer Science, 2019, University of Victoria

 The work presented in this dissertation contributes to the field of programming lan- guage design and implementation for stream processing applications. There is a fast-expanding… (more)

Subjects/Keywords: programming language; stream processing; signal processing; recurrence equations; polyhedral model; functional language; compiler

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Leben, J. (2019). A programming language based on recurrence equations and polyhedral compilation for stream processing. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/11008

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Leben, Jakob. “A programming language based on recurrence equations and polyhedral compilation for stream processing.” 2019. Thesis, University of Victoria. Accessed May 08, 2021. http://hdl.handle.net/1828/11008.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Leben, Jakob. “A programming language based on recurrence equations and polyhedral compilation for stream processing.” 2019. Web. 08 May 2021.

Vancouver:

Leben J. A programming language based on recurrence equations and polyhedral compilation for stream processing. [Internet] [Thesis]. University of Victoria; 2019. [cited 2021 May 08]. Available from: http://hdl.handle.net/1828/11008.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Leben J. A programming language based on recurrence equations and polyhedral compilation for stream processing. [Thesis]. University of Victoria; 2019. Available from: http://hdl.handle.net/1828/11008

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Rice University

7. Srinivasa Murthy, Karthik. Code Generation for Extreme Scale Parallel Systems.

Degree: PhD, Engineering, 2017, Rice University

 Power consumption and fabrication limitations are increasingly playing significant roles in the design of extreme scale parallel systems. These factors are influencing system designers to… (more)

Subjects/Keywords: .5D algorithms; compiler; polyhedral model; cofence; phasers; modulo operations; collectives; code generation; vectorization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Srinivasa Murthy, K. (2017). Code Generation for Extreme Scale Parallel Systems. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/96060

Chicago Manual of Style (16th Edition):

Srinivasa Murthy, Karthik. “Code Generation for Extreme Scale Parallel Systems.” 2017. Doctoral Dissertation, Rice University. Accessed May 08, 2021. http://hdl.handle.net/1911/96060.

MLA Handbook (7th Edition):

Srinivasa Murthy, Karthik. “Code Generation for Extreme Scale Parallel Systems.” 2017. Web. 08 May 2021.

Vancouver:

Srinivasa Murthy K. Code Generation for Extreme Scale Parallel Systems. [Internet] [Doctoral dissertation]. Rice University; 2017. [cited 2021 May 08]. Available from: http://hdl.handle.net/1911/96060.

Council of Science Editors:

Srinivasa Murthy K. Code Generation for Extreme Scale Parallel Systems. [Doctoral Dissertation]. Rice University; 2017. Available from: http://hdl.handle.net/1911/96060


Georgia Tech

8. Chatarasi, Prasanth. ADVANCING COMPILER OPTIMIZATIONS FOR GENERAL-PURPOSE & DOMAIN-SPECIFIC PARALLEL ARCHITECTURES.

Degree: PhD, Computer Science, 2020, Georgia Tech

 Computer hardware is undergoing a major disruption as we approach the end of Moore’s law, in the form of new advancements to general-purpose and domain-specific… (more)

Subjects/Keywords: Compiler Optimizations; General-Purpose Architectures; Domain-Specific Architectures; Deep Learning; Graph Analytics; Accelerators; Polyhedral Model

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chatarasi, P. (2020). ADVANCING COMPILER OPTIMIZATIONS FOR GENERAL-PURPOSE & DOMAIN-SPECIFIC PARALLEL ARCHITECTURES. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/64099

Chicago Manual of Style (16th Edition):

Chatarasi, Prasanth. “ADVANCING COMPILER OPTIMIZATIONS FOR GENERAL-PURPOSE & DOMAIN-SPECIFIC PARALLEL ARCHITECTURES.” 2020. Doctoral Dissertation, Georgia Tech. Accessed May 08, 2021. http://hdl.handle.net/1853/64099.

MLA Handbook (7th Edition):

Chatarasi, Prasanth. “ADVANCING COMPILER OPTIMIZATIONS FOR GENERAL-PURPOSE & DOMAIN-SPECIFIC PARALLEL ARCHITECTURES.” 2020. Web. 08 May 2021.

Vancouver:

Chatarasi P. ADVANCING COMPILER OPTIMIZATIONS FOR GENERAL-PURPOSE & DOMAIN-SPECIFIC PARALLEL ARCHITECTURES. [Internet] [Doctoral dissertation]. Georgia Tech; 2020. [cited 2021 May 08]. Available from: http://hdl.handle.net/1853/64099.

Council of Science Editors:

Chatarasi P. ADVANCING COMPILER OPTIMIZATIONS FOR GENERAL-PURPOSE & DOMAIN-SPECIFIC PARALLEL ARCHITECTURES. [Doctoral Dissertation]. Georgia Tech; 2020. Available from: http://hdl.handle.net/1853/64099

9. Baghdadi, Mohamed Riyadh. Improving tiling, reducing compilation time, and extending the scope of polyhedral compilation : Amélioration du tuilage, réduction du temps de compilation, et extension de l'utilisabilité de la compilation polyédrique.

Degree: Docteur es, Informatique, 2015, Université Pierre et Marie Curie – Paris VI

Les processeurs multi-coeurs sont maintenant largement utilisés presque partout en informatique: ordinateurs de bureau, ordinateurs portables et accélérateurs tels que les GPGPU (General Purpose Graphics… (more)

Subjects/Keywords: Compilation; Modèle polyédrique; Langage intermediaire; Tuilage; Temps de compilation; Pencil; Polyhedral model; Compilation; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Baghdadi, M. R. (2015). Improving tiling, reducing compilation time, and extending the scope of polyhedral compilation : Amélioration du tuilage, réduction du temps de compilation, et extension de l'utilisabilité de la compilation polyédrique. (Doctoral Dissertation). Université Pierre et Marie Curie – Paris VI. Retrieved from http://www.theses.fr/2015PA066368

Chicago Manual of Style (16th Edition):

Baghdadi, Mohamed Riyadh. “Improving tiling, reducing compilation time, and extending the scope of polyhedral compilation : Amélioration du tuilage, réduction du temps de compilation, et extension de l'utilisabilité de la compilation polyédrique.” 2015. Doctoral Dissertation, Université Pierre et Marie Curie – Paris VI. Accessed May 08, 2021. http://www.theses.fr/2015PA066368.

MLA Handbook (7th Edition):

Baghdadi, Mohamed Riyadh. “Improving tiling, reducing compilation time, and extending the scope of polyhedral compilation : Amélioration du tuilage, réduction du temps de compilation, et extension de l'utilisabilité de la compilation polyédrique.” 2015. Web. 08 May 2021.

Vancouver:

Baghdadi MR. Improving tiling, reducing compilation time, and extending the scope of polyhedral compilation : Amélioration du tuilage, réduction du temps de compilation, et extension de l'utilisabilité de la compilation polyédrique. [Internet] [Doctoral dissertation]. Université Pierre et Marie Curie – Paris VI; 2015. [cited 2021 May 08]. Available from: http://www.theses.fr/2015PA066368.

Council of Science Editors:

Baghdadi MR. Improving tiling, reducing compilation time, and extending the scope of polyhedral compilation : Amélioration du tuilage, réduction du temps de compilation, et extension de l'utilisabilité de la compilation polyédrique. [Doctoral Dissertation]. Université Pierre et Marie Curie – Paris VI; 2015. Available from: http://www.theses.fr/2015PA066368


North Carolina State University

10. Ren, Yongfu. Computational Techniques to Improve Efficiency and Accuracy for High Performance Machining of Polyhedral Models.

Degree: PhD, Industrial Engineering, 2003, North Carolina State University

 The objective of this research is to investigate the computational techniques to improve the machining efficiency and accuracy for machining polyhedral models in CAD/CAM systems.… (more)

Subjects/Keywords: CAD/CAM; Polyhedral model; NC machining; Tool path generation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ren, Y. (2003). Computational Techniques to Improve Efficiency and Accuracy for High Performance Machining of Polyhedral Models. (Doctoral Dissertation). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/4744

Chicago Manual of Style (16th Edition):

Ren, Yongfu. “Computational Techniques to Improve Efficiency and Accuracy for High Performance Machining of Polyhedral Models.” 2003. Doctoral Dissertation, North Carolina State University. Accessed May 08, 2021. http://www.lib.ncsu.edu/resolver/1840.16/4744.

MLA Handbook (7th Edition):

Ren, Yongfu. “Computational Techniques to Improve Efficiency and Accuracy for High Performance Machining of Polyhedral Models.” 2003. Web. 08 May 2021.

Vancouver:

Ren Y. Computational Techniques to Improve Efficiency and Accuracy for High Performance Machining of Polyhedral Models. [Internet] [Doctoral dissertation]. North Carolina State University; 2003. [cited 2021 May 08]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/4744.

Council of Science Editors:

Ren Y. Computational Techniques to Improve Efficiency and Accuracy for High Performance Machining of Polyhedral Models. [Doctoral Dissertation]. North Carolina State University; 2003. Available from: http://www.lib.ncsu.edu/resolver/1840.16/4744

11. Hallou, Nabil. Runtime optimization of binary through vectorization transformations : Optimisation dynamique de code binaire par des transformations vectorielles.

Degree: Docteur es, Informatique, 2017, Rennes 1

Les applications ne sont pas toujours optimisées pour le matériel sur lequel elles s'exécutent, comme les logiciels distribués sous forme binaire, ou le déploiement des… (more)

Subjects/Keywords: Performance; Optimisation dynamique de code binaire; Vectorisation; Modèle polyédrique; Performance; Runtime optimization; Dynamic binary optimization; Vectorization; Polyhedral model

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hallou, N. (2017). Runtime optimization of binary through vectorization transformations : Optimisation dynamique de code binaire par des transformations vectorielles. (Doctoral Dissertation). Rennes 1. Retrieved from http://www.theses.fr/2017REN1S120

Chicago Manual of Style (16th Edition):

Hallou, Nabil. “Runtime optimization of binary through vectorization transformations : Optimisation dynamique de code binaire par des transformations vectorielles.” 2017. Doctoral Dissertation, Rennes 1. Accessed May 08, 2021. http://www.theses.fr/2017REN1S120.

MLA Handbook (7th Edition):

Hallou, Nabil. “Runtime optimization of binary through vectorization transformations : Optimisation dynamique de code binaire par des transformations vectorielles.” 2017. Web. 08 May 2021.

Vancouver:

Hallou N. Runtime optimization of binary through vectorization transformations : Optimisation dynamique de code binaire par des transformations vectorielles. [Internet] [Doctoral dissertation]. Rennes 1; 2017. [cited 2021 May 08]. Available from: http://www.theses.fr/2017REN1S120.

Council of Science Editors:

Hallou N. Runtime optimization of binary through vectorization transformations : Optimisation dynamique de code binaire par des transformations vectorielles. [Doctoral Dissertation]. Rennes 1; 2017. Available from: http://www.theses.fr/2017REN1S120

12. Jimborean, Alexandra. Adapting the polytope model for dynamic and speculative parallelization : Adaptation du modèle polyhédrique à la parallélisation dynamique et spéculatice.

Degree: Docteur es, Informatique, 2012, Université de Strasbourg

Dans cette thèse, nous décrivons la conception et l'implémentation d'une plate-forme logicielle de spéculation de threads, ou fils d'exécution, appelée VMAD, pour "Virtual Machine for… (more)

Subjects/Keywords: Programmation parallèle; Speculative parallelization; Runtime system; Compiler; Polyhedral model; Dynamic optimizations; Loops; Partial parallelism; LLVM; Automatic parallelization; 005

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Jimborean, A. (2012). Adapting the polytope model for dynamic and speculative parallelization : Adaptation du modèle polyhédrique à la parallélisation dynamique et spéculatice. (Doctoral Dissertation). Université de Strasbourg. Retrieved from http://www.theses.fr/2012STRAD020

Chicago Manual of Style (16th Edition):

Jimborean, Alexandra. “Adapting the polytope model for dynamic and speculative parallelization : Adaptation du modèle polyhédrique à la parallélisation dynamique et spéculatice.” 2012. Doctoral Dissertation, Université de Strasbourg. Accessed May 08, 2021. http://www.theses.fr/2012STRAD020.

MLA Handbook (7th Edition):

Jimborean, Alexandra. “Adapting the polytope model for dynamic and speculative parallelization : Adaptation du modèle polyhédrique à la parallélisation dynamique et spéculatice.” 2012. Web. 08 May 2021.

Vancouver:

Jimborean A. Adapting the polytope model for dynamic and speculative parallelization : Adaptation du modèle polyhédrique à la parallélisation dynamique et spéculatice. [Internet] [Doctoral dissertation]. Université de Strasbourg; 2012. [cited 2021 May 08]. Available from: http://www.theses.fr/2012STRAD020.

Council of Science Editors:

Jimborean A. Adapting the polytope model for dynamic and speculative parallelization : Adaptation du modèle polyhédrique à la parallélisation dynamique et spéculatice. [Doctoral Dissertation]. Université de Strasbourg; 2012. Available from: http://www.theses.fr/2012STRAD020


Rice University

13. Chatarasi, Prasanth. Extending the Polyhedral Compilation Model for Debugging and Optimization of SPMD-style Explicitly-Parallel Programs.

Degree: MS, Engineering, 2017, Rice University

 The SPMD (Single Program Multiple Data) parallelism continues to be one of the most popular parallel execution models in use today, as exemplified by OpenMP… (more)

Subjects/Keywords: SPMD parallelism; Data race detection; Redundant barriers; Polyhedral model; Phase mapping; Space mapping; May-Happen-in-Parallel relations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chatarasi, P. (2017). Extending the Polyhedral Compilation Model for Debugging and Optimization of SPMD-style Explicitly-Parallel Programs. (Masters Thesis). Rice University. Retrieved from http://hdl.handle.net/1911/105463

Chicago Manual of Style (16th Edition):

Chatarasi, Prasanth. “Extending the Polyhedral Compilation Model for Debugging and Optimization of SPMD-style Explicitly-Parallel Programs.” 2017. Masters Thesis, Rice University. Accessed May 08, 2021. http://hdl.handle.net/1911/105463.

MLA Handbook (7th Edition):

Chatarasi, Prasanth. “Extending the Polyhedral Compilation Model for Debugging and Optimization of SPMD-style Explicitly-Parallel Programs.” 2017. Web. 08 May 2021.

Vancouver:

Chatarasi P. Extending the Polyhedral Compilation Model for Debugging and Optimization of SPMD-style Explicitly-Parallel Programs. [Internet] [Masters thesis]. Rice University; 2017. [cited 2021 May 08]. Available from: http://hdl.handle.net/1911/105463.

Council of Science Editors:

Chatarasi P. Extending the Polyhedral Compilation Model for Debugging and Optimization of SPMD-style Explicitly-Parallel Programs. [Masters Thesis]. Rice University; 2017. Available from: http://hdl.handle.net/1911/105463

14. Isoard, Alexandre. Extending Polyhedral Techniques towards Parallel Specifications and Approximations : Extension des Techniques Polyedriques vers les Specifications Parallelles et les Approximations.

Degree: Docteur es, Informatique, 2016, Lyon

Les techniques polyédriques permettent d’appliquer des analyses et transformations de code sur des structures multidimensionnelles telles que boucles imbriquées et tableaux. Elles sont en général… (more)

Subjects/Keywords: Modèle polyédrique; Déchargement de noyau de calcul; Tuilage paramétrique; Allocation mémoire; Polyhedral Model; Kernel Offloading; Parametric Tiling; Memory Allocation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Isoard, A. (2016). Extending Polyhedral Techniques towards Parallel Specifications and Approximations : Extension des Techniques Polyedriques vers les Specifications Parallelles et les Approximations. (Doctoral Dissertation). Lyon. Retrieved from http://www.theses.fr/2016LYSEN011

Chicago Manual of Style (16th Edition):

Isoard, Alexandre. “Extending Polyhedral Techniques towards Parallel Specifications and Approximations : Extension des Techniques Polyedriques vers les Specifications Parallelles et les Approximations.” 2016. Doctoral Dissertation, Lyon. Accessed May 08, 2021. http://www.theses.fr/2016LYSEN011.

MLA Handbook (7th Edition):

Isoard, Alexandre. “Extending Polyhedral Techniques towards Parallel Specifications and Approximations : Extension des Techniques Polyedriques vers les Specifications Parallelles et les Approximations.” 2016. Web. 08 May 2021.

Vancouver:

Isoard A. Extending Polyhedral Techniques towards Parallel Specifications and Approximations : Extension des Techniques Polyedriques vers les Specifications Parallelles et les Approximations. [Internet] [Doctoral dissertation]. Lyon; 2016. [cited 2021 May 08]. Available from: http://www.theses.fr/2016LYSEN011.

Council of Science Editors:

Isoard A. Extending Polyhedral Techniques towards Parallel Specifications and Approximations : Extension des Techniques Polyedriques vers les Specifications Parallelles et les Approximations. [Doctoral Dissertation]. Lyon; 2016. Available from: http://www.theses.fr/2016LYSEN011

15. Zinenko, Oleksandr. Restructuration interactive des programmes : Interactive Program Restructuring.

Degree: Docteur es, Informatique, 2016, Université Paris-Saclay (ComUE)

Le développement des logiciels et leur restructuration deviennent de plus en plus complexes à cause de l'adoption massive des architectures parallèles, ce qui nécessite une… (more)

Subjects/Keywords: Visualisation des logiciels; Modèle polyédrique; Technique d'interaction; Optimisation des programmes; Software visualization; Polyhedral model; Interaction technique; Program optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zinenko, O. (2016). Restructuration interactive des programmes : Interactive Program Restructuring. (Doctoral Dissertation). Université Paris-Saclay (ComUE). Retrieved from http://www.theses.fr/2016SACLS437

Chicago Manual of Style (16th Edition):

Zinenko, Oleksandr. “Restructuration interactive des programmes : Interactive Program Restructuring.” 2016. Doctoral Dissertation, Université Paris-Saclay (ComUE). Accessed May 08, 2021. http://www.theses.fr/2016SACLS437.

MLA Handbook (7th Edition):

Zinenko, Oleksandr. “Restructuration interactive des programmes : Interactive Program Restructuring.” 2016. Web. 08 May 2021.

Vancouver:

Zinenko O. Restructuration interactive des programmes : Interactive Program Restructuring. [Internet] [Doctoral dissertation]. Université Paris-Saclay (ComUE); 2016. [cited 2021 May 08]. Available from: http://www.theses.fr/2016SACLS437.

Council of Science Editors:

Zinenko O. Restructuration interactive des programmes : Interactive Program Restructuring. [Doctoral Dissertation]. Université Paris-Saclay (ComUE); 2016. Available from: http://www.theses.fr/2016SACLS437

16. Iooss, Guillaume. Detection of linear algebra operations in polyhedral programs : Reconnaissance d'opérations d'algèbre linéaire dans un programme polyédrique.

Degree: Docteur es, Informatique, 2016, Lyon; Colorado state university

Durant ces dernières années, Il est de plus en plus compliqué d'écrire du code qui utilise une architecture au mieux de ses capacités. Certaines opérations… (more)

Subjects/Keywords: Modèle polyédrique; Tuilage; Équivalence de programme; Reconnaissance de template; BLAS; Polyhedral model; Tiling; Program equivalence; Template recognition; BLAS

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Iooss, G. (2016). Detection of linear algebra operations in polyhedral programs : Reconnaissance d'opérations d'algèbre linéaire dans un programme polyédrique. (Doctoral Dissertation). Lyon; Colorado state university. Retrieved from http://www.theses.fr/2016LYSEN019

Chicago Manual of Style (16th Edition):

Iooss, Guillaume. “Detection of linear algebra operations in polyhedral programs : Reconnaissance d'opérations d'algèbre linéaire dans un programme polyédrique.” 2016. Doctoral Dissertation, Lyon; Colorado state university. Accessed May 08, 2021. http://www.theses.fr/2016LYSEN019.

MLA Handbook (7th Edition):

Iooss, Guillaume. “Detection of linear algebra operations in polyhedral programs : Reconnaissance d'opérations d'algèbre linéaire dans un programme polyédrique.” 2016. Web. 08 May 2021.

Vancouver:

Iooss G. Detection of linear algebra operations in polyhedral programs : Reconnaissance d'opérations d'algèbre linéaire dans un programme polyédrique. [Internet] [Doctoral dissertation]. Lyon; Colorado state university; 2016. [cited 2021 May 08]. Available from: http://www.theses.fr/2016LYSEN019.

Council of Science Editors:

Iooss G. Detection of linear algebra operations in polyhedral programs : Reconnaissance d'opérations d'algèbre linéaire dans un programme polyédrique. [Doctoral Dissertation]. Lyon; Colorado state university; 2016. Available from: http://www.theses.fr/2016LYSEN019


Colorado State University

17. Gupta, Gautam. Some advances in the polyhedral model.

Degree: PhD, Computer Science, 2010, Colorado State University

 The polyhedral model is a mathematical formalism and a framework for the analysis and transformation of regular computations. It provides a unified approach to the… (more)

Subjects/Keywords: polyhedra models; compilers; program analysis; polyhedral model; loop optimization; Polyhedral functions; Code generators; Compilers (Computer programs); Computer science-Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gupta, G. (2010). Some advances in the polyhedral model. (Doctoral Dissertation). Colorado State University. Retrieved from http://hdl.handle.net/10217/40288

Chicago Manual of Style (16th Edition):

Gupta, Gautam. “Some advances in the polyhedral model.” 2010. Doctoral Dissertation, Colorado State University. Accessed May 08, 2021. http://hdl.handle.net/10217/40288.

MLA Handbook (7th Edition):

Gupta, Gautam. “Some advances in the polyhedral model.” 2010. Web. 08 May 2021.

Vancouver:

Gupta G. Some advances in the polyhedral model. [Internet] [Doctoral dissertation]. Colorado State University; 2010. [cited 2021 May 08]. Available from: http://hdl.handle.net/10217/40288.

Council of Science Editors:

Gupta G. Some advances in the polyhedral model. [Doctoral Dissertation]. Colorado State University; 2010. Available from: http://hdl.handle.net/10217/40288

18. Stasiak, Marta. Compression uniaxiale d'un matériau granulaire fragile très compressible - une étude par éléments discrets 3D : Uniaxial compression of a highly crushable granular material - a 3D DEM study.

Degree: Docteur es, Matériaux, Mécanique, Génie civil, Electrochimie, 2019, Université Grenoble Alpes (ComUE)

 L’Agence nationale pour la gestion des déchets radioactifs (l’Andra) en France propose un nouveau type de voussoirs de tunnel pour les ouvrages très profonds. Pour… (more)

Subjects/Keywords: Matériau granulaire compressible; Voussoir; Sphéro-Polyhèdre; Particules collées; Compression oedométrique; Modèle de prédiction analytique; Crushable granular material; Tunnel lining; Sphero-Polyhedral clumps; Bonded Particles; Oedometeric compression; Analytical prediction model; 530

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Stasiak, M. (2019). Compression uniaxiale d'un matériau granulaire fragile très compressible - une étude par éléments discrets 3D : Uniaxial compression of a highly crushable granular material - a 3D DEM study. (Doctoral Dissertation). Université Grenoble Alpes (ComUE). Retrieved from http://www.theses.fr/2019GREAI041

Chicago Manual of Style (16th Edition):

Stasiak, Marta. “Compression uniaxiale d'un matériau granulaire fragile très compressible - une étude par éléments discrets 3D : Uniaxial compression of a highly crushable granular material - a 3D DEM study.” 2019. Doctoral Dissertation, Université Grenoble Alpes (ComUE). Accessed May 08, 2021. http://www.theses.fr/2019GREAI041.

MLA Handbook (7th Edition):

Stasiak, Marta. “Compression uniaxiale d'un matériau granulaire fragile très compressible - une étude par éléments discrets 3D : Uniaxial compression of a highly crushable granular material - a 3D DEM study.” 2019. Web. 08 May 2021.

Vancouver:

Stasiak M. Compression uniaxiale d'un matériau granulaire fragile très compressible - une étude par éléments discrets 3D : Uniaxial compression of a highly crushable granular material - a 3D DEM study. [Internet] [Doctoral dissertation]. Université Grenoble Alpes (ComUE); 2019. [cited 2021 May 08]. Available from: http://www.theses.fr/2019GREAI041.

Council of Science Editors:

Stasiak M. Compression uniaxiale d'un matériau granulaire fragile très compressible - une étude par éléments discrets 3D : Uniaxial compression of a highly crushable granular material - a 3D DEM study. [Doctoral Dissertation]. Université Grenoble Alpes (ComUE); 2019. Available from: http://www.theses.fr/2019GREAI041


Université Paris-Sud – Paris XI

19. Kruse, Michael. Lattice QCD Optimization and Polytopic Representations of Distributed Memory : Optimisation de LatticeQCD et représentations polytopiques de la mémoire distribuée.

Degree: Docteur es, Informatique, 2014, Université Paris-Sud – Paris XI

 La physique actuelle cherche, à côté des expériences, à vérifier et déduire les lois de la nature en simulant les modèles physiques sur d'énormes ordinateurs.… (more)

Subjects/Keywords: Blue Gene; Lattice QCD; Mémoire distribuée; LLVM; Clang; Modèle polyhédrique; Parallélisation; Blue Gene; Lattice QCD; Distributed Memory; LLVM; Clang; Polyhedral Model; Parallelization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kruse, M. (2014). Lattice QCD Optimization and Polytopic Representations of Distributed Memory : Optimisation de LatticeQCD et représentations polytopiques de la mémoire distribuée. (Doctoral Dissertation). Université Paris-Sud – Paris XI. Retrieved from http://www.theses.fr/2014PA112198

Chicago Manual of Style (16th Edition):

Kruse, Michael. “Lattice QCD Optimization and Polytopic Representations of Distributed Memory : Optimisation de LatticeQCD et représentations polytopiques de la mémoire distribuée.” 2014. Doctoral Dissertation, Université Paris-Sud – Paris XI. Accessed May 08, 2021. http://www.theses.fr/2014PA112198.

MLA Handbook (7th Edition):

Kruse, Michael. “Lattice QCD Optimization and Polytopic Representations of Distributed Memory : Optimisation de LatticeQCD et représentations polytopiques de la mémoire distribuée.” 2014. Web. 08 May 2021.

Vancouver:

Kruse M. Lattice QCD Optimization and Polytopic Representations of Distributed Memory : Optimisation de LatticeQCD et représentations polytopiques de la mémoire distribuée. [Internet] [Doctoral dissertation]. Université Paris-Sud – Paris XI; 2014. [cited 2021 May 08]. Available from: http://www.theses.fr/2014PA112198.

Council of Science Editors:

Kruse M. Lattice QCD Optimization and Polytopic Representations of Distributed Memory : Optimisation de LatticeQCD et représentations polytopiques de la mémoire distribuée. [Doctoral Dissertation]. Université Paris-Sud – Paris XI; 2014. Available from: http://www.theses.fr/2014PA112198

20. Saied, Mariem. Automatic code generation and optimization of multi-dimensional stencil computations on distributed-memory architectures : Génération automatique de code et optimisation de calculs stencils sur des architectures à mémoire distribuée.

Degree: Docteur es, Informatique, 2018, Université de Strasbourg

Nous proposons Dido, un langage dédié (DSL) implicitement parallèle qui capture les spécifications de haut niveau des stencils et génère automatiquement du code parallèle de… (more)

Subjects/Keywords: Langage dédié; Verroux ordonnés de lecture/écriture; Calculs stencils; Modèle polyédrique; Mémoire distribuée; Domain-specific language; Ordered read write locks; Stencil computations; Polyhedral model; Distributed memory; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Saied, M. (2018). Automatic code generation and optimization of multi-dimensional stencil computations on distributed-memory architectures : Génération automatique de code et optimisation de calculs stencils sur des architectures à mémoire distribuée. (Doctoral Dissertation). Université de Strasbourg. Retrieved from http://www.theses.fr/2018STRAD036

Chicago Manual of Style (16th Edition):

Saied, Mariem. “Automatic code generation and optimization of multi-dimensional stencil computations on distributed-memory architectures : Génération automatique de code et optimisation de calculs stencils sur des architectures à mémoire distribuée.” 2018. Doctoral Dissertation, Université de Strasbourg. Accessed May 08, 2021. http://www.theses.fr/2018STRAD036.

MLA Handbook (7th Edition):

Saied, Mariem. “Automatic code generation and optimization of multi-dimensional stencil computations on distributed-memory architectures : Génération automatique de code et optimisation de calculs stencils sur des architectures à mémoire distribuée.” 2018. Web. 08 May 2021.

Vancouver:

Saied M. Automatic code generation and optimization of multi-dimensional stencil computations on distributed-memory architectures : Génération automatique de code et optimisation de calculs stencils sur des architectures à mémoire distribuée. [Internet] [Doctoral dissertation]. Université de Strasbourg; 2018. [cited 2021 May 08]. Available from: http://www.theses.fr/2018STRAD036.

Council of Science Editors:

Saied M. Automatic code generation and optimization of multi-dimensional stencil computations on distributed-memory architectures : Génération automatique de code et optimisation de calculs stencils sur des architectures à mémoire distribuée. [Doctoral Dissertation]. Université de Strasbourg; 2018. Available from: http://www.theses.fr/2018STRAD036

21. Ruvinskiy, Ray. Using Decision Tree Voting to Select a Polyhedral Model Loop Transformation.

Degree: 2013, University of Waterloo

 Algorithms in fields like image manipulation, sound and signal processing, and statistics frequently employ tight loops. These loops are computationally intensive and CPU-bound, making their… (more)

Subjects/Keywords: loop machine learning decision tree polyhedral model optimization

…1.2 Contributions of the Thesis My focus is on the polyhedral model, a mathematical… …polyhedral model allows loop transformations to be expressed as algebraic operations on polyhedra… …of the thesis. I begin by describing the polyhedral model and how it can be used to… …relevant prior work on generating transformations using the polyhedral model and various… …review the necessary background in the polyhedral model, loop transformations, and machine… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ruvinskiy, R. (2013). Using Decision Tree Voting to Select a Polyhedral Model Loop Transformation. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8048

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ruvinskiy, Ray. “Using Decision Tree Voting to Select a Polyhedral Model Loop Transformation.” 2013. Thesis, University of Waterloo. Accessed May 08, 2021. http://hdl.handle.net/10012/8048.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ruvinskiy, Ray. “Using Decision Tree Voting to Select a Polyhedral Model Loop Transformation.” 2013. Web. 08 May 2021.

Vancouver:

Ruvinskiy R. Using Decision Tree Voting to Select a Polyhedral Model Loop Transformation. [Internet] [Thesis]. University of Waterloo; 2013. [cited 2021 May 08]. Available from: http://hdl.handle.net/10012/8048.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ruvinskiy R. Using Decision Tree Voting to Select a Polyhedral Model Loop Transformation. [Thesis]. University of Waterloo; 2013. Available from: http://hdl.handle.net/10012/8048

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

22. Chidambarnathan, Yogesh. Characterizing the Effectiveness of Compilers in Vectorizing Polyhedrally Transformed Code.

Degree: MS, Computer Science and Engineering, 2013, The Ohio State University

 Many of the compute intensive applications spend most of their time inside nested loops. Hence optimization of these nested loops can provide significant improvements in… (more)

Subjects/Keywords: Computer Science; Vectorization; Tiling; Polyhedral model; PAPI; Pluto; Ptile

…optimization framework based on the Polyhedral model, a model for compiler optimization which… …automatic polyhedral source-to-source transformation program which is driven by an integer linear… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chidambarnathan, Y. (2013). Characterizing the Effectiveness of Compilers in Vectorizing Polyhedrally Transformed Code. (Masters Thesis). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1357321939

Chicago Manual of Style (16th Edition):

Chidambarnathan, Yogesh. “Characterizing the Effectiveness of Compilers in Vectorizing Polyhedrally Transformed Code.” 2013. Masters Thesis, The Ohio State University. Accessed May 08, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=osu1357321939.

MLA Handbook (7th Edition):

Chidambarnathan, Yogesh. “Characterizing the Effectiveness of Compilers in Vectorizing Polyhedrally Transformed Code.” 2013. Web. 08 May 2021.

Vancouver:

Chidambarnathan Y. Characterizing the Effectiveness of Compilers in Vectorizing Polyhedrally Transformed Code. [Internet] [Masters thesis]. The Ohio State University; 2013. [cited 2021 May 08]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1357321939.

Council of Science Editors:

Chidambarnathan Y. Characterizing the Effectiveness of Compilers in Vectorizing Polyhedrally Transformed Code. [Masters Thesis]. The Ohio State University; 2013. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1357321939

23. Bondhugula, Uday Kumar. Effective Automatic Parallelization and Locality Optimization Using The Polyhedral Model.

Degree: PhD, Computer Science and Engineering, 2008, The Ohio State University

  Multicore processors have now become mainstream. The difficulty ofprogramming these architectures to effectively tap the potential ofmultiple processing units is well-known. Among several ways… (more)

Subjects/Keywords: Computer Science; Automatic Parallelization; Polyhedral Model; Compiler Optimizations

…2.6 Hyperplanes and Polyhedra . . . . . . . . . The Polyhedral Model… …that they all have shared memory at one level or the other. The Polyhedral Model. Many… …particularly common in scientific and engineering applications. The Polyhedral Model provides a… …locality and/or loops that have been parallelized. The polyhedral model is readily applicable to… …x29; in the polyhedral model may be viewed in terms of three phases: (1) static… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bondhugula, U. K. (2008). Effective Automatic Parallelization and Locality Optimization Using The Polyhedral Model. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1218542151

Chicago Manual of Style (16th Edition):

Bondhugula, Uday Kumar. “Effective Automatic Parallelization and Locality Optimization Using The Polyhedral Model.” 2008. Doctoral Dissertation, The Ohio State University. Accessed May 08, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=osu1218542151.

MLA Handbook (7th Edition):

Bondhugula, Uday Kumar. “Effective Automatic Parallelization and Locality Optimization Using The Polyhedral Model.” 2008. Web. 08 May 2021.

Vancouver:

Bondhugula UK. Effective Automatic Parallelization and Locality Optimization Using The Polyhedral Model. [Internet] [Doctoral dissertation]. The Ohio State University; 2008. [cited 2021 May 08]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1218542151.

Council of Science Editors:

Bondhugula UK. Effective Automatic Parallelization and Locality Optimization Using The Polyhedral Model. [Doctoral Dissertation]. The Ohio State University; 2008. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1218542151


The Ohio State University

24. Chinnaswamy, Karthiyayini. Compile Time Extraction And Instrumentation of Affine Program Kernels.

Degree: MS, Computer Science and Engineering, 2010, The Ohio State University

 A common observation in large scientific computation programs is that 90% of theexecution time is spent in 10% of the actual code which may consist… (more)

Subjects/Keywords: Computer Science; Static Control Parts; SCoP; Polyhedral model; Affine programs; ROSE compiler

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chinnaswamy, K. (2010). Compile Time Extraction And Instrumentation of Affine Program Kernels. (Masters Thesis). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1276879069

Chicago Manual of Style (16th Edition):

Chinnaswamy, Karthiyayini. “Compile Time Extraction And Instrumentation of Affine Program Kernels.” 2010. Masters Thesis, The Ohio State University. Accessed May 08, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=osu1276879069.

MLA Handbook (7th Edition):

Chinnaswamy, Karthiyayini. “Compile Time Extraction And Instrumentation of Affine Program Kernels.” 2010. Web. 08 May 2021.

Vancouver:

Chinnaswamy K. Compile Time Extraction And Instrumentation of Affine Program Kernels. [Internet] [Masters thesis]. The Ohio State University; 2010. [cited 2021 May 08]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1276879069.

Council of Science Editors:

Chinnaswamy K. Compile Time Extraction And Instrumentation of Affine Program Kernels. [Masters Thesis]. The Ohio State University; 2010. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1276879069


The Ohio State University

25. Gururaghavendran, Ashwin. Applying Polyhedral Transformation to Fortran Programs.

Degree: MS, Computer Science and Engineering, 2011, The Ohio State University

 A large number of computationally intensive scientific programs still exist as Fortran programs. High performance compilers aim at reducing the execution time of programs by… (more)

Subjects/Keywords: Computer Science; fortran; polyhedral model; compiler optimization; high performance computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gururaghavendran, A. (2011). Applying Polyhedral Transformation to Fortran Programs. (Masters Thesis). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1301032351

Chicago Manual of Style (16th Edition):

Gururaghavendran, Ashwin. “Applying Polyhedral Transformation to Fortran Programs.” 2011. Masters Thesis, The Ohio State University. Accessed May 08, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=osu1301032351.

MLA Handbook (7th Edition):

Gururaghavendran, Ashwin. “Applying Polyhedral Transformation to Fortran Programs.” 2011. Web. 08 May 2021.

Vancouver:

Gururaghavendran A. Applying Polyhedral Transformation to Fortran Programs. [Internet] [Masters thesis]. The Ohio State University; 2011. [cited 2021 May 08]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1301032351.

Council of Science Editors:

Gururaghavendran A. Applying Polyhedral Transformation to Fortran Programs. [Masters Thesis]. The Ohio State University; 2011. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1301032351


University of Illinois – Chicago

26. Giulio Stramondo (7957262). PolyFPGA: A Tool to Automatically Accelerate Iterative Stencil Loops.

Degree: 2016, University of Illinois – Chicago

 A wide range of scientific problems can be solved using stencil computations. Many particle interaction, computer vision algorithms as well as methods for solving Partial… (more)

Subjects/Keywords: Uncategorized; FPGA; hardware accelerators; iterative stencil loops; ISL; polyhedral model; static analysis; electronic system level; framework; automating tool; scientific calculation; SST; stencil streaming timestep

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

(7957262), G. S. (2016). PolyFPGA: A Tool to Automatically Accelerate Iterative Stencil Loops. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/20813

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

(7957262), Giulio Stramondo. “PolyFPGA: A Tool to Automatically Accelerate Iterative Stencil Loops.” 2016. Thesis, University of Illinois – Chicago. Accessed May 08, 2021. http://hdl.handle.net/10027/20813.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

(7957262), Giulio Stramondo. “PolyFPGA: A Tool to Automatically Accelerate Iterative Stencil Loops.” 2016. Web. 08 May 2021.

Vancouver:

(7957262) GS. PolyFPGA: A Tool to Automatically Accelerate Iterative Stencil Loops. [Internet] [Thesis]. University of Illinois – Chicago; 2016. [cited 2021 May 08]. Available from: http://hdl.handle.net/10027/20813.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

(7957262) GS. PolyFPGA: A Tool to Automatically Accelerate Iterative Stencil Loops. [Thesis]. University of Illinois – Chicago; 2016. Available from: http://hdl.handle.net/10027/20813

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


ETH Zürich

27. Pandjaitan, Poltak. Architectonics of Crystal Space: The Mediating and Joining of Spatialities.

Degree: 2018, ETH Zürich

 The basic research project addresses the question of how to implement and translate spatial concepts in crystal topologies and to link architecture with the abstract… (more)

Subjects/Keywords: Architectonics; Crystal; Space; Spatialities; aperiodic crystals; aperiodic structures; Quasicrystal; quasiperiodic tiling; quasiperiodic structures; Algebra; Architecture; Mediation; Joints; Parametrization; Parametric modeling; Parametric design; Crystal growth; Crystal structure; Modularity; Modeling; Machine learning; QUANTUM THEORY; Dimension reduction; Dimensionality reduction; Dimensionality; 3D modeling; 3D Printing; ARRANGEMENTS; ARRANGEMENTS OF GEOMETRIC FIGURES (GEOMETRY); ALGEBRAIC SURFACES (ALGEBRAIC GEOMETRY); Topology; Structure; Geometry; Abstraction; Polyhedra; Polyhedral geometry; Polyhedral body; Polyhedral Model; info:eu-repo/classification/ddc/720; Architecture

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Pandjaitan, P. (2018). Architectonics of Crystal Space: The Mediating and Joining of Spatialities. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/342966

Chicago Manual of Style (16th Edition):

Pandjaitan, Poltak. “Architectonics of Crystal Space: The Mediating and Joining of Spatialities.” 2018. Doctoral Dissertation, ETH Zürich. Accessed May 08, 2021. http://hdl.handle.net/20.500.11850/342966.

MLA Handbook (7th Edition):

Pandjaitan, Poltak. “Architectonics of Crystal Space: The Mediating and Joining of Spatialities.” 2018. Web. 08 May 2021.

Vancouver:

Pandjaitan P. Architectonics of Crystal Space: The Mediating and Joining of Spatialities. [Internet] [Doctoral dissertation]. ETH Zürich; 2018. [cited 2021 May 08]. Available from: http://hdl.handle.net/20.500.11850/342966.

Council of Science Editors:

Pandjaitan P. Architectonics of Crystal Space: The Mediating and Joining of Spatialities. [Doctoral Dissertation]. ETH Zürich; 2018. Available from: http://hdl.handle.net/20.500.11850/342966


Indian Institute of Science

28. Chandan, G. Effective Automatic Computation Placement and Data Allocation for Parallelization of Regular Programs.

Degree: MSc Engg, Faculty of Engineering, 2018, Indian Institute of Science

 Scientific applications that operate on large data sets require huge amount of computation power and memory. These applications are typically run on High Performance Computing… (more)

Subjects/Keywords: High Performance Computing Systems; Computer Placement; Data Analysis and Management; Distributed-memory; Automatic Parallelization; Data-distribution; Polyhedral Model; Computation Placement; Hyperplanes and Polyhedra; HPC Systems; Data Allocation and Management; Data Movement Code Generation; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chandan, G. (2018). Effective Automatic Computation Placement and Data Allocation for Parallelization of Regular Programs. (Masters Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/3111

Chicago Manual of Style (16th Edition):

Chandan, G. “Effective Automatic Computation Placement and Data Allocation for Parallelization of Regular Programs.” 2018. Masters Thesis, Indian Institute of Science. Accessed May 08, 2021. http://etd.iisc.ac.in/handle/2005/3111.

MLA Handbook (7th Edition):

Chandan, G. “Effective Automatic Computation Placement and Data Allocation for Parallelization of Regular Programs.” 2018. Web. 08 May 2021.

Vancouver:

Chandan G. Effective Automatic Computation Placement and Data Allocation for Parallelization of Regular Programs. [Internet] [Masters thesis]. Indian Institute of Science; 2018. [cited 2021 May 08]. Available from: http://etd.iisc.ac.in/handle/2005/3111.

Council of Science Editors:

Chandan G. Effective Automatic Computation Placement and Data Allocation for Parallelization of Regular Programs. [Masters Thesis]. Indian Institute of Science; 2018. Available from: http://etd.iisc.ac.in/handle/2005/3111

29. Dollinger, Jean-François. A framework for efficient execution on GPU and CPU+GPU systems : Framework pour une exécution efficace sur systèmes GPU et CPU+GPU.

Degree: Docteur es, Informatique, 2015, Université de Strasbourg

Les verrous technologiques rencontrés par les fabricants de semi-conducteurs au début des années deux-mille ont abrogé la flambée des performances des unités de calculs séquentielles.… (more)

Subjects/Keywords: GPGPU; Modèle polyédrique; Prédiction de performance; Sélection de code adaptative; Calcul hétérogène; Ordonnancement; CPU vs GPU; CPU + GPU; GPGPU; Polyhedral model; Performance prediction; Adaptive code selection; Heterogeneous computing; Scheduling; CPU vs GPU; CPU + GPU; 004.2; 004.3

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Dollinger, J. (2015). A framework for efficient execution on GPU and CPU+GPU systems : Framework pour une exécution efficace sur systèmes GPU et CPU+GPU. (Doctoral Dissertation). Université de Strasbourg. Retrieved from http://www.theses.fr/2015STRAD019

Chicago Manual of Style (16th Edition):

Dollinger, Jean-François. “A framework for efficient execution on GPU and CPU+GPU systems : Framework pour une exécution efficace sur systèmes GPU et CPU+GPU.” 2015. Doctoral Dissertation, Université de Strasbourg. Accessed May 08, 2021. http://www.theses.fr/2015STRAD019.

MLA Handbook (7th Edition):

Dollinger, Jean-François. “A framework for efficient execution on GPU and CPU+GPU systems : Framework pour une exécution efficace sur systèmes GPU et CPU+GPU.” 2015. Web. 08 May 2021.

Vancouver:

Dollinger J. A framework for efficient execution on GPU and CPU+GPU systems : Framework pour une exécution efficace sur systèmes GPU et CPU+GPU. [Internet] [Doctoral dissertation]. Université de Strasbourg; 2015. [cited 2021 May 08]. Available from: http://www.theses.fr/2015STRAD019.

Council of Science Editors:

Dollinger J. A framework for efficient execution on GPU and CPU+GPU systems : Framework pour une exécution efficace sur systèmes GPU et CPU+GPU. [Doctoral Dissertation]. Université de Strasbourg; 2015. Available from: http://www.theses.fr/2015STRAD019

30. Zotkiewicz, Mateusz. Robust routing optimization in resilient networks : Polyhedral model and complexity issues : Optimisation robuste du routage dans les réseaux résilients : Modèle polyédrique et problèmes de complexité.

Degree: Docteur es, Informatique, 2011, Evry, Institut national des télécommunications

Dans les grands réseaux de transport, certains éléments du réseau peuvent être responsables du traitement d’importants volumes de trafic. Cela rend ces réseaux vulnérables aux… (more)

Subjects/Keywords: Optimisation; Réseaux; Robustesse; Complexité; Algorithmes; Modèle polyédrique; Résilience; Optimization; Networks; Robustness; Complexity; Algorithms; Polyhedral model; Resilience

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zotkiewicz, M. (2011). Robust routing optimization in resilient networks : Polyhedral model and complexity issues : Optimisation robuste du routage dans les réseaux résilients : Modèle polyédrique et problèmes de complexité. (Doctoral Dissertation). Evry, Institut national des télécommunications. Retrieved from http://www.theses.fr/2011TELE0001

Chicago Manual of Style (16th Edition):

Zotkiewicz, Mateusz. “Robust routing optimization in resilient networks : Polyhedral model and complexity issues : Optimisation robuste du routage dans les réseaux résilients : Modèle polyédrique et problèmes de complexité.” 2011. Doctoral Dissertation, Evry, Institut national des télécommunications. Accessed May 08, 2021. http://www.theses.fr/2011TELE0001.

MLA Handbook (7th Edition):

Zotkiewicz, Mateusz. “Robust routing optimization in resilient networks : Polyhedral model and complexity issues : Optimisation robuste du routage dans les réseaux résilients : Modèle polyédrique et problèmes de complexité.” 2011. Web. 08 May 2021.

Vancouver:

Zotkiewicz M. Robust routing optimization in resilient networks : Polyhedral model and complexity issues : Optimisation robuste du routage dans les réseaux résilients : Modèle polyédrique et problèmes de complexité. [Internet] [Doctoral dissertation]. Evry, Institut national des télécommunications; 2011. [cited 2021 May 08]. Available from: http://www.theses.fr/2011TELE0001.

Council of Science Editors:

Zotkiewicz M. Robust routing optimization in resilient networks : Polyhedral model and complexity issues : Optimisation robuste du routage dans les réseaux résilients : Modèle polyédrique et problèmes de complexité. [Doctoral Dissertation]. Evry, Institut national des télécommunications; 2011. Available from: http://www.theses.fr/2011TELE0001

[1] [2]

.