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:(DISTRIBUTED ALGORITHMS PARALLEL ALGORITHMS PROGRAMMING METHODS ). Showing records 1 – 30 of 51104 total matches.

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

Search Limiters

Last 2 Years | English Only

Degrees

Languages

Country

▼ Search Limiters


Universidad Nacional de La Plata

1. Rucci, Enzo. Computación eficiente del alineamiento de secuencias de ADN sobre cluster de multicores.

Degree: 2013, Universidad Nacional de La Plata

Una de las áreas de mayor interés y crecimiento en los últimos años dentro del procesamiento paralelo es la del tratamiento de grandes volúmenes de… (more)

Subjects/Keywords: Ciencias Informáticas; Parallel programming; alineamiento de secuencias de ADN; cluster de multicores; Distributed programming; Algorithms; método Smith-Waterman; programación paralela

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rucci, E. (2013). Computación eficiente del alineamiento de secuencias de ADN sobre cluster de multicores. (Thesis). Universidad Nacional de La Plata. Retrieved from http://sedici.unlp.edu.ar/handle/10915/27737

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

Rucci, Enzo. “Computación eficiente del alineamiento de secuencias de ADN sobre cluster de multicores.” 2013. Thesis, Universidad Nacional de La Plata. Accessed March 03, 2021. http://sedici.unlp.edu.ar/handle/10915/27737.

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

MLA Handbook (7th Edition):

Rucci, Enzo. “Computación eficiente del alineamiento de secuencias de ADN sobre cluster de multicores.” 2013. Web. 03 Mar 2021.

Vancouver:

Rucci E. Computación eficiente del alineamiento de secuencias de ADN sobre cluster de multicores. [Internet] [Thesis]. Universidad Nacional de La Plata; 2013. [cited 2021 Mar 03]. Available from: http://sedici.unlp.edu.ar/handle/10915/27737.

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

Council of Science Editors:

Rucci E. Computación eficiente del alineamiento de secuencias de ADN sobre cluster de multicores. [Thesis]. Universidad Nacional de La Plata; 2013. Available from: http://sedici.unlp.edu.ar/handle/10915/27737

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


Universidad Nacional de La Plata

2. 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 March 03, 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. 03 Mar 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 Mar 03]. 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

3. 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 March 03, 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. 03 Mar 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 Mar 03]. 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


Texas A&M University

4. 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 March 03, 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. 03 Mar 2021.

Vancouver:

Bulluck MJ. A Framework For Parallelizing Sampling-Based Motion Planning Algorithms. [Internet] [Masters thesis]. Texas A&M University; 2017. [cited 2021 Mar 03]. 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


Penn State University

5. 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 March 03, 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. 03 Mar 2021.

Vancouver:

Chen Y. Algebraic Multilevel Methods for Graph Laplacians. [Internet] [Thesis]. Penn State University; 2012. [cited 2021 Mar 03]. 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 Colorado

6. 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 March 03, 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. 03 Mar 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 Mar 03]. 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

7. 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 March 03, 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. 03 Mar 2021.

Vancouver:

Pearce RA. Scalable Parallel Algorithms for Massive Scale-free Graphs. [Internet] [Thesis]. Texas Digital Library; 2013. [cited 2021 Mar 03]. 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


ETH Zürich

8. Morandi, Benjamin. Prototyping a Concurrency Model.

Degree: 2014, ETH Zürich

Subjects/Keywords: VERTEILTE PROGRAMMIERUNG + PARALLELE PROGRAMMIERUNG (PROGRAMMIERMETHODEN); VERTEILTE ALGORITHMEN + PARALLELE ALGORITHMEN (PROGRAMMIERMETHODEN); PARALLELVERARBEITUNG + NEBENLÄUFIGKEIT (BETRIEBSSYSTEME); SPEZIFIKATIONEN (SOFTWARE ENGINEERING); CONCURRENT PROGRAMMING + DISTRIBUTED PROGRAMMING + PARALLEL PROGRAMMING (PROGRAMMING METHODS); DISTRIBUTED ALGORITHMS + PARALLEL ALGORITHMS (PROGRAMMING METHODS); PARALLEL PROCESSING + CONCURRENCY (OPERATING SYSTEMS); SPECIFICATIONS (SOFTWARE ENGINEERING); info:eu-repo/classification/ddc/004; Data processing, computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Morandi, B. (2014). Prototyping a Concurrency Model. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/154649

Chicago Manual of Style (16th Edition):

Morandi, Benjamin. “Prototyping a Concurrency Model.” 2014. Doctoral Dissertation, ETH Zürich. Accessed March 03, 2021. http://hdl.handle.net/20.500.11850/154649.

MLA Handbook (7th Edition):

