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:(parallel algorithms). Showing records 1 – 30 of 501 total matches.

[1] [2] [3] [4] [5] … [17]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters

1. Pearce, Roger Allan. Scalable Parallel Algorithms for Massive Scale-free Graphs.

Degree: 2013, Texas Digital Library

 Efficiently storing and processing massive graph data sets is a challenging problem as researchers seek to leverage ???Big Data??? to answer next-generation scientific questions. New… (more)

Subjects/Keywords: parallel algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pearce, R. A. (2013). Scalable Parallel Algorithms for Massive Scale-free Graphs. (Thesis). Texas Digital Library. Retrieved from http://hdl.handle.net/1969; http://hdl.handle.net/2249.1/66830

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):

Pearce, Roger Allan. “Scalable Parallel Algorithms for Massive Scale-free Graphs.” 2013. Thesis, Texas Digital Library. Accessed April 18, 2021. http://hdl.handle.net/1969; http://hdl.handle.net/2249.1/66830.

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

MLA Handbook (7th Edition):

Pearce, Roger Allan. “Scalable Parallel Algorithms for Massive Scale-free Graphs.” 2013. Web. 18 Apr 2021.

Vancouver:

Pearce RA. Scalable Parallel Algorithms for Massive Scale-free Graphs. [Internet] [Thesis]. Texas Digital Library; 2013. [cited 2021 Apr 18]. Available from: http://hdl.handle.net/1969; http://hdl.handle.net/2249.1/66830.

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

Council of Science Editors:

Pearce RA. Scalable Parallel Algorithms for Massive Scale-free Graphs. [Thesis]. Texas Digital Library; 2013. Available from: http://hdl.handle.net/1969; http://hdl.handle.net/2249.1/66830

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


Universiteit Utrecht

2. Kurt, H. Improving the Mondriaan vector distribution.

Degree: 2016, Universiteit Utrecht

 Mondriaan is a hypergraph based matrix partitioner, used to distribute the matrix and vectors in parallel sparse matrix-vector multiplication (SpMV) when calculating the product u=Av.… (more)

Subjects/Keywords: parallel algorithms; mondriaan; vector distribution

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kurt, H. (2016). Improving the Mondriaan vector distribution. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/327907

Chicago Manual of Style (16th Edition):

Kurt, H. “Improving the Mondriaan vector distribution.” 2016. Masters Thesis, Universiteit Utrecht. Accessed April 18, 2021. http://dspace.library.uu.nl:8080/handle/1874/327907.

MLA Handbook (7th Edition):

Kurt, H. “Improving the Mondriaan vector distribution.” 2016. Web. 18 Apr 2021.

Vancouver:

Kurt H. Improving the Mondriaan vector distribution. [Internet] [Masters thesis]. Universiteit Utrecht; 2016. [cited 2021 Apr 18]. Available from: http://dspace.library.uu.nl:8080/handle/1874/327907.

Council of Science Editors:

Kurt H. Improving the Mondriaan vector distribution. [Masters Thesis]. Universiteit Utrecht; 2016. Available from: http://dspace.library.uu.nl:8080/handle/1874/327907


Cornell University

3. Clark, Scott. Parallel Machine Learning Algorithms In Bioinformatics And Global Optimization.

Degree: PhD, Applied Mathematics, 2012, Cornell University

 This is a dissertation in three parts, in each we explore the development and analysis of a parallel statistical or machine learning algorithm and its… (more)

Subjects/Keywords: bioinformatics; parallel algorithms; machine learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Clark, S. (2012). Parallel Machine Learning Algorithms In Bioinformatics And Global Optimization. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/31145

Chicago Manual of Style (16th Edition):

Clark, Scott. “Parallel Machine Learning Algorithms In Bioinformatics And Global Optimization.” 2012. Doctoral Dissertation, Cornell University. Accessed April 18, 2021. http://hdl.handle.net/1813/31145.

MLA Handbook (7th Edition):

Clark, Scott. “Parallel Machine Learning Algorithms In Bioinformatics And Global Optimization.” 2012. Web. 18 Apr 2021.

Vancouver:

Clark S. Parallel Machine Learning Algorithms In Bioinformatics And Global Optimization. [Internet] [Doctoral dissertation]. Cornell University; 2012. [cited 2021 Apr 18]. Available from: http://hdl.handle.net/1813/31145.

Council of Science Editors:

Clark S. Parallel Machine Learning Algorithms In Bioinformatics And Global Optimization. [Doctoral Dissertation]. Cornell University; 2012. Available from: http://hdl.handle.net/1813/31145


University of Illinois – Urbana-Champaign

4. Manikandan, Gowthami Jayashri. Comprehensive evaluation of error correction methods for high-throughput sequencing data.

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

 The advent of DNA and RNA sequencing has significantly revolutionized the study of genomics and molecular biology. Development of high-throughput sequencing technologies have brought about… (more)

Subjects/Keywords: Computational genomics; Algorithms; Parallel computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Manikandan, G. J. (2017). Comprehensive evaluation of error correction methods for high-throughput sequencing data. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97787

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):

Manikandan, Gowthami Jayashri. “Comprehensive evaluation of error correction methods for high-throughput sequencing data.” 2017. Thesis, University of Illinois – Urbana-Champaign. Accessed April 18, 2021. http://hdl.handle.net/2142/97787.

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

MLA Handbook (7th Edition):

Manikandan, Gowthami Jayashri. “Comprehensive evaluation of error correction methods for high-throughput sequencing data.” 2017. Web. 18 Apr 2021.

Vancouver:

Manikandan GJ. Comprehensive evaluation of error correction methods for high-throughput sequencing data. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2017. [cited 2021 Apr 18]. Available from: http://hdl.handle.net/2142/97787.

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

Council of Science Editors:

Manikandan GJ. Comprehensive evaluation of error correction methods for high-throughput sequencing data. [Thesis]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97787

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


Georgia Tech

5. Jammula, Nagakishore. Parallel algorithms for enabling fast and scalable analysis of high-throughput sequencing datasets.

