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 programming Computer science ). Showing records 1 – 30 of 184093 total matches.

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters

1. Liu, Zhiyu. Theory and Applications of Parallelism with Futures.

Degree: Department of Computer Science, 2017, Brown University

 Futures are an attractive way to structure parallel computations. When a thread creates an expression with a keyword future, a new thread is spawned to… (more)

Subjects/Keywords: Parallel programming (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, Z. (2017). Theory and Applications of Parallelism with Futures. (Thesis). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:733422/

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

Liu, Zhiyu. “Theory and Applications of Parallelism with Futures.” 2017. Thesis, Brown University. Accessed August 10, 2020. https://repository.library.brown.edu/studio/item/bdr:733422/.

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

MLA Handbook (7th Edition):

Liu, Zhiyu. “Theory and Applications of Parallelism with Futures.” 2017. Web. 10 Aug 2020.

Vancouver:

Liu Z. Theory and Applications of Parallelism with Futures. [Internet] [Thesis]. Brown University; 2017. [cited 2020 Aug 10]. Available from: https://repository.library.brown.edu/studio/item/bdr:733422/.

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

Council of Science Editors:

Liu Z. Theory and Applications of Parallelism with Futures. [Thesis]. Brown University; 2017. Available from: https://repository.library.brown.edu/studio/item/bdr:733422/

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


University of Victoria

2. Du, Weichang. Indexical parallel programming.

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

 Indexical programming means programming languages and/or computational models based on indexical logic and possible world semantics. Indexical languages can be considered as the result of… (more)

Subjects/Keywords: Parallel programming (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Du, W. (2018). Indexical parallel programming. (Thesis). University of Victoria. Retrieved from https://dspace.library.uvic.ca//handle/1828/9516

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

Du, Weichang. “Indexical parallel programming.” 2018. Thesis, University of Victoria. Accessed August 10, 2020. https://dspace.library.uvic.ca//handle/1828/9516.

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

MLA Handbook (7th Edition):

Du, Weichang. “Indexical parallel programming.” 2018. Web. 10 Aug 2020.

Vancouver:

Du W. Indexical parallel programming. [Internet] [Thesis]. University of Victoria; 2018. [cited 2020 Aug 10]. Available from: https://dspace.library.uvic.ca//handle/1828/9516.

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

Council of Science Editors:

Du W. Indexical parallel programming. [Thesis]. University of Victoria; 2018. Available from: https://dspace.library.uvic.ca//handle/1828/9516

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


University of Utah

3. Rague, Brian William. CS1 pedagogical approach to parallel thinking.

Degree: PhD, Computing (School of);, 2010, University of Utah

 Almost all collegiate programs in College of Engineering; (School of); offer an introductory course in programming primarily devoted to communicating the foundational principles of software… (more)

Subjects/Keywords: Computer; CS1; Education; Parallel; Programming; Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rague, B. W. (2010). CS1 pedagogical approach to parallel thinking. (Doctoral Dissertation). University of Utah. Retrieved from http://content.lib.utah.edu/cdm/singleitem/collection/etd2/id/875/rec/275

Chicago Manual of Style (16th Edition):

Rague, Brian William. “CS1 pedagogical approach to parallel thinking.” 2010. Doctoral Dissertation, University of Utah. Accessed August 10, 2020. http://content.lib.utah.edu/cdm/singleitem/collection/etd2/id/875/rec/275.

MLA Handbook (7th Edition):

Rague, Brian William. “CS1 pedagogical approach to parallel thinking.” 2010. Web. 10 Aug 2020.

Vancouver:

Rague BW. CS1 pedagogical approach to parallel thinking. [Internet] [Doctoral dissertation]. University of Utah; 2010. [cited 2020 Aug 10]. Available from: http://content.lib.utah.edu/cdm/singleitem/collection/etd2/id/875/rec/275.

Council of Science Editors:

Rague BW. CS1 pedagogical approach to parallel thinking. [Doctoral Dissertation]. University of Utah; 2010. Available from: http://content.lib.utah.edu/cdm/singleitem/collection/etd2/id/875/rec/275


Columbia University

4. Meng, Xiang. Emerging Nanophotonic Applications Explored with Advanced Scientific Parallel Computing.

Degree: 2017, Columbia University

 The domain of nanoscale optical science and technology is a combination of the classical world of electromagnetics and the quantum mechanical regime of atoms and… (more)

Subjects/Keywords: Electrical engineering; Nanophotonics; Parallel programming (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Meng, X. (2017). Emerging Nanophotonic Applications Explored with Advanced Scientific Parallel Computing. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D8GH9WFJ

Chicago Manual of Style (16th Edition):

Meng, Xiang. “Emerging Nanophotonic Applications Explored with Advanced Scientific Parallel Computing.” 2017. Doctoral Dissertation, Columbia University. Accessed August 10, 2020. https://doi.org/10.7916/D8GH9WFJ.

MLA Handbook (7th Edition):

Meng, Xiang. “Emerging Nanophotonic Applications Explored with Advanced Scientific Parallel Computing.” 2017. Web. 10 Aug 2020.

Vancouver:

Meng X. Emerging Nanophotonic Applications Explored with Advanced Scientific Parallel Computing. [Internet] [Doctoral dissertation]. Columbia University; 2017. [cited 2020 Aug 10]. Available from: https://doi.org/10.7916/D8GH9WFJ.

Council of Science Editors:

Meng X. Emerging Nanophotonic Applications Explored with Advanced Scientific Parallel Computing. [Doctoral Dissertation]. Columbia University; 2017. Available from: https://doi.org/10.7916/D8GH9WFJ


University of Houston

5. Ghosh, Priyanka 1984-. Support for Dependency Driven Executions among OpenMP Tasks.

Degree: MS, Computer Science, 2012, University of Houston

 In order to improve its expressivity with respect to unstructured parallelism, OpenMP 3.0 introduced the concept of tasks, independent units of work that may be… (more)

Subjects/Keywords: OpenMP; Tasks; Parallel programming; Computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ghosh, P. 1. (2012). Support for Dependency Driven Executions among OpenMP Tasks. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/558

Chicago Manual of Style (16th Edition):

Ghosh, Priyanka 1984-. “Support for Dependency Driven Executions among OpenMP Tasks.” 2012. Masters Thesis, University of Houston. Accessed August 10, 2020. http://hdl.handle.net/10657/558.

MLA Handbook (7th Edition):

Ghosh, Priyanka 1984-. “Support for Dependency Driven Executions among OpenMP Tasks.” 2012. Web. 10 Aug 2020.

Vancouver:

Ghosh P1. Support for Dependency Driven Executions among OpenMP Tasks. [Internet] [Masters thesis]. University of Houston; 2012. [cited 2020 Aug 10]. Available from: http://hdl.handle.net/10657/558.

Council of Science Editors:

Ghosh P1. Support for Dependency Driven Executions among OpenMP Tasks. [Masters Thesis]. University of Houston; 2012. Available from: http://hdl.handle.net/10657/558


University of Missouri – Columbia

6. Butler, Michael (Michael Christian). Design of runtime libraries to improve programmability and efficiency of heterogeneous CPU-GPU nodes.

Degree: 2016, University of Missouri – Columbia

 [ACCESS RESTRICTED TO THE UNIVERSITY OF MISSOURI AT AUTHOR'S REQUEST.] As computers began to reach their limit on how fast a single processor could execute… (more)

Subjects/Keywords: Graphics processing units; Functional programming (Computer science); Parallel programming (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Butler, M. (. C. (2016). Design of runtime libraries to improve programmability and efficiency of heterogeneous CPU-GPU nodes. (Thesis). University of Missouri – Columbia. Retrieved from http://hdl.handle.net/10355/57620

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

Butler, Michael (Michael Christian). “Design of runtime libraries to improve programmability and efficiency of heterogeneous CPU-GPU nodes.” 2016. Thesis, University of Missouri – Columbia. Accessed August 10, 2020. http://hdl.handle.net/10355/57620.

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

MLA Handbook (7th Edition):

Butler, Michael (Michael Christian). “Design of runtime libraries to improve programmability and efficiency of heterogeneous CPU-GPU nodes.” 2016. Web. 10 Aug 2020.

Vancouver:

Butler M(C. Design of runtime libraries to improve programmability and efficiency of heterogeneous CPU-GPU nodes. [Internet] [Thesis]. University of Missouri – Columbia; 2016. [cited 2020 Aug 10]. Available from: http://hdl.handle.net/10355/57620.

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

Council of Science Editors:

Butler M(C. Design of runtime libraries to improve programmability and efficiency of heterogeneous CPU-GPU nodes. [Thesis]. University of Missouri – Columbia; 2016. Available from: http://hdl.handle.net/10355/57620

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


University of Missouri – Columbia

7. Butler, Michael (Michael Christian). Design of runtime libraries to improve programmability and efficiency of heterogeneous CPU-GPU nodes.

Degree: 2016, University of Missouri – Columbia

 [ACCESS RESTRICTED TO THE UNIVERSITY OF MISSOURI AT REQUEST OF AUTHOR.] As computers began to reach their limit on how fast a single processor could… (more)

Subjects/Keywords: Graphics processing units; Functional programming (Computer science); Parallel programming (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Butler, M. (. C. (2016). Design of runtime libraries to improve programmability and efficiency of heterogeneous CPU-GPU nodes. (Thesis). University of Missouri – Columbia. Retrieved from https://doi.org/10.32469/10355/57620

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

Butler, Michael (Michael Christian). “Design of runtime libraries to improve programmability and efficiency of heterogeneous CPU-GPU nodes.” 2016. Thesis, University of Missouri – Columbia. Accessed August 10, 2020. https://doi.org/10.32469/10355/57620.

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

MLA Handbook (7th Edition):

Butler, Michael (Michael Christian). “Design of runtime libraries to improve programmability and efficiency of heterogeneous CPU-GPU nodes.” 2016. Web. 10 Aug 2020.

Vancouver:

Butler M(C. Design of runtime libraries to improve programmability and efficiency of heterogeneous CPU-GPU nodes. [Internet] [Thesis]. University of Missouri – Columbia; 2016. [cited 2020 Aug 10]. Available from: https://doi.org/10.32469/10355/57620.

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

Council of Science Editors:

Butler M(C. Design of runtime libraries to improve programmability and efficiency of heterogeneous CPU-GPU nodes. [Thesis]. University of Missouri – Columbia; 2016. Available from: https://doi.org/10.32469/10355/57620

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


University of Lund

8. Rolf, Carl Christian. Parallelism in Constraint Programming.

Degree: 2011, University of Lund

 Writing efficient parallel programs is the biggest challenge of the software industry for the foreseeable future. We are currently in a time when parallel computers… (more)

Subjects/Keywords: Computer Science; Parallelism; Constraint Programming; Parallel Consistency; Parallel Search; Distributed Constraint Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rolf, C. C. (2011). Parallelism in Constraint Programming. (Doctoral Dissertation). University of Lund. Retrieved from https://lup.lub.lu.se/record/2152966 ; https://portal.research.lu.se/ws/files/6028139/2152972.pdf

Chicago Manual of Style (16th Edition):

Rolf, Carl Christian. “Parallelism in Constraint Programming.” 2011. Doctoral Dissertation, University of Lund. Accessed August 10, 2020. https://lup.lub.lu.se/record/2152966 ; https://portal.research.lu.se/ws/files/6028139/2152972.pdf.

MLA Handbook (7th Edition):

Rolf, Carl Christian. “Parallelism in Constraint Programming.” 2011. Web. 10 Aug 2020.

Vancouver:

Rolf CC. Parallelism in Constraint Programming. [Internet] [Doctoral dissertation]. University of Lund; 2011. [cited 2020 Aug 10]. Available from: https://lup.lub.lu.se/record/2152966 ; https://portal.research.lu.se/ws/files/6028139/2152972.pdf.

Council of Science Editors:

Rolf CC. Parallelism in Constraint Programming. [Doctoral Dissertation]. University of Lund; 2011. Available from: https://lup.lub.lu.se/record/2152966 ; https://portal.research.lu.se/ws/files/6028139/2152972.pdf


Texas State University – San Marcos

9. Hesaaraki, Farbod. Unobtrusive Real-Time Tracing of Parallel Programs.

Degree: MS, Computer Science, 2015, Texas State University – San Marcos

 The US loses approximately 20 to 60 billion a year due to software bugs and glitches, many of which could be avoided if software developers… (more)

Subjects/Keywords: Compression; Tracing; Parallel; Program; Unobtrusive; Real-time; Debugging in computer science; Parallel programming (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hesaaraki, F. (2015). Unobtrusive Real-Time Tracing of Parallel Programs. (Masters Thesis). Texas State University – San Marcos. Retrieved from https://digital.library.txstate.edu/handle/10877/5550

Chicago Manual of Style (16th Edition):

Hesaaraki, Farbod. “Unobtrusive Real-Time Tracing of Parallel Programs.” 2015. Masters Thesis, Texas State University – San Marcos. Accessed August 10, 2020. https://digital.library.txstate.edu/handle/10877/5550.

MLA Handbook (7th Edition):

Hesaaraki, Farbod. “Unobtrusive Real-Time Tracing of Parallel Programs.” 2015. Web. 10 Aug 2020.

Vancouver:

Hesaaraki F. Unobtrusive Real-Time Tracing of Parallel Programs. [Internet] [Masters thesis]. Texas State University – San Marcos; 2015. [cited 2020 Aug 10]. Available from: https://digital.library.txstate.edu/handle/10877/5550.

Council of Science Editors:

Hesaaraki F. Unobtrusive Real-Time Tracing of Parallel Programs. [Masters Thesis]. Texas State University – San Marcos; 2015. Available from: https://digital.library.txstate.edu/handle/10877/5550


Columbia University

10. Kambadur, Melanie Rae. Finding, Measuring, and Reducing Inefficiencies in Contemporary Computer Systems.

Degree: 2016, Columbia University

Computer systems have become increasingly diverse and specialized in recent years. This complexity supports a wide range of new computing uses and users, but is… (more)

Subjects/Keywords: Parallel programming (Computer science); Computer science; Computers; Operating systems (Computers)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kambadur, M. R. (2016). Finding, Measuring, and Reducing Inefficiencies in Contemporary Computer Systems. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D8KW5FVR

Chicago Manual of Style (16th Edition):

Kambadur, Melanie Rae. “Finding, Measuring, and Reducing Inefficiencies in Contemporary Computer Systems.” 2016. Doctoral Dissertation, Columbia University. Accessed August 10, 2020. https://doi.org/10.7916/D8KW5FVR.

MLA Handbook (7th Edition):

Kambadur, Melanie Rae. “Finding, Measuring, and Reducing Inefficiencies in Contemporary Computer Systems.” 2016. Web. 10 Aug 2020.

Vancouver:

Kambadur MR. Finding, Measuring, and Reducing Inefficiencies in Contemporary Computer Systems. [Internet] [Doctoral dissertation]. Columbia University; 2016. [cited 2020 Aug 10]. Available from: https://doi.org/10.7916/D8KW5FVR.

Council of Science Editors:

Kambadur MR. Finding, Measuring, and Reducing Inefficiencies in Contemporary Computer Systems. [Doctoral Dissertation]. Columbia University; 2016. Available from: https://doi.org/10.7916/D8KW5FVR


Portland State University

11. Howard, Philip William. Extending Relativistic Programming to Multiple Writers.

Degree: PhD, Computer Science, 2012, Portland State University

  For software to take advantage of modern multicore processors, it must be safely concurrent and it must scale. Many techniques that allow safe concurrency… (more)

Subjects/Keywords: Concurrency; Relativistic programming; Data structures; Synchronization; Multicore; Multiprocessors  – Programming; Systems programming (Computer science); Parallel programming (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Howard, P. W. (2012). Extending Relativistic Programming to Multiple Writers. (Doctoral Dissertation). Portland State University. Retrieved from https://pdxscholar.library.pdx.edu/open_access_etds/114

Chicago Manual of Style (16th Edition):

Howard, Philip William. “Extending Relativistic Programming to Multiple Writers.” 2012. Doctoral Dissertation, Portland State University. Accessed August 10, 2020. https://pdxscholar.library.pdx.edu/open_access_etds/114.

MLA Handbook (7th Edition):

Howard, Philip William. “Extending Relativistic Programming to Multiple Writers.” 2012. Web. 10 Aug 2020.

Vancouver:

Howard PW. Extending Relativistic Programming to Multiple Writers. [Internet] [Doctoral dissertation]. Portland State University; 2012. [cited 2020 Aug 10]. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/114.

Council of Science Editors:

Howard PW. Extending Relativistic Programming to Multiple Writers. [Doctoral Dissertation]. Portland State University; 2012. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/114


University of California – Berkeley

12. Catanzaro, Bryan Christopher. Compilation Techniques for Embedded Data Parallel Languages.

Degree: Electrical Engineering & Computer Sciences, 2011, University of California – Berkeley

 Contemporary parallel microprocessors exploit Chip Multiprocessing along with Single Instruction, Multiple Data parallelism to deliver high performance on applications that expose substantial fine-grained data parallelism.… (more)

Subjects/Keywords: Computer science; Computer engineering; Data Parallelism; Parallel Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Catanzaro, B. C. (2011). Compilation Techniques for Embedded Data Parallel Languages. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/6c02679n

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

Catanzaro, Bryan Christopher. “Compilation Techniques for Embedded Data Parallel Languages.” 2011. Thesis, University of California – Berkeley. Accessed August 10, 2020. http://www.escholarship.org/uc/item/6c02679n.

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

MLA Handbook (7th Edition):

Catanzaro, Bryan Christopher. “Compilation Techniques for Embedded Data Parallel Languages.” 2011. Web. 10 Aug 2020.

Vancouver:

Catanzaro BC. Compilation Techniques for Embedded Data Parallel Languages. [Internet] [Thesis]. University of California – Berkeley; 2011. [cited 2020 Aug 10]. Available from: http://www.escholarship.org/uc/item/6c02679n.

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

Council of Science Editors:

Catanzaro BC. Compilation Techniques for Embedded Data Parallel Languages. [Thesis]. University of California – Berkeley; 2011. Available from: http://www.escholarship.org/uc/item/6c02679n

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


Rhodes University

13. Handler, Caroline. Parallel process placement.

Degree: Faculty of Science, Computer Science, 1989, Rhodes University

 This thesis investigates methods of automatic allocation of processes to available processors in a given network configuration. The research described covers the investigation of various… (more)

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Handler, C. (1989). Parallel process placement. (Thesis). Rhodes University. Retrieved from http://hdl.handle.net/10962/d1002033

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

Handler, Caroline. “Parallel process placement.” 1989. Thesis, Rhodes University. Accessed August 10, 2020. http://hdl.handle.net/10962/d1002033.

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

MLA Handbook (7th Edition):

Handler, Caroline. “Parallel process placement.” 1989. Web. 10 Aug 2020.

Vancouver:

Handler C. Parallel process placement. [Internet] [Thesis]. Rhodes University; 1989. [cited 2020 Aug 10]. Available from: http://hdl.handle.net/10962/d1002033.

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

Council of Science Editors:

Handler C. Parallel process placement. [Thesis]. Rhodes University; 1989. Available from: http://hdl.handle.net/10962/d1002033

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


Texas Tech University

14. Sundararajan, Sriram. A SequenceL interpreter using tuplespaces.

Degree: Computer Science, 2003, Texas Tech University

 SequenceL is an implicitly parallelizing language that determines all the parallelisms in a computer program. This thesis is a preliminary investigation into a Tuple space… (more)

Subjects/Keywords: Parallel programming (Computer science)  – Research; Parallel programming (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sundararajan, S. (2003). A SequenceL interpreter using tuplespaces. (Thesis). Texas Tech University. Retrieved from http://hdl.handle.net/2346/17176

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

Sundararajan, Sriram. “A SequenceL interpreter using tuplespaces.” 2003. Thesis, Texas Tech University. Accessed August 10, 2020. http://hdl.handle.net/2346/17176.

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

MLA Handbook (7th Edition):

Sundararajan, Sriram. “A SequenceL interpreter using tuplespaces.” 2003. Web. 10 Aug 2020.

Vancouver:

Sundararajan S. A SequenceL interpreter using tuplespaces. [Internet] [Thesis]. Texas Tech University; 2003. [cited 2020 Aug 10]. Available from: http://hdl.handle.net/2346/17176.

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

Council of Science Editors:

Sundararajan S. A SequenceL interpreter using tuplespaces. [Thesis]. Texas Tech University; 2003. Available from: http://hdl.handle.net/2346/17176

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


Northeastern University

15. Sun, Enqiang. Cross-platform heterogeneous runtime environment.

Degree: PhD, Department of Electrical and Computer Engineering, 2016, Northeastern University

 Heterogeneous platforms are becoming widely adopted thanks for the support from new languages and programming models. Among these languages/models, OpenCL is an industry standard for… (more)

Subjects/Keywords: parallel computing; runtime; Heterogeneous computing; Parallel programming (Computer science); Parallel processing (Electronic computers); Parallel computers; Electronic data processing; Distributed processing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sun, E. (2016). Cross-platform heterogeneous runtime environment. (Doctoral Dissertation). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20213163

Chicago Manual of Style (16th Edition):

Sun, Enqiang. “Cross-platform heterogeneous runtime environment.” 2016. Doctoral Dissertation, Northeastern University. Accessed August 10, 2020. http://hdl.handle.net/2047/D20213163.

MLA Handbook (7th Edition):

Sun, Enqiang. “Cross-platform heterogeneous runtime environment.” 2016. Web. 10 Aug 2020.

Vancouver:

Sun E. Cross-platform heterogeneous runtime environment. [Internet] [Doctoral dissertation]. Northeastern University; 2016. [cited 2020 Aug 10]. Available from: http://hdl.handle.net/2047/D20213163.

Council of Science Editors:

Sun E. Cross-platform heterogeneous runtime environment. [Doctoral Dissertation]. Northeastern University; 2016. Available from: http://hdl.handle.net/2047/D20213163


Universidade Federal de Mato Grosso do Sul

16. 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 August 10, 2020. 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. 10 Aug 2020.

Vancouver:

Silva PHNd. Algoritmos paralelos para o alinhamento de sequências genômicas . [Internet] [Thesis]. Universidade Federal de Mato Grosso do Sul; 2014. [cited 2020 Aug 10]. 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

17. Pitkin, Thomas A. GPU ray tracing with CUDA.

Degree: MS, Computer Science, 2013, Eastern Washington University

  "Ray Tracing is a rendering method that generates high quality images by simulating how light rays interact with objects in a virtual scene. The… (more)

Subjects/Keywords: Parallel programming (Computer science); Parallel processing (Electronic computers); Rendering (Computer graphics); Ray tracing algorithms; CUDA (Computer architecture); Computer graphics; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pitkin, T. A. (2013). GPU ray tracing with CUDA. (Thesis). Eastern Washington University. Retrieved from https://dc.ewu.edu/theses/94

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

Pitkin, Thomas A. “GPU ray tracing with CUDA.” 2013. Thesis, Eastern Washington University. Accessed August 10, 2020. https://dc.ewu.edu/theses/94.

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

MLA Handbook (7th Edition):

Pitkin, Thomas A. “GPU ray tracing with CUDA.” 2013. Web. 10 Aug 2020.

Vancouver:

Pitkin TA. GPU ray tracing with CUDA. [Internet] [Thesis]. Eastern Washington University; 2013. [cited 2020 Aug 10]. Available from: https://dc.ewu.edu/theses/94.

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

Council of Science Editors:

Pitkin TA. GPU ray tracing with CUDA. [Thesis]. Eastern Washington University; 2013. Available from: https://dc.ewu.edu/theses/94

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


Rhodes University

18. Tristram, Waide Barrington. Investigating tools and techniques for improving software performance on multiprocessor computer systems.

Degree: Faculty of Science, Computer Science, 2012, Rhodes University

The availability of modern commodity multicore processors and multiprocessor computer systems has resulted in the widespread adoption of parallel computers in a variety of environments,… (more)

Subjects/Keywords: Multiprocessors; Multiprogramming (Electronic computers); Parallel programming (Computer science); Linux; Abstract data types (Computer science); Threads (Computer programs); Computer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tristram, W. B. (2012). Investigating tools and techniques for improving software performance on multiprocessor computer systems. (Thesis). Rhodes University. Retrieved from http://hdl.handle.net/10962/d1006651

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

Tristram, Waide Barrington. “Investigating tools and techniques for improving software performance on multiprocessor computer systems.” 2012. Thesis, Rhodes University. Accessed August 10, 2020. http://hdl.handle.net/10962/d1006651.

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

MLA Handbook (7th Edition):

Tristram, Waide Barrington. “Investigating tools and techniques for improving software performance on multiprocessor computer systems.” 2012. Web. 10 Aug 2020.

Vancouver:

Tristram WB. Investigating tools and techniques for improving software performance on multiprocessor computer systems. [Internet] [Thesis]. Rhodes University; 2012. [cited 2020 Aug 10]. Available from: http://hdl.handle.net/10962/d1006651.

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

Council of Science Editors:

Tristram WB. Investigating tools and techniques for improving software performance on multiprocessor computer systems. [Thesis]. Rhodes University; 2012. Available from: http://hdl.handle.net/10962/d1006651

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


University of California – Berkeley

19. Park, Chang Seo. Active Testing: Predicting and Confirming Concurrency Bugs for Concurrent and Distributed Memory Parallel Systems.

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

Parallel and concurrent software sometimes exhibit incorrect behavior because ofunintended interference between different threads of execution. Common classesof concurrency bugs include data races, deadlocks, and… (more)

Subjects/Keywords: Computer science; Concurrency bug finding; Parallel programming; Testing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Park, C. S. (2012). Active Testing: Predicting and Confirming Concurrency Bugs for Concurrent and Distributed Memory Parallel Systems. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/7n4120mp

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

Park, Chang Seo. “Active Testing: Predicting and Confirming Concurrency Bugs for Concurrent and Distributed Memory Parallel Systems.” 2012. Thesis, University of California – Berkeley. Accessed August 10, 2020. http://www.escholarship.org/uc/item/7n4120mp.

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

MLA Handbook (7th Edition):

Park, Chang Seo. “Active Testing: Predicting and Confirming Concurrency Bugs for Concurrent and Distributed Memory Parallel Systems.” 2012. Web. 10 Aug 2020.

Vancouver:

Park CS. Active Testing: Predicting and Confirming Concurrency Bugs for Concurrent and Distributed Memory Parallel Systems. [Internet] [Thesis]. University of California – Berkeley; 2012. [cited 2020 Aug 10]. Available from: http://www.escholarship.org/uc/item/7n4120mp.

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

Council of Science Editors:

Park CS. Active Testing: Predicting and Confirming Concurrency Bugs for Concurrent and Distributed Memory Parallel Systems. [Thesis]. University of California – Berkeley; 2012. Available from: http://www.escholarship.org/uc/item/7n4120mp

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


University of Alberta

20. Anvik, John Karsten. Asserting the utility of CO₂P₃S using the Cowichan problems.

Degree: MS, Department of Computing Science, 2002, University of Alberta

Subjects/Keywords: Parallel programming (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Anvik, J. K. (2002). Asserting the utility of CO₂P₃S using the Cowichan problems. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/wd375z38k

Chicago Manual of Style (16th Edition):

Anvik, John Karsten. “Asserting the utility of CO₂P₃S using the Cowichan problems.” 2002. Masters Thesis, University of Alberta. Accessed August 10, 2020. https://era.library.ualberta.ca/files/wd375z38k.

MLA Handbook (7th Edition):

Anvik, John Karsten. “Asserting the utility of CO₂P₃S using the Cowichan problems.” 2002. Web. 10 Aug 2020.

Vancouver:

Anvik JK. Asserting the utility of CO₂P₃S using the Cowichan problems. [Internet] [Masters thesis]. University of Alberta; 2002. [cited 2020 Aug 10]. Available from: https://era.library.ualberta.ca/files/wd375z38k.

Council of Science Editors:

Anvik JK. Asserting the utility of CO₂P₃S using the Cowichan problems. [Masters Thesis]. University of Alberta; 2002. Available from: https://era.library.ualberta.ca/files/wd375z38k


Oregon State University

21. Koff, Caroline Nan. A specialized ATMS for equivalence relations.

Degree: MS, Computer Science, 1988, Oregon State University

 A specialized ATMS for efficiently computing equivalence relations in multiple contexts is introduced. This specialized ATMS overcomes the problems with existing solutions to reasoning with… (more)

Subjects/Keywords: Parallel programming (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Koff, C. N. (1988). A specialized ATMS for equivalence relations. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/40395

Chicago Manual of Style (16th Edition):

Koff, Caroline Nan. “A specialized ATMS for equivalence relations.” 1988. Masters Thesis, Oregon State University. Accessed August 10, 2020. http://hdl.handle.net/1957/40395.

MLA Handbook (7th Edition):

Koff, Caroline Nan. “A specialized ATMS for equivalence relations.” 1988. Web. 10 Aug 2020.

Vancouver:

Koff CN. A specialized ATMS for equivalence relations. [Internet] [Masters thesis]. Oregon State University; 1988. [cited 2020 Aug 10]. Available from: http://hdl.handle.net/1957/40395.

Council of Science Editors:

Koff CN. A specialized ATMS for equivalence relations. [Masters Thesis]. Oregon State University; 1988. Available from: http://hdl.handle.net/1957/40395


Oregon State University

22. Yadav, Anil Kumar. Performance monitoring of parallel applications at large grain level.

Degree: MS, Electrical and Computer Engineering, 1989, Oregon State University

 This thesis is an attempt to create a methodology to analyze the performance of parallel applications on a wide variety of platforms and programming environments.… (more)

Subjects/Keywords: Parallel programming (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yadav, A. K. (1989). Performance monitoring of parallel applications at large grain level. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/38780

Chicago Manual of Style (16th Edition):

Yadav, Anil Kumar. “Performance monitoring of parallel applications at large grain level.” 1989. Masters Thesis, Oregon State University. Accessed August 10, 2020. http://hdl.handle.net/1957/38780.

MLA Handbook (7th Edition):

Yadav, Anil Kumar. “Performance monitoring of parallel applications at large grain level.” 1989. Web. 10 Aug 2020.

Vancouver:

Yadav AK. Performance monitoring of parallel applications at large grain level. [Internet] [Masters thesis]. Oregon State University; 1989. [cited 2020 Aug 10]. Available from: http://hdl.handle.net/1957/38780.

Council of Science Editors:

Yadav AK. Performance monitoring of parallel applications at large grain level. [Masters Thesis]. Oregon State University; 1989. Available from: http://hdl.handle.net/1957/38780


University of Tasmania

23. Lian, Benjamin Yin Hon. Design of a strongly typed parallel programming language based on CSP.

Degree: 1989, University of Tasmania

 Hoare's CSP espouses a very simple programming model, that of combining sequential processes in parallel so that they cooperate in the execution of a task,… (more)

Subjects/Keywords: Parallel programming (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lian, B. Y. H. (1989). Design of a strongly typed parallel programming language based on CSP. (Thesis). University of Tasmania. Retrieved from https://eprints.utas.edu.au/20169/1/whole_LianBenjaminYinHon1991_thesis.pdf

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

Lian, Benjamin Yin Hon. “Design of a strongly typed parallel programming language based on CSP.” 1989. Thesis, University of Tasmania. Accessed August 10, 2020. https://eprints.utas.edu.au/20169/1/whole_LianBenjaminYinHon1991_thesis.pdf.

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

MLA Handbook (7th Edition):

Lian, Benjamin Yin Hon. “Design of a strongly typed parallel programming language based on CSP.” 1989. Web. 10 Aug 2020.

Vancouver:

Lian BYH. Design of a strongly typed parallel programming language based on CSP. [Internet] [Thesis]. University of Tasmania; 1989. [cited 2020 Aug 10]. Available from: https://eprints.utas.edu.au/20169/1/whole_LianBenjaminYinHon1991_thesis.pdf.

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

Council of Science Editors:

Lian BYH. Design of a strongly typed parallel programming language based on CSP. [Thesis]. University of Tasmania; 1989. Available from: https://eprints.utas.edu.au/20169/1/whole_LianBenjaminYinHon1991_thesis.pdf

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


Rhodes University

24. 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 August 10, 2020. http://hdl.handle.net/10962/d1004889.

MLA Handbook (7th Edition):

Watkins, Rees Collyer. “Algorithmic skeletons as a method of parallel programming.” 1993. Web. 10 Aug 2020.

Vancouver:

Watkins RC. Algorithmic skeletons as a method of parallel programming. [Internet] [Masters thesis]. Rhodes University; 1993. [cited 2020 Aug 10]. 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


The Ohio State University

25. Dinan, James S. Scalable Task Parallel Programming in the Partitioned Global Address Space.

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

  Applications that exhibit irregular, dynamic, and unbalanced parallelism are growing in number and importance in the computational science and engineering communities. These applications span… (more)

Subjects/Keywords: Computer Science; High performance computing; Parallel programming models; Scalable runtime systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dinan, J. S. (2010). Scalable Task Parallel Programming in the Partitioned Global Address Space. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1275418061

Chicago Manual of Style (16th Edition):

Dinan, James S. “Scalable Task Parallel Programming in the Partitioned Global Address Space.” 2010. Doctoral Dissertation, The Ohio State University. Accessed August 10, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1275418061.

MLA Handbook (7th Edition):

Dinan, James S. “Scalable Task Parallel Programming in the Partitioned Global Address Space.” 2010. Web. 10 Aug 2020.

Vancouver:

Dinan JS. Scalable Task Parallel Programming in the Partitioned Global Address Space. [Internet] [Doctoral dissertation]. The Ohio State University; 2010. [cited 2020 Aug 10]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1275418061.

Council of Science Editors:

Dinan JS. Scalable Task Parallel Programming in the Partitioned Global Address Space. [Doctoral Dissertation]. The Ohio State University; 2010. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1275418061


Oregon State University

26. Kumaran, Santhosh. Towards architecture-adaptable parallel programming.

Degree: PhD, Computer Science, 1996, Oregon State University

 There is a software gap in parallel processing. The short lifespan and small installation base of parallel architectures have made it economically infeasible to develop… (more)

Subjects/Keywords: Parallel programming (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kumaran, S. (1996). Towards architecture-adaptable parallel programming. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/34375

Chicago Manual of Style (16th Edition):

Kumaran, Santhosh. “Towards architecture-adaptable parallel programming.” 1996. Doctoral Dissertation, Oregon State University. Accessed August 10, 2020. http://hdl.handle.net/1957/34375.

MLA Handbook (7th Edition):

Kumaran, Santhosh. “Towards architecture-adaptable parallel programming.” 1996. Web. 10 Aug 2020.

Vancouver:

Kumaran S. Towards architecture-adaptable parallel programming. [Internet] [Doctoral dissertation]. Oregon State University; 1996. [cited 2020 Aug 10]. Available from: http://hdl.handle.net/1957/34375.

Council of Science Editors:

Kumaran S. Towards architecture-adaptable parallel programming. [Doctoral Dissertation]. Oregon State University; 1996. Available from: http://hdl.handle.net/1957/34375


Oregon State University

27. Clement, Mark J. Analytical performance prediction of data-parallel programs.

Degree: PhD, Computer Science, 1994, Oregon State University

Subjects/Keywords: Parallel programming (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Clement, M. J. (1994). Analytical performance prediction of data-parallel programs. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/35024

Chicago Manual of Style (16th Edition):

Clement, Mark J. “Analytical performance prediction of data-parallel programs.” 1994. Doctoral Dissertation, Oregon State University. Accessed August 10, 2020. http://hdl.handle.net/1957/35024.

MLA Handbook (7th Edition):

Clement, Mark J. “Analytical performance prediction of data-parallel programs.” 1994. Web. 10 Aug 2020.

Vancouver:

Clement MJ. Analytical performance prediction of data-parallel programs. [Internet] [Doctoral dissertation]. Oregon State University; 1994. [cited 2020 Aug 10]. Available from: http://hdl.handle.net/1957/35024.

Council of Science Editors:

Clement MJ. Analytical performance prediction of data-parallel programs. [Doctoral Dissertation]. Oregon State University; 1994. Available from: http://hdl.handle.net/1957/35024


Oregon State University

28. Macielinski, Damien D. Task-parallel extension of a data-parallel language.

Degree: MS, Computer Science, 1994, Oregon State University

 Two prevalent models of parallel programming are data parallelism and task parallelism. Data parallelism is the simultaneous application of a single operation to a data… (more)

Subjects/Keywords: Parallel programming (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Macielinski, D. D. (1994). Task-parallel extension of a data-parallel language. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/35274

Chicago Manual of Style (16th Edition):

Macielinski, Damien D. “Task-parallel extension of a data-parallel language.” 1994. Masters Thesis, Oregon State University. Accessed August 10, 2020. http://hdl.handle.net/1957/35274.

MLA Handbook (7th Edition):

Macielinski, Damien D. “Task-parallel extension of a data-parallel language.” 1994. Web. 10 Aug 2020.

Vancouver:

Macielinski DD. Task-parallel extension of a data-parallel language. [Internet] [Masters thesis]. Oregon State University; 1994. [cited 2020 Aug 10]. Available from: http://hdl.handle.net/1957/35274.

Council of Science Editors:

Macielinski DD. Task-parallel extension of a data-parallel language. [Masters Thesis]. Oregon State University; 1994. Available from: http://hdl.handle.net/1957/35274


Oregon State University

29. Meyer-Arendt, Karen. Parallel code generation via scheduling.

Degree: MS, Computer Science, 1987, Oregon State University

 A translator has been designed and implemented which generates parallel code for a long instruction word parallel computer with local memories. Its main methods are… (more)

Subjects/Keywords: Parallel programming (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Meyer-Arendt, K. (1987). Parallel code generation via scheduling. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/39882

Chicago Manual of Style (16th Edition):

Meyer-Arendt, Karen. “Parallel code generation via scheduling.” 1987. Masters Thesis, Oregon State University. Accessed August 10, 2020. http://hdl.handle.net/1957/39882.

MLA Handbook (7th Edition):

Meyer-Arendt, Karen. “Parallel code generation via scheduling.” 1987. Web. 10 Aug 2020.

Vancouver:

Meyer-Arendt K. Parallel code generation via scheduling. [Internet] [Masters thesis]. Oregon State University; 1987. [cited 2020 Aug 10]. Available from: http://hdl.handle.net/1957/39882.

Council of Science Editors:

Meyer-Arendt K. Parallel code generation via scheduling. [Masters Thesis]. Oregon State University; 1987. Available from: http://hdl.handle.net/1957/39882

30. Demko, Aleksander Borys. A Parallel Processing Library for User-friendly Applications.

Degree: Computer Science, 2012, University of Manitoba

 Clusters of commodity, "off the shelf" workstations have given developers and users access to scalable and affordable computing resources. However, unlike large, symmetric multi-processing machines,… (more)

Subjects/Keywords: Computer Science; Parallel Programming

computer processors have limits to their performance, and only through parallel programming can… …standard queue-like data structure in Computer Science. Alternatively, in UNIX, a FIFO refers to… …implementation of one possible solution. 1.2 Target User There are many parallel programming solutions… …facets. The first issue is how to make programming 4 Chapter 1: Introduction parallel… …x29;, so as to reap the benefits of parallel programming. These three key issues can be… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Demko, A. B. (2012). A Parallel Processing Library for User-friendly Applications. (Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/5046

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

Demko, Aleksander Borys. “A Parallel Processing Library for User-friendly Applications.” 2012. Thesis, University of Manitoba. Accessed August 10, 2020. http://hdl.handle.net/1993/5046.

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

MLA Handbook (7th Edition):

Demko, Aleksander Borys. “A Parallel Processing Library for User-friendly Applications.” 2012. Web. 10 Aug 2020.

Vancouver:

Demko AB. A Parallel Processing Library for User-friendly Applications. [Internet] [Thesis]. University of Manitoba; 2012. [cited 2020 Aug 10]. Available from: http://hdl.handle.net/1993/5046.

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

Council of Science Editors:

Demko AB. A Parallel Processing Library for User-friendly Applications. [Thesis]. University of Manitoba; 2012. Available from: http://hdl.handle.net/1993/5046

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

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

.