Morandi, Benjamin. “Prototyping a Concurrency Model.” 2014. Web. 03 Mar 2021.

Vancouver:

Morandi B. Prototyping a Concurrency Model. [Internet] [Doctoral dissertation]. ETH Zürich; 2014. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/20.500.11850/154649.

Council of Science Editors:

Morandi B. Prototyping a Concurrency Model. [Doctoral Dissertation]. ETH Zürich; 2014. Available from: http://hdl.handle.net/20.500.11850/154649


ETH Zürich

9. Schill, Mischael. Unified Interference-free Parallel, Concurrent and Distributed Programming.

Degree: 2016, ETH Zürich

Subjects/Keywords: DISTRIBUTED ALGORITHMS + PARALLEL ALGORITHMS (PROGRAMMING METHODS); PARALLELVERARBEITUNG + NEBENLÄUFIGKEIT (BETRIEBSSYSTEME); VERTEILTE ALGORITHMEN + PARALLELE ALGORITHMEN (PROGRAMMIERMETHODEN); VERTEILTE PROGRAMMIERUNG + PARALLELE PROGRAMMIERUNG (PROGRAMMIERMETHODEN); PARALLEL PROCESSING + CONCURRENCY (OPERATING SYSTEMS); CONCURRENT PROGRAMMING + DISTRIBUTED PROGRAMMING + PARALLEL PROGRAMMING (PROGRAMMING METHODS); info:eu-repo/classification/ddc/004; Data processing, computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schill, M. (2016). Unified Interference-free Parallel, Concurrent and Distributed Programming. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/127377

Chicago Manual of Style (16th Edition):

Schill, Mischael. “Unified Interference-free Parallel, Concurrent and Distributed Programming.” 2016. Doctoral Dissertation, ETH Zürich. Accessed March 03, 2021. http://hdl.handle.net/20.500.11850/127377.

MLA Handbook (7th Edition):

Schill, Mischael. “Unified Interference-free Parallel, Concurrent and Distributed Programming.” 2016. Web. 03 Mar 2021.

Vancouver:

Schill M. Unified Interference-free Parallel, Concurrent and Distributed Programming. [Internet] [Doctoral dissertation]. ETH Zürich; 2016. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/20.500.11850/127377.

Council of Science Editors:

Schill M. Unified Interference-free Parallel, Concurrent and Distributed Programming. [Doctoral Dissertation]. ETH Zürich; 2016. Available from: http://hdl.handle.net/20.500.11850/127377


ETH Zürich

10. Hagen, Claus. A generic kernel for reliable process support.

Degree: 1999, ETH Zürich

Subjects/Keywords: VERTEILTE ALGORITHMEN + PARALLELE ALGORITHMEN (PROGRAMMIERMETHODEN); PROGRAMMIERUMGEBUNGEN (SOFTWARE ENGINEERING); SPEZIELLE PROGRAMMIERMETHODEN; DISTRIBUTED ALGORITHMS + PARALLEL ALGORITHMS (PROGRAMMING METHODS); PROGRAMMING ENVIRONMENTS (SOFTWARE ENGINEERING); SPECIAL PROGRAMMING METHODS; info:eu-repo/classification/ddc/004; Data processing, computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hagen, C. (1999). A generic kernel for reliable process support. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/144058

Chicago Manual of Style (16th Edition):

Hagen, Claus. “A generic kernel for reliable process support.” 1999. Doctoral Dissertation, ETH Zürich. Accessed March 03, 2021. http://hdl.handle.net/20.500.11850/144058.

MLA Handbook (7th Edition):

Hagen, Claus. “A generic kernel for reliable process support.” 1999. Web. 03 Mar 2021.

Vancouver:

Hagen C. A generic kernel for reliable process support. [Internet] [Doctoral dissertation]. ETH Zürich; 1999. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/20.500.11850/144058.

Council of Science Editors:

Hagen C. A generic kernel for reliable process support. [Doctoral Dissertation]. ETH Zürich; 1999. Available from: http://hdl.handle.net/20.500.11850/144058


California State University – San Bernardino

11. 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 March 03, 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. 03 Mar 2021.

Vancouver:

Concepcion R. Introducing Non-Determinism to the Parallel C Compiler. [Internet] [Thesis]. California State University – San Bernardino; 2014. [cited 2021 Mar 03]. 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


ETH Zürich

12. Hudon, Simon. A progress preserving refinement.

Degree: 2011, ETH Zürich