Degree: PhD, Electrical and Computer Engineering, 2019, Georgia Tech

 The objective of this research is to develop parallel algorithms for enabling fast and scalable analysis of large-scale high-throughput sequencing datasets. Genome of an organism… (more)

Subjects/Keywords: High-throughput sequencing; Parallel algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jammula, N. (2019). Parallel algorithms for enabling fast and scalable analysis of high-throughput sequencing datasets. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/61740

Chicago Manual of Style (16th Edition):

Jammula, Nagakishore. “Parallel algorithms for enabling fast and scalable analysis of high-throughput sequencing datasets.” 2019. Doctoral Dissertation, Georgia Tech. Accessed April 18, 2021. http://hdl.handle.net/1853/61740.

MLA Handbook (7th Edition):

Jammula, Nagakishore. “Parallel algorithms for enabling fast and scalable analysis of high-throughput sequencing datasets.” 2019. Web. 18 Apr 2021.

Vancouver:

Jammula N. Parallel algorithms for enabling fast and scalable analysis of high-throughput sequencing datasets. [Internet] [Doctoral dissertation]. Georgia Tech; 2019. [cited 2021 Apr 18]. Available from: http://hdl.handle.net/1853/61740.

Council of Science Editors:

Jammula N. Parallel algorithms for enabling fast and scalable analysis of high-throughput sequencing datasets. [Doctoral Dissertation]. Georgia Tech; 2019. Available from: http://hdl.handle.net/1853/61740


Hong Kong University of Science and Technology

6. Zhao, Yan. Accelerating betweenness centrality computation on heterogeneous processors.

Degree: 2014, Hong Kong University of Science and Technology

 The betweenness centrality (BC) measure of nodes in a graph is widely used in graph analysis. As both multicore CPUs and manycore GPUs are becoming… (more)

Subjects/Keywords: Graphics processing units ; Computer algorithms ; Parallel algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhao, Y. (2014). Accelerating betweenness centrality computation on heterogeneous processors. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-70599 ; https://doi.org/10.14711/thesis-b1301512 ; http://repository.ust.hk/ir/bitstream/1783.1-70599/1/th_redirect.html

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):

Zhao, Yan. “Accelerating betweenness centrality computation on heterogeneous processors.” 2014. Thesis, Hong Kong University of Science and Technology. Accessed April 18, 2021. http://repository.ust.hk/ir/Record/1783.1-70599 ; https://doi.org/10.14711/thesis-b1301512 ; http://repository.ust.hk/ir/bitstream/1783.1-70599/1/th_redirect.html.

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

MLA Handbook (7th Edition):

Zhao, Yan. “Accelerating betweenness centrality computation on heterogeneous processors.” 2014. Web. 18 Apr 2021.

Vancouver:

Zhao Y. Accelerating betweenness centrality computation on heterogeneous processors. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2014. [cited 2021 Apr 18]. Available from: http://repository.ust.hk/ir/Record/1783.1-70599 ; https://doi.org/10.14711/thesis-b1301512 ; http://repository.ust.hk/ir/bitstream/1783.1-70599/1/th_redirect.html.

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

Council of Science Editors:

Zhao Y. Accelerating betweenness centrality computation on heterogeneous processors. [Thesis]. Hong Kong University of Science and Technology; 2014. Available from: http://repository.ust.hk/ir/Record/1783.1-70599 ; https://doi.org/10.14711/thesis-b1301512 ; http://repository.ust.hk/ir/bitstream/1783.1-70599/1/th_redirect.html

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


Georgia Tech

7. Sachdeva, Vipin. Efficient parallel algorithms for error correction and transcriptome assembly of biological sequences.

Degree: PhD, Computational Science and Engineering, 2018, Georgia Tech

 Next-generation sequencing technologies have led to a big data age in biology. Since the sequencing of the human genome, the primary bottleneck has steadily moved… (more)

Subjects/Keywords: HPC; Parallel algorithms; Transcriptome assembly; Error correction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sachdeva, V. (2018). Efficient parallel algorithms for error correction and transcriptome assembly of biological sequences. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/62612

Chicago Manual of Style (16th Edition):

Sachdeva, Vipin. “Efficient parallel algorithms for error correction and transcriptome assembly of biological sequences.” 2018. Doctoral Dissertation, Georgia Tech. Accessed April 18, 2021. http://hdl.handle.net/1853/62612.

MLA Handbook (7th Edition):

Sachdeva, Vipin. “Efficient parallel algorithms for error correction and transcriptome assembly of biological sequences.” 2018. Web. 18 Apr 2021.

Vancouver:

Sachdeva V. Efficient parallel algorithms for error correction and transcriptome assembly of biological sequences. [Internet] [Doctoral dissertation]. Georgia Tech; 2018. [cited 2021 Apr 18]. Available from: http://hdl.handle.net/1853/62612.

Council of Science Editors:

Sachdeva V. Efficient parallel algorithms for error correction and transcriptome assembly of biological sequences. [Doctoral Dissertation]. Georgia Tech; 2018. Available from: http://hdl.handle.net/1853/62612


University of Georgia

8. Jain, Ayushi. Parallel algorithms for subgraph pattern matching.

Degree: 2015, University of Georgia

 Due to the growing importance of Big Data, graphs are becoming huge in size and are rapidly getting too large for conventional computer approaches. Graph… (more)

Subjects/Keywords: subgraph isomorphism; parallel algorithms; dual simulation; Akka

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jain, A. (2015). Parallel algorithms for subgraph pattern matching. (Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/30923

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):

Jain, Ayushi. “Parallel algorithms for subgraph pattern matching.” 2015. Thesis, University of Georgia. Accessed April 18, 2021. http://hdl.handle.net/10724/30923.

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

MLA Handbook (7th Edition):

Jain, Ayushi. “Parallel algorithms for subgraph pattern matching.” 2015. Web. 18 Apr 2021.

Vancouver:

Jain A. Parallel algorithms for subgraph pattern matching. [Internet] [Thesis]. University of Georgia; 2015. [cited 2021 Apr 18]. Available from: http://hdl.handle.net/10724/30923.

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