Subjects/Keywords: VERFEINERUNG (SOFTWARE ENGINEERING); VERTEILTE PROGRAMMIERUNG + PARALLELE PROGRAMMIERUNG (PROGRAMMIERMETHODEN); VERTEILTE ALGORITHMEN + PARALLELE ALGORITHMEN (PROGRAMMIERMETHODEN); REFINEMENT (SOFTWARE ENGINEERING); CONCURRENT PROGRAMMING + DISTRIBUTED PROGRAMMING + PARALLEL PROGRAMMING (PROGRAMMING METHODS); DISTRIBUTED ALGORITHMS + PARALLEL ALGORITHMS (PROGRAMMING METHODS); info:eu-repo/classification/ddc/004; Data processing, computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hudon, S. (2011). A progress preserving refinement. (Thesis). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/152835

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

Hudon, Simon. “A progress preserving refinement.” 2011. Thesis, ETH Zürich. Accessed March 03, 2021. http://hdl.handle.net/20.500.11850/152835.

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

MLA Handbook (7th Edition):

Hudon, Simon. “A progress preserving refinement.” 2011. Web. 03 Mar 2021.

Vancouver:

Hudon S. A progress preserving refinement. [Internet] [Thesis]. ETH Zürich; 2011. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/20.500.11850/152835.

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

Council of Science Editors:

Hudon S. A progress preserving refinement. [Thesis]. ETH Zürich; 2011. Available from: http://hdl.handle.net/20.500.11850/152835

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


Hong Kong University of Science and Technology

13. Ma, Shiyao CSE. On the fairness of network resource allocation for data-parallel applications.

Degree: 2018, Hong Kong University of Science and Technology

 Fair allocation of network resources for data-parallel applications is a challenging undertaking. Conflicts between the ever-increasing traffic volumes and limited link bandwidth are becoming growingly… (more)

Subjects/Keywords: Electronic data processing ; Distributed processing ; Resource allocation ; Parallel algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ma, S. C. (2018). On the fairness of network resource allocation for data-parallel applications. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-95780 ; https://doi.org/10.14711/thesis-991012636568803412 ; http://repository.ust.hk/ir/bitstream/1783.1-95780/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):

Ma, Shiyao CSE. “On the fairness of network resource allocation for data-parallel applications.” 2018. Thesis, Hong Kong University of Science and Technology. Accessed March 03, 2021. http://repository.ust.hk/ir/Record/1783.1-95780 ; https://doi.org/10.14711/thesis-991012636568803412 ; http://repository.ust.hk/ir/bitstream/1783.1-95780/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):

Ma, Shiyao CSE. “On the fairness of network resource allocation for data-parallel applications.” 2018. Web. 03 Mar 2021.

Vancouver:

Ma SC. On the fairness of network resource allocation for data-parallel applications. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2018. [cited 2021 Mar 03]. Available from: http://repository.ust.hk/ir/Record/1783.1-95780 ; https://doi.org/10.14711/thesis-991012636568803412 ; http://repository.ust.hk/ir/bitstream/1783.1-95780/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:

Ma SC. On the fairness of network resource allocation for data-parallel applications. [Thesis]. Hong Kong University of Science and Technology; 2018. Available from: http://repository.ust.hk/ir/Record/1783.1-95780 ; https://doi.org/10.14711/thesis-991012636568803412 ; http://repository.ust.hk/ir/bitstream/1783.1-95780/1/th_redirect.html

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


University of Georgia

14. Nisar, Muhammad Usman. A comparison of techniques for graph analytics on Big Data.

Degree: 2014, University of Georgia

 Graphs enjoy profound importance because of their versatility and expressivity. They can be effectively used to represent social networks, search engines and genome sequencing. The… (more)

Subjects/Keywords: pattern matching; simulation; graph partitioning; parallel and distributed algorithms; vertex-centric

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nisar, M. U. (2014). A comparison of techniques for graph analytics on Big Data. (Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/28844

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

Nisar, Muhammad Usman. “A comparison of techniques for graph analytics on Big Data.” 2014. Thesis, University of Georgia. Accessed March 03, 2021. http://hdl.handle.net/10724/28844.

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

MLA Handbook (7th Edition):

Nisar, Muhammad Usman. “A comparison of techniques for graph analytics on Big Data.” 2014. Web. 03 Mar 2021.

Vancouver:

Nisar MU. A comparison of techniques for graph analytics on Big Data. [Internet] [Thesis]. University of Georgia; 2014. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/10724/28844.

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

Council of Science Editors:

Nisar MU. A comparison of techniques for graph analytics on Big Data. [Thesis]. University of Georgia; 2014. Available from: http://hdl.handle.net/10724/28844

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


Purdue University

15. Sreekumaran, Harikrishnan. DECENTRALIZED ALGORITHMS FOR NASH EQUILIBRIUM PROBLEMS – APPLICATIONS TO MULTI-AGENT NETWORK INTERDICTION GAMES AND BEYOND.

Degree: PhD, Industrial Engineering, 2015, Purdue University

 Nash equilibrium problems (NEPs) have gained popularity in recent years in the engineering community due to their ready applicability to a wide variety of practical… (more)

Subjects/Keywords: Distributed optimization; Game theory; Network interdiction; Parallel algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sreekumaran, H. (2015). DECENTRALIZED ALGORITHMS FOR NASH EQUILIBRIUM PROBLEMS – APPLICATIONS TO MULTI-AGENT NETWORK INTERDICTION GAMES AND BEYOND. (Doctoral Dissertation). Purdue University. Retrieved from https://docs.lib.purdue.edu/open_access_dissertations/1432

Chicago Manual of Style (16th Edition):

Sreekumaran, Harikrishnan. “DECENTRALIZED ALGORITHMS FOR NASH EQUILIBRIUM PROBLEMS – APPLICATIONS TO MULTI-AGENT NETWORK INTERDICTION GAMES AND BEYOND.” 2015. Doctoral Dissertation, Purdue University. Accessed March 03, 2021. https://docs.lib.purdue.edu/open_access_dissertations/1432.

MLA Handbook (7th Edition):

Sreekumaran, Harikrishnan. “DECENTRALIZED ALGORITHMS FOR NASH EQUILIBRIUM PROBLEMS – APPLICATIONS TO MULTI-AGENT NETWORK INTERDICTION GAMES AND BEYOND.” 2015. Web. 03 Mar 2021.

Vancouver:

Sreekumaran H. DECENTRALIZED ALGORITHMS FOR NASH EQUILIBRIUM PROBLEMS – APPLICATIONS TO MULTI-AGENT NETWORK INTERDICTION GAMES AND BEYOND. [Internet] [Doctoral dissertation]. Purdue University; 2015. [cited 2021 Mar 03]. Available from: https://docs.lib.purdue.edu/open_access_dissertations/1432.

Council of Science Editors:

Sreekumaran H. DECENTRALIZED ALGORITHMS FOR NASH EQUILIBRIUM PROBLEMS – APPLICATIONS TO MULTI-AGENT NETWORK INTERDICTION GAMES AND BEYOND. [Doctoral Dissertation]. Purdue University; 2015. Available from: https://docs.lib.purdue.edu/open_access_dissertations/1432


Rhodes University

16. Watkins, Rees Collyer. Algorithmic skeletons as a method of parallel programming.

Degree: MS, Faculty of Science, Computer Science, 1993, Rhodes University

 A new style of abstraction for program development, based on the concept of algorithmic skeletons, has been proposed in the literature. The programmer is offered… (more)

Subjects/Keywords: Parallel programming (Computer science); Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Watkins, R. C. (1993). Algorithmic skeletons as a method of parallel programming. (Masters Thesis). Rhodes University. Retrieved from http://hdl.handle.net/10962/d1004889

Chicago Manual of Style (16th Edition):

Watkins, Rees Collyer. “Algorithmic skeletons as a method of parallel programming.” 1993. Masters Thesis, Rhodes University. Accessed March 03, 2021. http://hdl.handle.net/10962/d1004889.

MLA Handbook (7th Edition):

Watkins, Rees Collyer. “Algorithmic skeletons as a method of parallel programming.” 1993. Web. 03 Mar 2021.

Vancouver:

Watkins RC. Algorithmic skeletons as a method of parallel programming. [Internet] [Masters thesis]. Rhodes University; 1993. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/10962/d1004889.

Council of Science Editors:

Watkins RC. Algorithmic skeletons as a method of parallel programming. [Masters Thesis]. Rhodes University; 1993. Available from: http://hdl.handle.net/10962/d1004889


University of Delaware

17. Li, Sha. Boolean satisfiability: parallelization and exploration.

Degree: PhD, University of Delaware, Department of Electrical and Computer Engineering, 2015, University of Delaware

 The Boolean Satisfiability Problem (SAT) is a well-known and core problem in computer science. SAT is the problem of determining whether a propositional Boolean formula… (more)

Subjects/Keywords: Algebra, Boolean.; Parallel programming (Computer science); Algorithms.; Investment analysis  – Data processing.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, S. (2015). Boolean satisfiability: parallelization and exploration. (Doctoral Dissertation). University of Delaware. Retrieved from http://udspace.udel.edu/handle/19716/17577

Chicago Manual of Style (16th Edition):

Li, Sha. “Boolean satisfiability: parallelization and exploration.” 2015. Doctoral Dissertation, University of Delaware. Accessed March 03, 2021. http://udspace.udel.edu/handle/19716/17577.

MLA Handbook (7th Edition):

Li, Sha. “Boolean satisfiability: parallelization and exploration.” 2015. Web. 03 Mar 2021.

Vancouver:

Li S. Boolean satisfiability: parallelization and exploration. [Internet] [Doctoral dissertation]. University of Delaware; 2015. [cited 2021 Mar 03]. Available from: http://udspace.udel.edu/handle/19716/17577.

Council of Science Editors:

Li S. Boolean satisfiability: parallelization and exploration. [Doctoral Dissertation]. University of Delaware; 2015. Available from: http://udspace.udel.edu/handle/19716/17577


ETH Zürich

18. Gerber, Martin. Parallelising molecular dynamics for message passing systems.

Degree: 2000, ETH Zürich

Subjects/Keywords: PARALLELVERARBEITUNG + NEBENLÄUFIGKEIT (BETRIEBSSYSTEME); VERTEILTE ALGORITHMEN + PARALLELE ALGORITHMEN (PROGRAMMIERMETHODEN); PARALLEL PROCESSING + CONCURRENCY (OPERATING SYSTEMS); DISTRIBUTED ALGORITHMS + PARALLEL ALGORITHMS (PROGRAMMING METHODS); info:eu-repo/classification/ddc/004; Data processing, computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gerber, M. (2000). Parallelising molecular dynamics for message passing systems. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/144498

Chicago Manual of Style (16th Edition):

Gerber, Martin. “Parallelising molecular dynamics for message passing systems.” 2000. Doctoral Dissertation, ETH Zürich. Accessed March 03, 2021. http://hdl.handle.net/20.500.11850/144498.

MLA Handbook (7th Edition):

Gerber, Martin. “Parallelising molecular dynamics for message passing systems.” 2000. Web. 03 Mar 2021.

Vancouver:

Gerber M. Parallelising molecular dynamics for message passing systems. [Internet] [Doctoral dissertation]. ETH Zürich; 2000. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/20.500.11850/144498.

Council of Science Editors:

Gerber M. Parallelising molecular dynamics for message passing systems. [Doctoral Dissertation]. ETH Zürich; 2000. Available from: http://hdl.handle.net/20.500.11850/144498


Indiana University

19. Firoz, Jesun Sahariar. Synchronization-avoiding graph algorithms and runtime aspects .

Degree: 2018, Indiana University

 Massively parallel computers provide unprecedented computing power that is only expected to grow. General-purpose Asynchronous Many-Task (AMT) runtimes exposes significant fine-grained parallelism. However, traditional Bulk-Synchronous… (more)

Subjects/Keywords: Distributed Graph Algorithms; Distributed Runtimes; Graph Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Firoz, J. S. (2018). Synchronization-avoiding graph algorithms and runtime aspects . (Thesis). Indiana University. Retrieved from http://hdl.handle.net/2022/22605

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

Firoz, Jesun Sahariar. “Synchronization-avoiding graph algorithms and runtime aspects .” 2018. Thesis, Indiana University. Accessed March 03, 2021. http://hdl.handle.net/2022/22605.

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

MLA Handbook (7th Edition):

Firoz, Jesun Sahariar. “Synchronization-avoiding graph algorithms and runtime aspects .” 2018. Web. 03 Mar 2021.

Vancouver:

Firoz JS. Synchronization-avoiding graph algorithms and runtime aspects . [Internet] [Thesis]. Indiana University; 2018. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/2022/22605.

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

Council of Science Editors:

Firoz JS. Synchronization-avoiding graph algorithms and runtime aspects . [Thesis]. Indiana University; 2018. Available from: http://hdl.handle.net/2022/22605

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

20. 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 March 03, 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. 03 Mar 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 Mar 03]. 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 Texas – Austin