Council of Science Editors:

Jain A. Parallel algorithms for subgraph pattern matching. [Thesis]. University of Georgia; 2015. Available from: http://hdl.handle.net/10724/30923

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


Penn State University

9. Chen, Yao. Algebraic Multilevel Methods for Graph Laplacians.

Degree: 2012, Penn State University

 This dissertation presents estimates of the convergence rate and computational complexity of an algebraic multilevel preconditioner of graph Laplacian problems. The aim is to construct… (more)

Subjects/Keywords: Algebraic Multigrid Methods; Graph Laplacians; Parallel Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, Y. (2012). Algebraic Multilevel Methods for Graph Laplacians. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/15362

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):

Chen, Yao. “Algebraic Multilevel Methods for Graph Laplacians.” 2012. Thesis, Penn State University. Accessed April 18, 2021. https://submit-etda.libraries.psu.edu/catalog/15362.

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

MLA Handbook (7th Edition):

Chen, Yao. “Algebraic Multilevel Methods for Graph Laplacians.” 2012. Web. 18 Apr 2021.

Vancouver:

Chen Y. Algebraic Multilevel Methods for Graph Laplacians. [Internet] [Thesis]. Penn State University; 2012. [cited 2021 Apr 18]. Available from: https://submit-etda.libraries.psu.edu/catalog/15362.

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

Council of Science Editors:

Chen Y. Algebraic Multilevel Methods for Graph Laplacians. [Thesis]. Penn State University; 2012. Available from: https://submit-etda.libraries.psu.edu/catalog/15362

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


University of Connecticut

10. Munavalli, Seema M. Efficient Algorithms for Sorting on GPUs.

Degree: MS, Computer Science and Engineering, 2012, University of Connecticut

  Sorting is an important problem in computing that has a rich history of investigation by various researchers. In this thesis we focus on this… (more)

Subjects/Keywords: Sorting; Graphics Processing Units; Parallel Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Munavalli, S. M. (2012). Efficient Algorithms for Sorting on GPUs. (Masters Thesis). University of Connecticut. Retrieved from https://opencommons.uconn.edu/gs_theses/322

Chicago Manual of Style (16th Edition):

Munavalli, Seema M. “Efficient Algorithms for Sorting on GPUs.” 2012. Masters Thesis, University of Connecticut. Accessed April 18, 2021. https://opencommons.uconn.edu/gs_theses/322.

MLA Handbook (7th Edition):

Munavalli, Seema M. “Efficient Algorithms for Sorting on GPUs.” 2012. Web. 18 Apr 2021.

Vancouver:

Munavalli SM. Efficient Algorithms for Sorting on GPUs. [Internet] [Masters thesis]. University of Connecticut; 2012. [cited 2021 Apr 18]. Available from: https://opencommons.uconn.edu/gs_theses/322.

Council of Science Editors:

Munavalli SM. Efficient Algorithms for Sorting on GPUs. [Masters Thesis]. University of Connecticut; 2012. Available from: https://opencommons.uconn.edu/gs_theses/322


University of Colorado

11. Cong, Cui. Implicit Space-Time Domain Decomposition Methods for Stochastic Parabolic Partial Differential Equations.

Degree: PhD, Mathematics, 2013, University of Colorado

  We introduce and study parallel space-time domain decomposition methods for solving deterministic and stochastic parabolic equations. Traditional parallel algorithms solve parabolic problems time step… (more)

Subjects/Keywords: time-parallel algorithms; Schwarz methods; recycling; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cong, C. (2013). Implicit Space-Time Domain Decomposition Methods for Stochastic Parabolic Partial Differential Equations. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/math_gradetds/23

Chicago Manual of Style (16th Edition):

Cong, Cui. “Implicit Space-Time Domain Decomposition Methods for Stochastic Parabolic Partial Differential Equations.” 2013. Doctoral Dissertation, University of Colorado. Accessed April 18, 2021. https://scholar.colorado.edu/math_gradetds/23.

MLA Handbook (7th Edition):

Cong, Cui. “Implicit Space-Time Domain Decomposition Methods for Stochastic Parabolic Partial Differential Equations.” 2013. Web. 18 Apr 2021.

Vancouver:

Cong C. Implicit Space-Time Domain Decomposition Methods for Stochastic Parabolic Partial Differential Equations. [Internet] [Doctoral dissertation]. University of Colorado; 2013. [cited 2021 Apr 18]. Available from: https://scholar.colorado.edu/math_gradetds/23.

Council of Science Editors:

Cong C. Implicit Space-Time Domain Decomposition Methods for Stochastic Parabolic Partial Differential Equations. [Doctoral Dissertation]. University of Colorado; 2013. Available from: https://scholar.colorado.edu/math_gradetds/23

12. Cadenas Medina, Oswaldo. Partial dynamic reconfiguration of FPGAs for systolic circuits.

Degree: PhD, 2002, University of Reading

Subjects/Keywords: 621; Parallel algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cadenas Medina, O. (2002). Partial dynamic reconfiguration of FPGAs for systolic circuits. (Doctoral Dissertation). University of Reading. Retrieved from http://centaur.reading.ac.uk/18884/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.270913

Chicago Manual of Style (16th Edition):

Cadenas Medina, Oswaldo. “Partial dynamic reconfiguration of FPGAs for systolic circuits.” 2002. Doctoral Dissertation, University of Reading. Accessed April 18, 2021. http://centaur.reading.ac.uk/18884/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.270913.

MLA Handbook (7th Edition):

Cadenas Medina, Oswaldo. “Partial dynamic reconfiguration of FPGAs for systolic circuits.” 2002. Web. 18 Apr 2021.

Vancouver:

Cadenas Medina O. Partial dynamic reconfiguration of FPGAs for systolic circuits. [Internet] [Doctoral dissertation]. University of Reading; 2002. [cited 2021 Apr 18]. Available from: http://centaur.reading.ac.uk/18884/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.270913.

Council of Science Editors:

Cadenas Medina O. Partial dynamic reconfiguration of FPGAs for systolic circuits. [Doctoral Dissertation]. University of Reading; 2002. Available from: http://centaur.reading.ac.uk/18884/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.270913


University of Montana

13. Wolf, Peter Michael. AN EQUIVALENT CLASS SOLUTION FOR A COMPLETE TEST OF A PARALLEL PROGRAM.

Degree: MS, 2011, University of Montana

 With the advent of multi-core chips (multiple CPUs on a single chip) a fundamental shift in the design of programs is taking place. Previous use… (more)

Subjects/Keywords: Algorithms; Parallel Software; Software Quality Assurance

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wolf, P. M. (2011). AN EQUIVALENT CLASS SOLUTION FOR A COMPLETE TEST OF A PARALLEL PROGRAM. (Masters Thesis). University of Montana. Retrieved from https://scholarworks.umt.edu/etd/126

Chicago Manual of Style (16th Edition):

Wolf, Peter Michael. “AN EQUIVALENT CLASS SOLUTION FOR A COMPLETE TEST OF A PARALLEL PROGRAM.” 2011. Masters Thesis, University of Montana. Accessed April 18, 2021. https://scholarworks.umt.edu/etd/126.

MLA Handbook (7th Edition):

Wolf, Peter Michael. “AN EQUIVALENT CLASS SOLUTION FOR A COMPLETE TEST OF A PARALLEL PROGRAM.” 2011. Web. 18 Apr 2021.

Vancouver:

Wolf PM. AN EQUIVALENT CLASS SOLUTION FOR A COMPLETE TEST OF A PARALLEL PROGRAM. [Internet] [Masters thesis]. University of Montana; 2011. [cited 2021 Apr 18]. Available from: https://scholarworks.umt.edu/etd/126.

Council of Science Editors:

Wolf PM. AN EQUIVALENT CLASS SOLUTION FOR A COMPLETE TEST OF A PARALLEL PROGRAM. [Masters Thesis]. University of Montana; 2011. Available from: https://scholarworks.umt.edu/etd/126


University of Sydney

14. Pang, Xiaolin. Scalable Algorithms for Outlier Detection .

Degree: 2014, University of Sydney

 Outlier detection is an important problem for the data mining community as outliers often embody potentially new and valuable information. Nowadays, in the face of… (more)

Subjects/Keywords: scalable algorithms; outlier detection; parallel computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pang, X. (2014). Scalable Algorithms for Outlier Detection . (Thesis). University of Sydney. Retrieved from http://hdl.handle.net/2123/11743

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):

Pang, Xiaolin. “Scalable Algorithms for Outlier Detection .” 2014. Thesis, University of Sydney. Accessed April 18, 2021. http://hdl.handle.net/2123/11743.

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

MLA Handbook (7th Edition):

Pang, Xiaolin. “Scalable Algorithms for Outlier Detection .” 2014. Web. 18 Apr 2021.

Vancouver:

Pang X. Scalable Algorithms for Outlier Detection . [Internet] [Thesis]. University of Sydney; 2014. [cited 2021 Apr 18]. Available from: http://hdl.handle.net/2123/11743.

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

Council of Science Editors:

Pang X. Scalable Algorithms for Outlier Detection . [Thesis]. University of Sydney; 2014. Available from: http://hdl.handle.net/2123/11743

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


Universidad Nacional de La Plata

15. Sanz, Victoria María. Análisis de rendimiento de un algoritmo de diagonalización de matrices por el método de Jacobi sobre una arquitectura multicore.

Degree: 2012, Universidad Nacional de La Plata

El objetivo general de este trabajo es mostrar la aceleración en el tiempo de cómputo que se obtiene al paralelizar el algoritmo de diagonalización de… (more)

Subjects/Keywords: Ciencias Informáticas; Algorithms; Parallel programming; Threads

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sanz, V. M. (2012). Análisis de rendimiento de un algoritmo de diagonalización de matrices por el método de Jacobi sobre una arquitectura multicore. (Thesis). Universidad Nacional de La Plata. Retrieved from http://sedici.unlp.edu.ar/handle/10915/20756

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):

Sanz, Victoria María. “Análisis de rendimiento de un algoritmo de diagonalización de matrices por el método de Jacobi sobre una arquitectura multicore.” 2012. Thesis, Universidad Nacional de La Plata. Accessed April 18, 2021. http://sedici.unlp.edu.ar/handle/10915/20756.

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

MLA Handbook (7th Edition):

Sanz, Victoria María. “Análisis de rendimiento de un algoritmo de diagonalización de matrices por el método de Jacobi sobre una arquitectura multicore.” 2012. Web. 18 Apr 2021.

Vancouver:

Sanz VM. Análisis de rendimiento de un algoritmo de diagonalización de matrices por el método de Jacobi sobre una arquitectura multicore. [Internet] [Thesis]. Universidad Nacional de La Plata; 2012. [cited 2021 Apr 18]. Available from: http://sedici.unlp.edu.ar/handle/10915/20756.

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

Council of Science Editors:

Sanz VM. Análisis de rendimiento de un algoritmo de diagonalización de matrices por el método de Jacobi sobre una arquitectura multicore. [Thesis]. Universidad Nacional de La Plata; 2012. Available from: http://sedici.unlp.edu.ar/handle/10915/20756

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


Universidad Nacional de La Plata

16. Wolfmann, Aaron Gustavo Horacio. PEM - Modelo de Ejecución Paralela basado en redes de Petri.

Degree: 2015, Universidad Nacional de La Plata

El objetivo de la tesis es la definición de un modelo de ejecución paralelo, que basado en la representación de un algoritmo paralelo con Redes… (more)

Subjects/Keywords: Ciencias Informáticas; Petri nets; Algorithms; Parallel programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wolfmann, A. G. H. (2015). PEM - Modelo de Ejecución Paralela basado en redes de Petri. (Thesis). Universidad Nacional de La Plata. Retrieved from http://sedici.unlp.edu.ar/handle/10915/45069 ; https://doi.org/10.35537/10915/45069

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):