21. -5112-1839. Lightweight offload engines for worklist management and worklist-directed prefetching.

Degree: PhD, Electrical and Computer Engineering, 2018, University of Texas – Austin

 The importance of irregular applications such as graph analytics is rapidly growing with the rise of Big Data. However, parallel graph workloads tend to perform… (more)

Subjects/Keywords: Computer architecture; Graph algorithms; Parallel processors; Parallel programming; Prefetching; Accelerators; Scheduling; Task partitioning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

-5112-1839. (2018). Lightweight offload engines for worklist management and worklist-directed prefetching. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/68554

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16th Edition):

-5112-1839. “Lightweight offload engines for worklist management and worklist-directed prefetching.” 2018. Doctoral Dissertation, University of Texas – Austin. Accessed March 03, 2021. http://hdl.handle.net/2152/68554.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7th Edition):

-5112-1839. “Lightweight offload engines for worklist management and worklist-directed prefetching.” 2018. Web. 03 Mar 2021.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-5112-1839. Lightweight offload engines for worklist management and worklist-directed prefetching. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2018. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/2152/68554.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

-5112-1839. Lightweight offload engines for worklist management and worklist-directed prefetching. [Doctoral Dissertation]. University of Texas – Austin; 2018. Available from: http://hdl.handle.net/2152/68554

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete


University of Illinois – Urbana-Champaign

22. Naqvi, Syed Shalan. Exact Byzantine consensus under local-broadcast channels.

Degree: MS, Computer Science, 2018, University of Illinois – Urbana-Champaign

 We consider the problem of achieving exact consensus with Byzantine faults under a local-broadcast communication channel. We prove necessary and sufficient conditions on the underlying… (more)

Subjects/Keywords: Consensus; Distributed Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Naqvi, S. S. (2018). Exact Byzantine consensus under local-broadcast channels. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/101234

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

Naqvi, Syed Shalan. “Exact Byzantine consensus under local-broadcast channels.” 2018. Thesis, University of Illinois – Urbana-Champaign. Accessed March 03, 2021. http://hdl.handle.net/2142/101234.

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

MLA Handbook (7th Edition):

Naqvi, Syed Shalan. “Exact Byzantine consensus under local-broadcast channels.” 2018. Web. 03 Mar 2021.

Vancouver:

Naqvi SS. Exact Byzantine consensus under local-broadcast channels. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2018. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/2142/101234.

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

Council of Science Editors:

Naqvi SS. Exact Byzantine consensus under local-broadcast channels. [Thesis]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/101234

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


ETH Zürich

23. Schenk, Olaf. Scalable parallel sparse LU factorization methods on shared memory multiprocessors.

Degree: 2000, ETH Zürich

Subjects/Keywords: VERTEILTE ALGORITHMEN + PARALLELE ALGORITHMEN (PROGRAMMIERMETHODEN); PARALLELPROZESSOREN + PARALLELCOMPUTER + PARALLELARCHITEKTUREN (COMPUTERSYSTEME); VERTEILTE SPEICHER (BETRIEBSSYSTEME); DISTRIBUTED ALGORITHMS + PARALLEL ALGORITHMS (PROGRAMMING METHODS); PARALLEL PROCESSORS + PARALLEL COMPUTERS + PARALLEL ARCHITECTURES (COMPUTER SYSTEMS); SHARED MEMORIES + DISTRIBUTED MEMORIES (OPERATING SYSTEMS); info:eu-repo/classification/ddc/004; Data processing, computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schenk, O. (2000). Scalable parallel sparse LU factorization methods on shared memory multiprocessors. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/144477

Chicago Manual of Style (16th Edition):

Schenk, Olaf. “Scalable parallel sparse LU factorization methods on shared memory multiprocessors.” 2000. Doctoral Dissertation, ETH Zürich. Accessed March 03, 2021. http://hdl.handle.net/20.500.11850/144477.

MLA Handbook (7th Edition):

Schenk, Olaf. “Scalable parallel sparse LU factorization methods on shared memory multiprocessors.” 2000. Web. 03 Mar 2021.

Vancouver:

Schenk O. Scalable parallel sparse LU factorization methods on shared memory multiprocessors. [Internet] [Doctoral dissertation]. ETH Zürich; 2000. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/20.500.11850/144477.

Council of Science Editors:

Schenk O. Scalable parallel sparse LU factorization methods on shared memory multiprocessors. [Doctoral Dissertation]. ETH Zürich; 2000. Available from: http://hdl.handle.net/20.500.11850/144477


Brigham Young University

24. Gardner, Matthew J. A Speculative Approach to Parallelization in Particle Swarm Optimization.

Degree: MS, 2011, Brigham Young University

 Particle swarm optimization (PSO) has previously been parallelized primarily by distributing the computation corresponding to particles across multiple processors. In this thesis we present a… (more)

Subjects/Keywords: parallel algorithms; optimization methods; particle swarm optimization; speculative decomposition; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gardner, M. J. (2011). A Speculative Approach to Parallelization in Particle Swarm Optimization. (Masters Thesis). Brigham Young University. Retrieved from https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=4011&context=etd

Chicago Manual of Style (16th Edition):

Gardner, Matthew J. “A Speculative Approach to Parallelization in Particle Swarm Optimization.” 2011. Masters Thesis, Brigham Young University. Accessed March 03, 2021. https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=4011&context=etd.

MLA Handbook (7th Edition):

Gardner, Matthew J. “A Speculative Approach to Parallelization in Particle Swarm Optimization.” 2011. Web. 03 Mar 2021.

Vancouver:

Gardner MJ. A Speculative Approach to Parallelization in Particle Swarm Optimization. [Internet] [Masters thesis]. Brigham Young University; 2011. [cited 2021 Mar 03]. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=4011&context=etd.

Council of Science Editors:

Gardner MJ. A Speculative Approach to Parallelization in Particle Swarm Optimization. [Masters Thesis]. Brigham Young University; 2011. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=4011&context=etd


Texas A&M University