Wolfmann, Aaron Gustavo Horacio. “PEM - Modelo de Ejecución Paralela basado en redes de Petri.” 2015. Thesis, Universidad Nacional de La Plata. Accessed April 18, 2021. http://sedici.unlp.edu.ar/handle/10915/45069 ; https://doi.org/10.35537/10915/45069.

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

MLA Handbook (7th Edition):

Wolfmann, Aaron Gustavo Horacio. “PEM - Modelo de Ejecución Paralela basado en redes de Petri.” 2015. Web. 18 Apr 2021.

Vancouver:

Wolfmann AGH. PEM - Modelo de Ejecución Paralela basado en redes de Petri. [Internet] [Thesis]. Universidad Nacional de La Plata; 2015. [cited 2021 Apr 18]. Available from: http://sedici.unlp.edu.ar/handle/10915/45069 ; https://doi.org/10.35537/10915/45069.

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

Council of Science Editors:

Wolfmann AGH. PEM - Modelo de Ejecución Paralela basado en redes de Petri. [Thesis]. Universidad Nacional de La Plata; 2015. Available from: http://sedici.unlp.edu.ar/handle/10915/45069 ; https://doi.org/10.35537/10915/45069

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


Universidad Nacional de La Plata

17. Gallo, Silvana. Algoritmos paralelos sobre cluster de <i>multicore</i> : Aplicación a problemas de simulación.

Degree: 2012, Universidad Nacional de La Plata

El objetivo de la presente Tesina es realizar la investigación y desarrollo de algoritmos paralelos sobre arquitecturas de soporte actuales de múltiples núcleos (como multicores… (more)

Subjects/Keywords: Ciencias Informáticas; Modeling techniques; Simulation; Parallel algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gallo, S. (2012). Algoritmos paralelos sobre cluster de <i>multicore</i> : Aplicación a problemas de simulación. (Thesis). Universidad Nacional de La Plata. Retrieved from http://sedici.unlp.edu.ar/handle/10915/47042

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):

Gallo, Silvana. “Algoritmos paralelos sobre cluster de <i>multicore</i> : Aplicación a problemas de simulación.” 2012. Thesis, Universidad Nacional de La Plata. Accessed April 18, 2021. http://sedici.unlp.edu.ar/handle/10915/47042.

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

MLA Handbook (7th Edition):

Gallo, Silvana. “Algoritmos paralelos sobre cluster de <i>multicore</i> : Aplicación a problemas de simulación.” 2012. Web. 18 Apr 2021.

Vancouver:

Gallo S. Algoritmos paralelos sobre cluster de <i>multicore</i> : Aplicación a problemas de simulación. [Internet] [Thesis]. Universidad Nacional de La Plata; 2012. [cited 2021 Apr 18]. Available from: http://sedici.unlp.edu.ar/handle/10915/47042.

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

Council of Science Editors:

Gallo S. Algoritmos paralelos sobre cluster de <i>multicore</i> : Aplicación a problemas de simulación. [Thesis]. Universidad Nacional de La Plata; 2012. Available from: http://sedici.unlp.edu.ar/handle/10915/47042

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


Michigan State University

18. Hughey, Stephen Michael. Efficient parallelization of non-uniform fast multipole algorithms.

Degree: 2018, Michigan State University

Thesis Ph. D. Michigan State University. Electrical and Computer Engineering ; Computational Mathematics, Science, and Engineering 2018

Many applications of the N-body problem today involve… (more)

Subjects/Keywords: Parallel algorithms; Computational physics; Electromagnetics; Electrical engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hughey, S. M. (2018). Efficient parallelization of non-uniform fast multipole algorithms. (Thesis). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:16396

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):

Hughey, Stephen Michael. “Efficient parallelization of non-uniform fast multipole algorithms.” 2018. Thesis, Michigan State University. Accessed April 18, 2021. http://etd.lib.msu.edu/islandora/object/etd:16396.

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

MLA Handbook (7th Edition):

Hughey, Stephen Michael. “Efficient parallelization of non-uniform fast multipole algorithms.” 2018. Web. 18 Apr 2021.

Vancouver:

Hughey SM. Efficient parallelization of non-uniform fast multipole algorithms. [Internet] [Thesis]. Michigan State University; 2018. [cited 2021 Apr 18]. Available from: http://etd.lib.msu.edu/islandora/object/etd:16396.

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

Council of Science Editors:

Hughey SM. Efficient parallelization of non-uniform fast multipole algorithms. [Thesis]. Michigan State University; 2018. Available from: http://etd.lib.msu.edu/islandora/object/etd:16396

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


University of Georgia

19. Williams, Gita C. The reconfigurable MultiRing and applications.

Degree: 2014, University of Georgia

 The goal of this dissertation was to further study the MultiRing network which was first introduced by Arabnia [8]. Novel communication models have been developed… (more)

Subjects/Keywords: parallel algorithms; parallel computer; reconfigurable architectures; multiprogramming; interconnections networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Williams, G. C. (2014). The reconfigurable MultiRing and applications. (Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/21400

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):

Williams, Gita C. “The reconfigurable MultiRing and applications.” 2014. Thesis, University of Georgia. Accessed April 18, 2021. http://hdl.handle.net/10724/21400.

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

MLA Handbook (7th Edition):

Williams, Gita C. “The reconfigurable MultiRing and applications.” 2014. Web. 18 Apr 2021.

Vancouver:

Williams GC. The reconfigurable MultiRing and applications. [Internet] [Thesis]. University of Georgia; 2014. [cited 2021 Apr 18]. Available from: http://hdl.handle.net/10724/21400.

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

Council of Science Editors:

Williams GC. The reconfigurable MultiRing and applications. [Thesis]. University of Georgia; 2014. Available from: http://hdl.handle.net/10724/21400

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


Universidade Nova

20. Chorão, Ricardo Daniel Domingos. Parallel programming in biomedical signal processing.

Degree: 2012, Universidade Nova

Dissertação para obtenção do Grau de Mestre em Engenharia Biomédica

Patients with neuromuscular and cardiorespiratory diseases need to be monitored continuously. This constant monitoring gives… (more)