25. Harshvardhan. Algorithm-Level Optimizations for Scalable Parallel Graph Processing.

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

 Efficiently processing large graphs is challenging, since parallel graph algorithms suffer from poor scalability and performance due to many factors, including heavy communication and load-imbalance.… (more)

Subjects/Keywords: Graph Processing; Distributed Systems; Graph Algorithms; High Performance Computing; Parallel Graph Algorithms; Scalable Graph Algorithms; Distributed Graph Processing Systems; Large-scale Graph Processing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Harshvardhan. (2018). Algorithm-Level Optimizations for Scalable Parallel Graph Processing. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/173407

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16th Edition):

Harshvardhan. “Algorithm-Level Optimizations for Scalable Parallel Graph Processing.” 2018. Doctoral Dissertation, Texas A&M University. Accessed March 03, 2021. http://hdl.handle.net/1969.1/173407.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7th Edition):

Harshvardhan. “Algorithm-Level Optimizations for Scalable Parallel Graph Processing.” 2018. Web. 03 Mar 2021.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

Harshvardhan. Algorithm-Level Optimizations for Scalable Parallel Graph Processing. [Internet] [Doctoral dissertation]. Texas A&M University; 2018. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/1969.1/173407.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

Harshvardhan. Algorithm-Level Optimizations for Scalable Parallel Graph Processing. [Doctoral Dissertation]. Texas A&M University; 2018. Available from: http://hdl.handle.net/1969.1/173407

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete


ETH Zürich

26. Lucas, Christoph. Graceful Degradation in Multi-Party Computation.

Degree: 2012, ETH Zürich

Subjects/Keywords: NETWORK PROTOCOLS + COMMUNICATION PROTOCOLS (COMPUTER SYSTEMS); DISTRIBUTED ALGORITHMS + PARALLEL ALGORITHMS (PROGRAMMING METHODS); NETZWERKPROTOKOLLE + KOMMUNIKATIONSPROTOKOLLE (COMPUTERSYSTEME); VERTEILTE ALGORITHMEN + PARALLELE ALGORITHMEN (PROGRAMMIERMETHODEN); PROCESS MANAGEMENT (OPERATING SYSTEMS); PROZESSVERWALTUNG + PROZESSMANAGEMENT (BETRIEBSSYSTEME); info:eu-repo/classification/ddc/004; Data processing, computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lucas, C. (2012). Graceful Degradation in Multi-Party Computation. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/72917

Chicago Manual of Style (16th Edition):

Lucas, Christoph. “Graceful Degradation in Multi-Party Computation.” 2012. Doctoral Dissertation, ETH Zürich. Accessed March 03, 2021. http://hdl.handle.net/20.500.11850/72917.

MLA Handbook (7th Edition):

Lucas, Christoph. “Graceful Degradation in Multi-Party Computation.” 2012. Web. 03 Mar 2021.

Vancouver:

Lucas C. Graceful Degradation in Multi-Party Computation. [Internet] [Doctoral dissertation]. ETH Zürich; 2012. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/20.500.11850/72917.

Council of Science Editors:

Lucas C. Graceful Degradation in Multi-Party Computation. [Doctoral Dissertation]. ETH Zürich; 2012. Available from: http://hdl.handle.net/20.500.11850/72917


University of California – Berkeley

27. Hoemmen, Mark. Communication-avoiding Krylov subspace methods.

Degree: Computer Science, 2010, University of California – Berkeley

 The cost of an algorithm includes both arithmetic and communication.We use "communication" in a general sense to mean data movement,either between levels of a memory… (more)

Subjects/Keywords: Computer Science; Mathematics; communication-avoiding algorithms; iterative methods; linear algebra; numerical methods; parallel algorithms; sparse matrices

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hoemmen, M. (2010). Communication-avoiding Krylov subspace methods. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/7757521k

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

Hoemmen, Mark. “Communication-avoiding Krylov subspace methods.” 2010. Thesis, University of California – Berkeley. Accessed March 03, 2021. http://www.escholarship.org/uc/item/7757521k.

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

MLA Handbook (7th Edition):

Hoemmen, Mark. “Communication-avoiding Krylov subspace methods.” 2010. Web. 03 Mar 2021.

Vancouver:

Hoemmen M. Communication-avoiding Krylov subspace methods. [Internet] [Thesis]. University of California – Berkeley; 2010. [cited 2021 Mar 03]. Available from: http://www.escholarship.org/uc/item/7757521k.

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

Council of Science Editors:

Hoemmen M. Communication-avoiding Krylov subspace methods. [Thesis]. University of California – Berkeley; 2010. Available from: http://www.escholarship.org/uc/item/7757521k

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


Hong Kong University of Science and Technology

28. 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 March 03, 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. 03 Mar 2021.

Vancouver:

Zhao Y. Accelerating betweenness centrality computation on heterogeneous processors. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2014. [cited 2021 Mar 03]. 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