Subjects/Keywords: Parallel processing; Parallel algorithms; Biosignals; Signal processing; Heart rate variability; Respiration

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chorão, R. D. D. (2012). Parallel programming in biomedical signal processing. (Thesis). Universidade Nova. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/8249

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):

Chorão, Ricardo Daniel Domingos. “Parallel programming in biomedical signal processing.” 2012. Thesis, Universidade Nova. Accessed April 18, 2021. http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/8249.

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

MLA Handbook (7th Edition):

Chorão, Ricardo Daniel Domingos. “Parallel programming in biomedical signal processing.” 2012. Web. 18 Apr 2021.

Vancouver:

Chorão RDD. Parallel programming in biomedical signal processing. [Internet] [Thesis]. Universidade Nova; 2012. [cited 2021 Apr 18]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/8249.

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

Council of Science Editors:

Chorão RDD. Parallel programming in biomedical signal processing. [Thesis]. Universidade Nova; 2012. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/8249

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


Stellenbosch University

21. Mauch, Melanie Barbara. An investigation of dead-zone pattern matching algorithms.

Degree: MA, Information Science, 2016, Stellenbosch University

ENGLISH ABSTRACT: Pattern matching allows us to search some text for a word or for a sequence of characters|a popular feature of computer programs such… (more)

Subjects/Keywords: Pattern matching; Algorithms; Dead-zone; CUDA (Computer architecture); Parallel algorithms; UCTD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mauch, M. B. (2016). An investigation of dead-zone pattern matching algorithms. (Masters Thesis). Stellenbosch University. Retrieved from http://hdl.handle.net/10019.1/98487

Chicago Manual of Style (16th Edition):

Mauch, Melanie Barbara. “An investigation of dead-zone pattern matching algorithms.” 2016. Masters Thesis, Stellenbosch University. Accessed April 18, 2021. http://hdl.handle.net/10019.1/98487.

MLA Handbook (7th Edition):

Mauch, Melanie Barbara. “An investigation of dead-zone pattern matching algorithms.” 2016. Web. 18 Apr 2021.

Vancouver:

Mauch MB. An investigation of dead-zone pattern matching algorithms. [Internet] [Masters thesis]. Stellenbosch University; 2016. [cited 2021 Apr 18]. Available from: http://hdl.handle.net/10019.1/98487.

Council of Science Editors:

Mauch MB. An investigation of dead-zone pattern matching algorithms. [Masters Thesis]. Stellenbosch University; 2016. Available from: http://hdl.handle.net/10019.1/98487


Texas A&M University

22. Bulluck, Matthew James. A Framework For Parallelizing Sampling-Based Motion Planning Algorithms.

Degree: MS, Computer Science, 2017, Texas A&M University

 Motion planning is the problem of finding a valid path for a robot from a start position to a goal position. It has many uses… (more)

Subjects/Keywords: Robotic Motion Planning; Sampling-based Motion Planning; Parallel Algorithms; Distributed Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bulluck, M. J. (2017). A Framework For Parallelizing Sampling-Based Motion Planning Algorithms. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/169642

Chicago Manual of Style (16th Edition):

Bulluck, Matthew James. “A Framework For Parallelizing Sampling-Based Motion Planning Algorithms.” 2017. Masters Thesis, Texas A&M University. Accessed April 18, 2021. http://hdl.handle.net/1969.1/169642.

MLA Handbook (7th Edition):

Bulluck, Matthew James. “A Framework For Parallelizing Sampling-Based Motion Planning Algorithms.” 2017. Web. 18 Apr 2021.

Vancouver:

Bulluck MJ. A Framework For Parallelizing Sampling-Based Motion Planning Algorithms. [Internet] [Masters thesis]. Texas A&M University; 2017. [cited 2021 Apr 18]. Available from: http://hdl.handle.net/1969.1/169642.

Council of Science Editors:

Bulluck MJ. A Framework For Parallelizing Sampling-Based Motion Planning Algorithms. [Masters Thesis]. Texas A&M University; 2017. Available from: http://hdl.handle.net/1969.1/169642


Texas A&M University

23. Pearce, Roger Allan. Scalable Parallel Algorithms for Massive Scale-free Graphs.

Degree: PhD, Computer Science, 2013, Texas A&M University

 Efficiently storing and processing massive graph data sets is a challenging problem as researchers seek to leverage “Big Data” to answer next-generation scientific questions. New… (more)

Subjects/Keywords: parallel algorithms; graph algorithms; scale-free graphs; graph partitioning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pearce, R. A. (2013). Scalable Parallel Algorithms for Massive Scale-free Graphs. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/151937

Chicago Manual of Style (16th Edition):

Pearce, Roger Allan. “Scalable Parallel Algorithms for Massive Scale-free Graphs.” 2013. Doctoral Dissertation, Texas A&M University. Accessed April 18, 2021. http://hdl.handle.net/1969.1/151937.

MLA Handbook (7th Edition):

Pearce, Roger Allan. “Scalable Parallel Algorithms for Massive Scale-free Graphs.” 2013. Web. 18 Apr 2021.

Vancouver:

Pearce RA. Scalable Parallel Algorithms for Massive Scale-free Graphs. [Internet] [Doctoral dissertation]. Texas A&M University; 2013. [cited 2021 Apr 18]. Available from: http://hdl.handle.net/1969.1/151937.

Council of Science Editors:

Pearce RA. Scalable Parallel Algorithms for Massive Scale-free Graphs. [Doctoral Dissertation]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/151937


Hong Kong University of Science and Technology

24. Wu, Junkai. Accelerating all-pairs shortest path search on GPUs.

Degree: 2013, Hong Kong University of Science and Technology

 The All-Pairs Shortest Path (APSP) problem has many applications, such as driving directions in online map services and connection analysis in social networks. With the… (more)

Subjects/Keywords: Parallel algorithms ; Computer algorithms ; Digital maps ; Data processing ; Graphics processing units

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wu, J. (2013). Accelerating all-pairs shortest path search on GPUs. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-62298 ; https://doi.org/10.14711/thesis-b1255217 ; http://repository.ust.hk/ir/bitstream/1783.1-62298/1/th_redirect.html

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):