ETH Zürich

29. Zolliker, Urs. A parallel resolution method for logic programs.

Degree: 1993, ETH Zürich

Subjects/Keywords: DEKLARATIVE PROGRAMMIERUNG + LOGISCHE PROGRAMMIERUNG (PROGRAMMIERMETHODEN); LOGISCHE SEMANTIK + SEMANTISCHE ANTINOMIEN (MATHEMATISCHE LOGIK); VERTEILTE PROGRAMMIERUNG + PARALLELE PROGRAMMIERUNG (PROGRAMMIERMETHODEN); HORNKLAUSELN (MATHEMATISCHE LOGIK); UNIFIKATION (MATHEMATISCHE LOGIK); VERTEILTE ALGORITHMEN + PARALLELE ALGORITHMEN (PROGRAMMIERMETHODEN); DECLARATIVE PROGRAMMING + LOGIC PROGRAMMING (PROGRAMMING METHODS); LOGICAL SEMANTICS + SEMANTIC ANTINOMIES (MATHEMATICAL LOGIC); CONCURRENT PROGRAMMING + DISTRIBUTED PROGRAMMING + PARALLEL PROGRAMMING (PROGRAMMING METHODS); HORN CLAUSES (MATHEMATICAL LOGIC); UNIFICATION (MATHEMATICAL LOGIC); DISTRIBUTED ALGORITHMS + PARALLEL ALGORITHMS (PROGRAMMING METHODS); info:eu-repo/classification/ddc/004; info:eu-repo/classification/ddc/510; Data processing, computer science; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zolliker, U. (1993). A parallel resolution method for logic programs. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/141077

Chicago Manual of Style (16th Edition):

Zolliker, Urs. “A parallel resolution method for logic programs.” 1993. Doctoral Dissertation, ETH Zürich. Accessed March 03, 2021. http://hdl.handle.net/20.500.11850/141077.

MLA Handbook (7th Edition):

Zolliker, Urs. “A parallel resolution method for logic programs.” 1993. Web. 03 Mar 2021.

Vancouver:

Zolliker U. A parallel resolution method for logic programs. [Internet] [Doctoral dissertation]. ETH Zürich; 1993. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/20.500.11850/141077.

Council of Science Editors:

Zolliker U. A parallel resolution method for logic programs. [Doctoral Dissertation]. ETH Zürich; 1993. Available from: http://hdl.handle.net/20.500.11850/141077


ETH Zürich

30. Pohl, Bartholomäus Johannes. Ein Algorithmus zur Lösung von Anfangswertproblemen auf Parallelrechnern.

Degree: 1992, ETH Zürich

Subjects/Keywords: PARALLELPROZESSOREN + PARALLELCOMPUTER + PARALLELARCHITEKTUREN (COMPUTERSYSTEME); VERTEILTE ALGORITHMEN + PARALLELE ALGORITHMEN (PROGRAMMIERMETHODEN); ANFANGSWERTPROBLEME (GEWÖHNLICHE DIFFERENTIALGLEICHUNGEN); PARALLEL PROCESSORS + PARALLEL COMPUTERS + PARALLEL ARCHITECTURES (COMPUTER SYSTEMS); DISTRIBUTED ALGORITHMS + PARALLEL ALGORITHMS (PROGRAMMING METHODS); INITIAL VALUE PROBLEMS (ORDINARY DIFFERENTIAL EQUATIONS); info:eu-repo/classification/ddc/004; info:eu-repo/classification/ddc/004; Data processing, computer science; Data processing, computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pohl, B. J. (1992). Ein Algorithmus zur Lösung von Anfangswertproblemen auf Parallelrechnern. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/140686

Chicago Manual of Style (16th Edition):

Pohl, Bartholomäus Johannes. “Ein Algorithmus zur Lösung von Anfangswertproblemen auf Parallelrechnern.” 1992. Doctoral Dissertation, ETH Zürich. Accessed March 03, 2021. http://hdl.handle.net/20.500.11850/140686.

MLA Handbook (7th Edition):

Pohl, Bartholomäus Johannes. “Ein Algorithmus zur Lösung von Anfangswertproblemen auf Parallelrechnern.” 1992. Web. 03 Mar 2021.

Vancouver:

Pohl BJ. Ein Algorithmus zur Lösung von Anfangswertproblemen auf Parallelrechnern. [Internet] [Doctoral dissertation]. ETH Zürich; 1992. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/20.500.11850/140686.

Council of Science Editors:

Pohl BJ. Ein Algorithmus zur Lösung von Anfangswertproblemen auf Parallelrechnern. [Doctoral Dissertation]. ETH Zürich; 1992. Available from: http://hdl.handle.net/20.500.11850/140686

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

.