Wu, Junkai. “Accelerating all-pairs shortest path search on GPUs.” 2013. Thesis, Hong Kong University of Science and Technology. Accessed April 18, 2021. http://repository.ust.hk/ir/Record/1783.1-62298 ; https://doi.org/10.14711/thesis-b1255217 ; http://repository.ust.hk/ir/bitstream/1783.1-62298/1/th_redirect.html.

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

MLA Handbook (7th Edition):

Wu, Junkai. “Accelerating all-pairs shortest path search on GPUs.” 2013. Web. 18 Apr 2021.

Vancouver:

Wu J. Accelerating all-pairs shortest path search on GPUs. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2013. [cited 2021 Apr 18]. Available from: http://repository.ust.hk/ir/Record/1783.1-62298 ; https://doi.org/10.14711/thesis-b1255217 ; http://repository.ust.hk/ir/bitstream/1783.1-62298/1/th_redirect.html.

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

Council of Science Editors:

Wu J. Accelerating all-pairs shortest path search on GPUs. [Thesis]. Hong Kong University of Science and Technology; 2013. Available from: http://repository.ust.hk/ir/Record/1783.1-62298 ; https://doi.org/10.14711/thesis-b1255217 ; http://repository.ust.hk/ir/bitstream/1783.1-62298/1/th_redirect.html

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


The Ohio State University

25. Slatton, Andrew G. Scalable Algorithms for Delaunay Mesh Generation.

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

 Delaunay refinement is a useful tool for sampling and meshing. Pioneered by Ruppert and Chew for piecewise-linear complexes in R2, Delaunay refinement has been extended… (more)

Subjects/Keywords: Computer Science; Mesh generation; Delaunay; Parallel algorithms; Scalable algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Slatton, A. G. (2014). Scalable Algorithms for Delaunay Mesh Generation. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1406758013

Chicago Manual of Style (16th Edition):

Slatton, Andrew G. “Scalable Algorithms for Delaunay Mesh Generation.” 2014. Doctoral Dissertation, The Ohio State University. Accessed April 18, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=osu1406758013.

MLA Handbook (7th Edition):

Slatton, Andrew G. “Scalable Algorithms for Delaunay Mesh Generation.” 2014. Web. 18 Apr 2021.

Vancouver:

Slatton AG. Scalable Algorithms for Delaunay Mesh Generation. [Internet] [Doctoral dissertation]. The Ohio State University; 2014. [cited 2021 Apr 18]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1406758013.

Council of Science Editors:

Slatton AG. Scalable Algorithms for Delaunay Mesh Generation. [Doctoral Dissertation]. The Ohio State University; 2014. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1406758013


Montana State University

26. Helzer, David Michael. An empirical study of parallel genetic algorithms for the traveling salesman and job-shop scheduling problems.

Degree: MS, College of Engineering, 2001, Montana State University

Subjects/Keywords: Genetic algorithms; Parallel algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Helzer, D. M. (2001). An empirical study of parallel genetic algorithms for the traveling salesman and job-shop scheduling problems. (Masters Thesis). Montana State University. Retrieved from https://scholarworks.montana.edu/xmlui/handle/1/8104

Chicago Manual of Style (16th Edition):

Helzer, David Michael. “An empirical study of parallel genetic algorithms for the traveling salesman and job-shop scheduling problems.” 2001. Masters Thesis, Montana State University. Accessed April 18, 2021. https://scholarworks.montana.edu/xmlui/handle/1/8104.

MLA Handbook (7th Edition):

Helzer, David Michael. “An empirical study of parallel genetic algorithms for the traveling salesman and job-shop scheduling problems.” 2001. Web. 18 Apr 2021.

Vancouver:

Helzer DM. An empirical study of parallel genetic algorithms for the traveling salesman and job-shop scheduling problems. [Internet] [Masters thesis]. Montana State University; 2001. [cited 2021 Apr 18]. Available from: https://scholarworks.montana.edu/xmlui/handle/1/8104.

Council of Science Editors:

Helzer DM. An empirical study of parallel genetic algorithms for the traveling salesman and job-shop scheduling problems. [Masters Thesis]. Montana State University; 2001. Available from: https://scholarworks.montana.edu/xmlui/handle/1/8104


Hong Kong University of Science and Technology

27. Lai, Zhuohang. Accelerating data-parallel primitives and multi-way joins on heterogeneous processors.

Degree: 2020, Hong Kong University of Science and Technology

 Data-parallel primitives, such as gather, scatter, scan (prefix sum), and split, are widely used in parallel programs. Multi-way joins are a common operator in data… (more)

Subjects/Keywords: Heterogeneous computing ; Parallel algorithms ; Computer algorithms ; Graphics processing units

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lai, Z. (2020). Accelerating data-parallel primitives and multi-way joins on heterogeneous processors. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-108763 ; https://doi.org/10.14711/thesis-991012879862703412 ; http://repository.ust.hk/ir/bitstream/1783.1-108763/1/th_redirect.html

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):

Lai, Zhuohang. “Accelerating data-parallel primitives and multi-way joins on heterogeneous processors.” 2020. Thesis, Hong Kong University of Science and Technology. Accessed April 18, 2021. http://repository.ust.hk/ir/Record/1783.1-108763 ; https://doi.org/10.14711/thesis-991012879862703412 ; http://repository.ust.hk/ir/bitstream/1783.1-108763/1/th_redirect.html.

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

MLA Handbook (7th Edition):

Lai, Zhuohang. “Accelerating data-parallel primitives and multi-way joins on heterogeneous processors.” 2020. Web. 18 Apr 2021.

Vancouver:

Lai Z. Accelerating data-parallel primitives and multi-way joins on heterogeneous processors. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2020. [cited 2021 Apr 18]. Available from: http://repository.ust.hk/ir/Record/1783.1-108763 ; https://doi.org/10.14711/thesis-991012879862703412 ; http://repository.ust.hk/ir/bitstream/1783.1-108763/1/th_redirect.html.

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

Council of Science Editors:

Lai Z. Accelerating data-parallel primitives and multi-way joins on heterogeneous processors. [Thesis]. Hong Kong University of Science and Technology; 2020. Available from: http://repository.ust.hk/ir/Record/1783.1-108763 ; https://doi.org/10.14711/thesis-991012879862703412 ; http://repository.ust.hk/ir/bitstream/1783.1-108763/1/th_redirect.html

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


Universidade Federal de Mato Grosso do Sul

28. Silva, Pedro Henrique Neves da. Algoritmos paralelos para o alinhamento de sequências genômicas .

Degree: 2014, Universidade Federal de Mato Grosso do Sul

 No estudo da evolução dos organismos, ou das funções biológicas das moléculas, é comum a comparação entre diferentes organismos, ou moléculas, onde, em geral, essas… (more)

Subjects/Keywords: Algorítmos Paralelos; Programação Paralela (Computação); Bioinformática; Parallel Algorithms; Parallel Programming (Computer Science); Bioinformatics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Silva, P. H. N. d. (2014). Algoritmos paralelos para o alinhamento de sequências genômicas . (Thesis). Universidade Federal de Mato Grosso do Sul. Retrieved from http://repositorio.cbc.ufms.br:8080/jspui/handle/123456789/2074

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):

Silva, Pedro Henrique Neves da. “Algoritmos paralelos para o alinhamento de sequências genômicas .” 2014. Thesis, Universidade Federal de Mato Grosso do Sul. Accessed April 18, 2021. http://repositorio.cbc.ufms.br:8080/jspui/handle/123456789/2074.

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

MLA Handbook (7th Edition):

Silva, Pedro Henrique Neves da. “Algoritmos paralelos para o alinhamento de sequências genômicas .” 2014. Web. 18 Apr 2021.

Vancouver:

Silva PHNd. Algoritmos paralelos para o alinhamento de sequências genômicas . [Internet] [Thesis]. Universidade Federal de Mato Grosso do Sul; 2014. [cited 2021 Apr 18]. Available from: http://repositorio.cbc.ufms.br:8080/jspui/handle/123456789/2074.

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

Council of Science Editors:

Silva PHNd. Algoritmos paralelos para o alinhamento de sequências genômicas . [Thesis]. Universidade Federal de Mato Grosso do Sul; 2014. Available from: http://repositorio.cbc.ufms.br:8080/jspui/handle/123456789/2074

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


University of Guelph

29. Radford, Dave. A Comparative Analysis of the Performance of Scalable Parallel Patterns Applied to Genetic Algorithms and Configured for NVIDIA GPUs.

Degree: MS, School of Computer Science, 2016, University of Guelph

Parallel programming is becoming the norm for modern computer programming. In order to utilize system resources effectively, programmers can use programming patterns to improve their… (more)

Subjects/Keywords: Parallel Patterns; Genetic Algorithms; Travelling Salesman Problem; Many-core devices; CUDA; Parallel Computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Radford, D. (2016). A Comparative Analysis of the Performance of Scalable Parallel Patterns Applied to Genetic Algorithms and Configured for NVIDIA GPUs. (Masters Thesis). University of Guelph. Retrieved from https://atrium.lib.uoguelph.ca/xmlui/handle/10214/9762

Chicago Manual of Style (16th Edition):

Radford, Dave. “A Comparative Analysis of the Performance of Scalable Parallel Patterns Applied to Genetic Algorithms and Configured for NVIDIA GPUs.” 2016. Masters Thesis, University of Guelph. Accessed April 18, 2021. https://atrium.lib.uoguelph.ca/xmlui/handle/10214/9762.

MLA Handbook (7th Edition):

Radford, Dave. “A Comparative Analysis of the Performance of Scalable Parallel Patterns Applied to Genetic Algorithms and Configured for NVIDIA GPUs.” 2016. Web. 18 Apr 2021.

Vancouver:

Radford D. A Comparative Analysis of the Performance of Scalable Parallel Patterns Applied to Genetic Algorithms and Configured for NVIDIA GPUs. [Internet] [Masters thesis]. University of Guelph; 2016. [cited 2021 Apr 18]. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/9762.

Council of Science Editors:

Radford D. A Comparative Analysis of the Performance of Scalable Parallel Patterns Applied to Genetic Algorithms and Configured for NVIDIA GPUs. [Masters Thesis]. University of Guelph; 2016. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/9762


California State University – San Bernardino

30. Concepcion, Rowen. Introducing Non-Determinism to the Parallel C Compiler.

Degree: MSin Computer Science, School of Computer Science and Engineering, 2014, California State University – San Bernardino

  The Planguages project is the birthplace of the Planguage programming approach, which is designed to alleviate the task of writing parallel programs and harness… (more)

Subjects/Keywords: Non-Determinism; Parallel Programming; Parallel C; SOS; Shortcutting; Programming Languages and Compilers; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Concepcion, R. (2014). Introducing Non-Determinism to the Parallel C Compiler. (Thesis). California State University – San Bernardino. Retrieved from https://scholarworks.lib.csusb.edu/etd/22

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):

Concepcion, Rowen. “Introducing Non-Determinism to the Parallel C Compiler.” 2014. Thesis, California State University – San Bernardino. Accessed April 18, 2021. https://scholarworks.lib.csusb.edu/etd/22.

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

MLA Handbook (7th Edition):

Concepcion, Rowen. “Introducing Non-Determinism to the Parallel C Compiler.” 2014. Web. 18 Apr 2021.

Vancouver:

Concepcion R. Introducing Non-Determinism to the Parallel C Compiler. [Internet] [Thesis]. California State University – San Bernardino; 2014. [cited 2021 Apr 18]. Available from: https://scholarworks.lib.csusb.edu/etd/22.

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

Council of Science Editors:

Concepcion R. Introducing Non-Determinism to the Parallel C Compiler. [Thesis]. California State University – San Bernardino; 2014. Available from: https://scholarworks.lib.csusb.edu/etd/22

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

[1] [2] [3] [4] [5] … [17]

.