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

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters

1. Pamnany, Kiran. Safe Parallelism for Servers.

Degree: PhD, Computer Science, 2011, Brown University

 Applications must embrace parallelism in order to increase performance on today's ubiquitous multicore processors. Unfortunately, writing correct parallel applications is notoriously hard, partly because the… (more)

Subjects/Keywords: concurrency

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pamnany, K. (2011). Safe Parallelism for Servers. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:11324/

Chicago Manual of Style (16th Edition):

Pamnany, Kiran. “Safe Parallelism for Servers.” 2011. Doctoral Dissertation, Brown University. Accessed October 16, 2018. https://repository.library.brown.edu/studio/item/bdr:11324/.

MLA Handbook (7th Edition):

Pamnany, Kiran. “Safe Parallelism for Servers.” 2011. Web. 16 Oct 2018.

Vancouver:

Pamnany K. Safe Parallelism for Servers. [Internet] [Doctoral dissertation]. Brown University; 2011. [cited 2018 Oct 16]. Available from: https://repository.library.brown.edu/studio/item/bdr:11324/.

Council of Science Editors:

Pamnany K. Safe Parallelism for Servers. [Doctoral Dissertation]. Brown University; 2011. Available from: https://repository.library.brown.edu/studio/item/bdr:11324/


University of Ottawa

2. Xu, Xinghao. Methodology for Introducing Concurrency into Sequential Programs .

Degree: 2015, University of Ottawa

 Efficiency of software application is one of the important metrics that are used to measure the quality of software applications. Nowadays, more and more professionals… (more)

Subjects/Keywords: Methodology; Concurrency

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xu, X. (2015). Methodology for Introducing Concurrency into Sequential Programs . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/31875

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

Xu, Xinghao. “Methodology for Introducing Concurrency into Sequential Programs .” 2015. Thesis, University of Ottawa. Accessed October 16, 2018. http://hdl.handle.net/10393/31875.

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

MLA Handbook (7th Edition):

Xu, Xinghao. “Methodology for Introducing Concurrency into Sequential Programs .” 2015. Web. 16 Oct 2018.

Vancouver:

Xu X. Methodology for Introducing Concurrency into Sequential Programs . [Internet] [Thesis]. University of Ottawa; 2015. [cited 2018 Oct 16]. Available from: http://hdl.handle.net/10393/31875.

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

Council of Science Editors:

Xu X. Methodology for Introducing Concurrency into Sequential Programs . [Thesis]. University of Ottawa; 2015. Available from: http://hdl.handle.net/10393/31875

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


University of New South Wales

3. Xie, Xinwei. Accurate and efficient on-the-fly data race detection for multithreaded programs.

Degree: Computer Science & Engineering, 2012, University of New South Wales

 Benefiting from the recent hardware improvement, multithreaded programs may still introduce concurrency defects which are notoriously difficult to detect, due to the non-deterministic program behavior.… (more)

Subjects/Keywords: concurrency; Concurrency; Data race; Dynamic analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xie, X. (2012). Accurate and efficient on-the-fly data race detection for multithreaded programs. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/52125

Chicago Manual of Style (16th Edition):

Xie, Xinwei. “Accurate and efficient on-the-fly data race detection for multithreaded programs.” 2012. Doctoral Dissertation, University of New South Wales. Accessed October 16, 2018. http://handle.unsw.edu.au/1959.4/52125.

MLA Handbook (7th Edition):

Xie, Xinwei. “Accurate and efficient on-the-fly data race detection for multithreaded programs.” 2012. Web. 16 Oct 2018.

Vancouver:

Xie X. Accurate and efficient on-the-fly data race detection for multithreaded programs. [Internet] [Doctoral dissertation]. University of New South Wales; 2012. [cited 2018 Oct 16]. Available from: http://handle.unsw.edu.au/1959.4/52125.

Council of Science Editors:

Xie X. Accurate and efficient on-the-fly data race detection for multithreaded programs. [Doctoral Dissertation]. University of New South Wales; 2012. Available from: http://handle.unsw.edu.au/1959.4/52125


University of Oxford

4. D'Osualdo, Emanuele. Verification of message passing concurrent systems.

Degree: PhD, 2015, University of Oxford

 This dissertation is concerned with the development of fully-automatic methods of verification, for message-passing based concurrent systems. In the first part of the thesis we… (more)

Subjects/Keywords: Computer Science; Concurrency

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

D'Osualdo, E. (2015). Verification of message passing concurrent systems. (Doctoral Dissertation). University of Oxford. Retrieved from https://ora.ox.ac.uk/objects/uuid:f669b95b-f760-4de9-a62a-374d41172879 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.711956

Chicago Manual of Style (16th Edition):

D'Osualdo, Emanuele. “Verification of message passing concurrent systems.” 2015. Doctoral Dissertation, University of Oxford. Accessed October 16, 2018. https://ora.ox.ac.uk/objects/uuid:f669b95b-f760-4de9-a62a-374d41172879 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.711956.

MLA Handbook (7th Edition):

D'Osualdo, Emanuele. “Verification of message passing concurrent systems.” 2015. Web. 16 Oct 2018.

Vancouver:

D'Osualdo E. Verification of message passing concurrent systems. [Internet] [Doctoral dissertation]. University of Oxford; 2015. [cited 2018 Oct 16]. Available from: https://ora.ox.ac.uk/objects/uuid:f669b95b-f760-4de9-a62a-374d41172879 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.711956.

Council of Science Editors:

D'Osualdo E. Verification of message passing concurrent systems. [Doctoral Dissertation]. University of Oxford; 2015. Available from: https://ora.ox.ac.uk/objects/uuid:f669b95b-f760-4de9-a62a-374d41172879 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.711956


Victoria University of Wellington

5. Atkins, Daniel. Modern Concurrency Techniques: an Exploration.

Degree: 2013, Victoria University of Wellington

 In this thesis, we investigate some of the options programmers have when writing a concurrent program. We explore the use of manually created threads, thread-pools,… (more)

Subjects/Keywords: Concurrency; Threads; Actors

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Atkins, D. (2013). Modern Concurrency Techniques: an Exploration. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/3068

Chicago Manual of Style (16th Edition):

Atkins, Daniel. “Modern Concurrency Techniques: an Exploration.” 2013. Masters Thesis, Victoria University of Wellington. Accessed October 16, 2018. http://hdl.handle.net/10063/3068.

MLA Handbook (7th Edition):

Atkins, Daniel. “Modern Concurrency Techniques: an Exploration.” 2013. Web. 16 Oct 2018.

Vancouver:

Atkins D. Modern Concurrency Techniques: an Exploration. [Internet] [Masters thesis]. Victoria University of Wellington; 2013. [cited 2018 Oct 16]. Available from: http://hdl.handle.net/10063/3068.

Council of Science Editors:

Atkins D. Modern Concurrency Techniques: an Exploration. [Masters Thesis]. Victoria University of Wellington; 2013. Available from: http://hdl.handle.net/10063/3068


University of Texas – Austin

6. Heidt, David Patrick. Framework for testing Java concurrency.

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

 Concurrent programming has become ubiquitous in the arena of application development, requiring most production quality systems to deal with at least some degree of multi-threaded… (more)

Subjects/Keywords: Java; Concurrency; Testing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Heidt, D. P. (2010). Framework for testing Java concurrency. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2010-12-2468

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

Heidt, David Patrick. “Framework for testing Java concurrency.” 2010. Thesis, University of Texas – Austin. Accessed October 16, 2018. http://hdl.handle.net/2152/ETD-UT-2010-12-2468.

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

MLA Handbook (7th Edition):

Heidt, David Patrick. “Framework for testing Java concurrency.” 2010. Web. 16 Oct 2018.

Vancouver:

Heidt DP. Framework for testing Java concurrency. [Internet] [Thesis]. University of Texas – Austin; 2010. [cited 2018 Oct 16]. Available from: http://hdl.handle.net/2152/ETD-UT-2010-12-2468.

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

Council of Science Editors:

Heidt DP. Framework for testing Java concurrency. [Thesis]. University of Texas – Austin; 2010. Available from: http://hdl.handle.net/2152/ETD-UT-2010-12-2468

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


Victoria University of Wellington

7. Tabilog, Allan. Program Verification with Separation Logic and Rely Guarantee.

Degree: 2017, Victoria University of Wellington

 This thesis explores two kinds of program logics that have become important for modern program verification - separation logic, for reasoning about programs that use… (more)

Subjects/Keywords: Logic; Program verification; Concurrency

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tabilog, A. (2017). Program Verification with Separation Logic and Rely Guarantee. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/6271

Chicago Manual of Style (16th Edition):

Tabilog, Allan. “Program Verification with Separation Logic and Rely Guarantee.” 2017. Masters Thesis, Victoria University of Wellington. Accessed October 16, 2018. http://hdl.handle.net/10063/6271.

MLA Handbook (7th Edition):

Tabilog, Allan. “Program Verification with Separation Logic and Rely Guarantee.” 2017. Web. 16 Oct 2018.

Vancouver:

Tabilog A. Program Verification with Separation Logic and Rely Guarantee. [Internet] [Masters thesis]. Victoria University of Wellington; 2017. [cited 2018 Oct 16]. Available from: http://hdl.handle.net/10063/6271.

Council of Science Editors:

Tabilog A. Program Verification with Separation Logic and Rely Guarantee. [Masters Thesis]. Victoria University of Wellington; 2017. Available from: http://hdl.handle.net/10063/6271


Cornell University

8. Tseng, Wei-lung. Zero-Knowledge On The Internet .

Degree: 2011, Cornell University

 Zero-knowledge protocols allow one party to prove the validity of a mathematical statement to another party, without revealing any additional information. The use of zero-knowledge… (more)

Subjects/Keywords: Zero-Knowledge; Concurrency; Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tseng, W. (2011). Zero-Knowledge On The Internet . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/30779

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

Tseng, Wei-lung. “Zero-Knowledge On The Internet .” 2011. Thesis, Cornell University. Accessed October 16, 2018. http://hdl.handle.net/1813/30779.

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

MLA Handbook (7th Edition):

Tseng, Wei-lung. “Zero-Knowledge On The Internet .” 2011. Web. 16 Oct 2018.

Vancouver:

Tseng W. Zero-Knowledge On The Internet . [Internet] [Thesis]. Cornell University; 2011. [cited 2018 Oct 16]. Available from: http://hdl.handle.net/1813/30779.

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

Council of Science Editors:

Tseng W. Zero-Knowledge On The Internet . [Thesis]. Cornell University; 2011. Available from: http://hdl.handle.net/1813/30779

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


University of Rochester

9. Izraelevitz, Joseph. Concurrency implications of nonvolatile byte-addressable memory.

Degree: PhD, 2018, University of Rochester

 In the near future, storage technology advances are expected to provide nonvolatile byte addressable memory (NVM) for general purpose computing. These new technologies provide high… (more)

Subjects/Keywords: Nonvolatile memory; Concurrency; Shared memory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Izraelevitz, J. (2018). Concurrency implications of nonvolatile byte-addressable memory. (Doctoral Dissertation). University of Rochester. Retrieved from http://hdl.handle.net/1802/33501

Chicago Manual of Style (16th Edition):

Izraelevitz, Joseph. “Concurrency implications of nonvolatile byte-addressable memory.” 2018. Doctoral Dissertation, University of Rochester. Accessed October 16, 2018. http://hdl.handle.net/1802/33501.

MLA Handbook (7th Edition):

Izraelevitz, Joseph. “Concurrency implications of nonvolatile byte-addressable memory.” 2018. Web. 16 Oct 2018.

Vancouver:

Izraelevitz J. Concurrency implications of nonvolatile byte-addressable memory. [Internet] [Doctoral dissertation]. University of Rochester; 2018. [cited 2018 Oct 16]. Available from: http://hdl.handle.net/1802/33501.

Council of Science Editors:

Izraelevitz J. Concurrency implications of nonvolatile byte-addressable memory. [Doctoral Dissertation]. University of Rochester; 2018. Available from: http://hdl.handle.net/1802/33501


University of Illinois – Urbana-Champaign

10. Luo, Qingzhou. Testing, runtime verification, and analysis of concurrent programs.

Degree: PhD, Computer Science, 2015, University of Illinois – Urbana-Champaign

 With the development of multi-core processors, concurrent programs are becoming more and more popular. Among several models, the multithreaded shared-memory model is the predominant programming… (more)

Subjects/Keywords: Runtime verification; concurrency; testing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Luo, Q. (2015). Testing, runtime verification, and analysis of concurrent programs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/87955

Chicago Manual of Style (16th Edition):

Luo, Qingzhou. “Testing, runtime verification, and analysis of concurrent programs.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed October 16, 2018. http://hdl.handle.net/2142/87955.

MLA Handbook (7th Edition):

Luo, Qingzhou. “Testing, runtime verification, and analysis of concurrent programs.” 2015. Web. 16 Oct 2018.

Vancouver:

Luo Q. Testing, runtime verification, and analysis of concurrent programs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2018 Oct 16]. Available from: http://hdl.handle.net/2142/87955.

Council of Science Editors:

Luo Q. Testing, runtime verification, and analysis of concurrent programs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/87955

11. Nagathota, Hadassah Pearlyn. Design and Implementation of CMT in Real-time : Evaluation based on scheduling mechanisms.

Degree: 2015, , Department of Communication Systems

  Context: Standard transport layer protocols like UDP, TCP, andSCTP use only one access technology at a time. Concurrent MultipathTransmission (CMT), has been developed for… (more)

Subjects/Keywords: Concurrency; Multi-homing; Performance; Scheduling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nagathota, H. P. (2015). Design and Implementation of CMT in Real-time : Evaluation based on scheduling mechanisms. (Thesis). , Department of Communication Systems. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:bth-10815

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

Nagathota, Hadassah Pearlyn. “Design and Implementation of CMT in Real-time : Evaluation based on scheduling mechanisms.” 2015. Thesis, , Department of Communication Systems. Accessed October 16, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-10815.

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

MLA Handbook (7th Edition):

Nagathota, Hadassah Pearlyn. “Design and Implementation of CMT in Real-time : Evaluation based on scheduling mechanisms.” 2015. Web. 16 Oct 2018.

Vancouver:

Nagathota HP. Design and Implementation of CMT in Real-time : Evaluation based on scheduling mechanisms. [Internet] [Thesis]. , Department of Communication Systems; 2015. [cited 2018 Oct 16]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-10815.

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

Council of Science Editors:

Nagathota HP. Design and Implementation of CMT in Real-time : Evaluation based on scheduling mechanisms. [Thesis]. , Department of Communication Systems; 2015. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-10815

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


University of Illinois – Urbana-Champaign

12. Charalambides, Minas. Actor programming with static guarantees.

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

 This thesis discusses two methodologies for applying type discipline to concurrent programming with actors: process types, and session types. A system based on each of… (more)

Subjects/Keywords: actors; type; static; session; concurrency

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Charalambides, M. (2018). Actor programming with static guarantees. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/101036

Chicago Manual of Style (16th Edition):

Charalambides, Minas. “Actor programming with static guarantees.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed October 16, 2018. http://hdl.handle.net/2142/101036.

MLA Handbook (7th Edition):

Charalambides, Minas. “Actor programming with static guarantees.” 2018. Web. 16 Oct 2018.

Vancouver:

Charalambides M. Actor programming with static guarantees. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2018 Oct 16]. Available from: http://hdl.handle.net/2142/101036.

Council of Science Editors:

Charalambides M. Actor programming with static guarantees. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/101036


University of Sydney

13. Alomari, Mohammad. Ensuring Serializable Executions with Snapshot Isolation DBMS .

Degree: 2009, University of Sydney

 Snapshot Isolation (SI) is a multiversion concurrency control that has been implemented by open source and commercial database systems such as PostgreSQL and Oracle. The… (more)

Subjects/Keywords: Concurrency Control; Serializability; Correctness; Snapshot Isolation; Multiversion concurrency control; performance

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Alomari, M. (2009). Ensuring Serializable Executions with Snapshot Isolation DBMS . (Thesis). University of Sydney. Retrieved from http://hdl.handle.net/2123/4211

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

Alomari, Mohammad. “Ensuring Serializable Executions with Snapshot Isolation DBMS .” 2009. Thesis, University of Sydney. Accessed October 16, 2018. http://hdl.handle.net/2123/4211.

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

MLA Handbook (7th Edition):

Alomari, Mohammad. “Ensuring Serializable Executions with Snapshot Isolation DBMS .” 2009. Web. 16 Oct 2018.

Vancouver:

Alomari M. Ensuring Serializable Executions with Snapshot Isolation DBMS . [Internet] [Thesis]. University of Sydney; 2009. [cited 2018 Oct 16]. Available from: http://hdl.handle.net/2123/4211.

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

Council of Science Editors:

Alomari M. Ensuring Serializable Executions with Snapshot Isolation DBMS . [Thesis]. University of Sydney; 2009. Available from: http://hdl.handle.net/2123/4211

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


University of Cambridge

14. Pichon-Pharabod, Jean Yves Alexis. A no-thin-air memory model for programming languages .

Degree: 2018, University of Cambridge

 Many hardware and compiler optimisations introduced to speed up single-threaded programs also introduce additional, sometimes surprising, behaviours for concurrent programs with shared mutable state. How… (more)

Subjects/Keywords: concurrency; relaxed memory models; C/C++

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pichon-Pharabod, J. Y. A. (2018). A no-thin-air memory model for programming languages . (Thesis). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/274465

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

Pichon-Pharabod, Jean Yves Alexis. “A no-thin-air memory model for programming languages .” 2018. Thesis, University of Cambridge. Accessed October 16, 2018. https://www.repository.cam.ac.uk/handle/1810/274465.

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

MLA Handbook (7th Edition):

Pichon-Pharabod, Jean Yves Alexis. “A no-thin-air memory model for programming languages .” 2018. Web. 16 Oct 2018.

Vancouver:

Pichon-Pharabod JYA. A no-thin-air memory model for programming languages . [Internet] [Thesis]. University of Cambridge; 2018. [cited 2018 Oct 16]. Available from: https://www.repository.cam.ac.uk/handle/1810/274465.

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

Council of Science Editors:

Pichon-Pharabod JYA. A no-thin-air memory model for programming languages . [Thesis]. University of Cambridge; 2018. Available from: https://www.repository.cam.ac.uk/handle/1810/274465

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


University of Sydney

15. Cahill, Michael James. Serializable Isolation for Snapshot Databases .

Degree: 2009, University of Sydney

 Many popular database management systems implement a multiversion concurrency control algorithm called snapshot isolation rather than providing full serializability based on locking. There are well-known… (more)

Subjects/Keywords: databases; transactions; concurrency control; snapshot isolation; serialiazability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cahill, M. J. (2009). Serializable Isolation for Snapshot Databases . (Thesis). University of Sydney. Retrieved from http://hdl.handle.net/2123/5353

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

Cahill, Michael James. “Serializable Isolation for Snapshot Databases .” 2009. Thesis, University of Sydney. Accessed October 16, 2018. http://hdl.handle.net/2123/5353.

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

MLA Handbook (7th Edition):

Cahill, Michael James. “Serializable Isolation for Snapshot Databases .” 2009. Web. 16 Oct 2018.

Vancouver:

Cahill MJ. Serializable Isolation for Snapshot Databases . [Internet] [Thesis]. University of Sydney; 2009. [cited 2018 Oct 16]. Available from: http://hdl.handle.net/2123/5353.

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

Council of Science Editors:

Cahill MJ. Serializable Isolation for Snapshot Databases . [Thesis]. University of Sydney; 2009. Available from: http://hdl.handle.net/2123/5353

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


Rochester Institute of Technology

16. Le, Matthew. Partial Aborts for Transactions via First Class Continuations.

Degree: MS, Computer Science (GCCIS), 2016, Rochester Institute of Technology

  Software transactional memory (STM) has proven to be a useful abstraction for developing concurrent applications where programmers denote transactions with an atomic construct that… (more)

Subjects/Keywords: Concurrency; Functional programming; Software transactional memory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Le, M. (2016). Partial Aborts for Transactions via First Class Continuations. (Masters Thesis). Rochester Institute of Technology. Retrieved from http://scholarworks.rit.edu/theses/9170

Chicago Manual of Style (16th Edition):

Le, Matthew. “Partial Aborts for Transactions via First Class Continuations.” 2016. Masters Thesis, Rochester Institute of Technology. Accessed October 16, 2018. http://scholarworks.rit.edu/theses/9170.

MLA Handbook (7th Edition):

Le, Matthew. “Partial Aborts for Transactions via First Class Continuations.” 2016. Web. 16 Oct 2018.

Vancouver:

Le M. Partial Aborts for Transactions via First Class Continuations. [Internet] [Masters thesis]. Rochester Institute of Technology; 2016. [cited 2018 Oct 16]. Available from: http://scholarworks.rit.edu/theses/9170.

Council of Science Editors:

Le M. Partial Aborts for Transactions via First Class Continuations. [Masters Thesis]. Rochester Institute of Technology; 2016. Available from: http://scholarworks.rit.edu/theses/9170


University of Kansas

17. Phagan, Tyrian. A Practical Framework for Configuration of Scheduling and Concurrency Control in Linux.

Degree: MS, Electrical Engineering & Computer Science, 2011, University of Kansas

 There is a growing need for developers to be able to specify programming models for an application, in order to: increase efficiency, system reliability, system… (more)

Subjects/Keywords: Computer science; Concurrency control; Configurable; Linux; Scheduling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Phagan, T. (2011). A Practical Framework for Configuration of Scheduling and Concurrency Control in Linux. (Masters Thesis). University of Kansas. Retrieved from http://hdl.handle.net/1808/8173

Chicago Manual of Style (16th Edition):

Phagan, Tyrian. “A Practical Framework for Configuration of Scheduling and Concurrency Control in Linux.” 2011. Masters Thesis, University of Kansas. Accessed October 16, 2018. http://hdl.handle.net/1808/8173.

MLA Handbook (7th Edition):

Phagan, Tyrian. “A Practical Framework for Configuration of Scheduling and Concurrency Control in Linux.” 2011. Web. 16 Oct 2018.

Vancouver:

Phagan T. A Practical Framework for Configuration of Scheduling and Concurrency Control in Linux. [Internet] [Masters thesis]. University of Kansas; 2011. [cited 2018 Oct 16]. Available from: http://hdl.handle.net/1808/8173.

Council of Science Editors:

Phagan T. A Practical Framework for Configuration of Scheduling and Concurrency Control in Linux. [Masters Thesis]. University of Kansas; 2011. Available from: http://hdl.handle.net/1808/8173

18. Johnell, Carl. Parallel programming in Go and Scala : A performance comparison.

Degree: 2015, , Department of Software Engineering

      This thesis provides a performance comparison of parallel programming in Go and Scala. Go supports concurrency through goroutines and channels. Scala have… (more)

Subjects/Keywords: Go; Scala; parallelism; concurrency; Software Engineering; Programvaruteknik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Johnell, C. (2015). Parallel programming in Go and Scala : A performance comparison. (Thesis). , Department of Software Engineering. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:bth-996

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

Johnell, Carl. “Parallel programming in Go and Scala : A performance comparison.” 2015. Thesis, , Department of Software Engineering. Accessed October 16, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-996.

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

MLA Handbook (7th Edition):

Johnell, Carl. “Parallel programming in Go and Scala : A performance comparison.” 2015. Web. 16 Oct 2018.

Vancouver:

Johnell C. Parallel programming in Go and Scala : A performance comparison. [Internet] [Thesis]. , Department of Software Engineering; 2015. [cited 2018 Oct 16]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-996.

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

Council of Science Editors:

Johnell C. Parallel programming in Go and Scala : A performance comparison. [Thesis]. , Department of Software Engineering; 2015. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-996

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


University of Johannesburg

19. Kruger, Hanlie. 'n Studie van 'n aantal gelyktydigheidsbeheerprotokolle vir databasisse .

Degree: 2014, University of Johannesburg

Concurrency control is the problem that exists in a database management system when more than one transaction or application is executed simultaneously. If transactions or… (more)

Subjects/Keywords: Concurrency control (Computer science); Database management

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kruger, H. (2014). 'n Studie van 'n aantal gelyktydigheidsbeheerprotokolle vir databasisse . (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/9723

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

Kruger, Hanlie. “'n Studie van 'n aantal gelyktydigheidsbeheerprotokolle vir databasisse .” 2014. Thesis, University of Johannesburg. Accessed October 16, 2018. http://hdl.handle.net/10210/9723.

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

MLA Handbook (7th Edition):

Kruger, Hanlie. “'n Studie van 'n aantal gelyktydigheidsbeheerprotokolle vir databasisse .” 2014. Web. 16 Oct 2018.

Vancouver:

Kruger H. 'n Studie van 'n aantal gelyktydigheidsbeheerprotokolle vir databasisse . [Internet] [Thesis]. University of Johannesburg; 2014. [cited 2018 Oct 16]. Available from: http://hdl.handle.net/10210/9723.

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

Council of Science Editors:

Kruger H. 'n Studie van 'n aantal gelyktydigheidsbeheerprotokolle vir databasisse . [Thesis]. University of Johannesburg; 2014. Available from: http://hdl.handle.net/10210/9723

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


Queens University

20. Auer, Anthony. Using Discrete-Event Systems for the Automatic Generation of Concurrency Control for Dynamic Threads .

Degree: Computing, 2010, Queens University

 The application of Discrete-Event Systems (DES) theory to the problem of guar- anteeably enforcing concurrency constraints in multi-threaded applications has been studied under certain assumptions,… (more)

Subjects/Keywords: software; discrete event systems; concurrency; modelling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Auer, A. (2010). Using Discrete-Event Systems for the Automatic Generation of Concurrency Control for Dynamic Threads . (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/5690

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

Auer, Anthony. “Using Discrete-Event Systems for the Automatic Generation of Concurrency Control for Dynamic Threads .” 2010. Thesis, Queens University. Accessed October 16, 2018. http://hdl.handle.net/1974/5690.

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

MLA Handbook (7th Edition):

Auer, Anthony. “Using Discrete-Event Systems for the Automatic Generation of Concurrency Control for Dynamic Threads .” 2010. Web. 16 Oct 2018.

Vancouver:

Auer A. Using Discrete-Event Systems for the Automatic Generation of Concurrency Control for Dynamic Threads . [Internet] [Thesis]. Queens University; 2010. [cited 2018 Oct 16]. Available from: http://hdl.handle.net/1974/5690.

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

Council of Science Editors:

Auer A. Using Discrete-Event Systems for the Automatic Generation of Concurrency Control for Dynamic Threads . [Thesis]. Queens University; 2010. Available from: http://hdl.handle.net/1974/5690

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

21. Lilleston, Pamela Sherman. Attitudes Towards Relationship Power and Concurrent Sexual Partnerships among African American Adolescents in Baltimore, MD.

Degree: 2013, Johns Hopkins University

 Background: African American adolescents are disproportionately affected by sexually transmitted infections (STIs) including HIV. A growing body of literature suggests that high rates of sexual… (more)

Subjects/Keywords: Gender Roles; Concurrency; Adolescents; African Americans

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lilleston, P. S. (2013). Attitudes Towards Relationship Power and Concurrent Sexual Partnerships among African American Adolescents in Baltimore, MD. (Thesis). Johns Hopkins University. Retrieved from http://jhir.library.jhu.edu/handle/1774.2/36996

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

Lilleston, Pamela Sherman. “Attitudes Towards Relationship Power and Concurrent Sexual Partnerships among African American Adolescents in Baltimore, MD.” 2013. Thesis, Johns Hopkins University. Accessed October 16, 2018. http://jhir.library.jhu.edu/handle/1774.2/36996.

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

MLA Handbook (7th Edition):

Lilleston, Pamela Sherman. “Attitudes Towards Relationship Power and Concurrent Sexual Partnerships among African American Adolescents in Baltimore, MD.” 2013. Web. 16 Oct 2018.

Vancouver:

Lilleston PS. Attitudes Towards Relationship Power and Concurrent Sexual Partnerships among African American Adolescents in Baltimore, MD. [Internet] [Thesis]. Johns Hopkins University; 2013. [cited 2018 Oct 16]. Available from: http://jhir.library.jhu.edu/handle/1774.2/36996.

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

Council of Science Editors:

Lilleston PS. Attitudes Towards Relationship Power and Concurrent Sexual Partnerships among African American Adolescents in Baltimore, MD. [Thesis]. Johns Hopkins University; 2013. Available from: http://jhir.library.jhu.edu/handle/1774.2/36996

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


University of Illinois – Urbana-Champaign

22. Lifflander, Jonathan Josiah. Optimizing work stealing algorithms with scheduling constraints.

Degree: PhD, Computer Science, 2016, University of Illinois – Urbana-Champaign

 The fork-join paradigm of concurrent expression has gained popularity in conjunction with work-stealing schedulers. Random work-stealing schedulers have been shown to effectively perform dynamic load… (more)

Subjects/Keywords: concurrency; work-stealing; fork-join; scheduling; locality

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lifflander, J. J. (2016). Optimizing work stealing algorithms with scheduling constraints. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/90511

Chicago Manual of Style (16th Edition):

Lifflander, Jonathan Josiah. “Optimizing work stealing algorithms with scheduling constraints.” 2016. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed October 16, 2018. http://hdl.handle.net/2142/90511.

MLA Handbook (7th Edition):

Lifflander, Jonathan Josiah. “Optimizing work stealing algorithms with scheduling constraints.” 2016. Web. 16 Oct 2018.

Vancouver:

Lifflander JJ. Optimizing work stealing algorithms with scheduling constraints. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2016. [cited 2018 Oct 16]. Available from: http://hdl.handle.net/2142/90511.

Council of Science Editors:

Lifflander JJ. Optimizing work stealing algorithms with scheduling constraints. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/90511


University of Toronto

23. Lupei, Daniel. A Study of Conflict Detection in Software Transactional Memory.

Degree: 2009, University of Toronto

Transactional Memory (TM) has been proposed as a simpler parallel programming model compared to the traditional locking model. However, uptake from the programming community has… (more)

Subjects/Keywords: software transactional memory; concurrency control; 0984

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lupei, D. (2009). A Study of Conflict Detection in Software Transactional Memory. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/18804

Chicago Manual of Style (16th Edition):

Lupei, Daniel. “A Study of Conflict Detection in Software Transactional Memory.” 2009. Masters Thesis, University of Toronto. Accessed October 16, 2018. http://hdl.handle.net/1807/18804.

MLA Handbook (7th Edition):

Lupei, Daniel. “A Study of Conflict Detection in Software Transactional Memory.” 2009. Web. 16 Oct 2018.

Vancouver:

Lupei D. A Study of Conflict Detection in Software Transactional Memory. [Internet] [Masters thesis]. University of Toronto; 2009. [cited 2018 Oct 16]. Available from: http://hdl.handle.net/1807/18804.

Council of Science Editors:

Lupei D. A Study of Conflict Detection in Software Transactional Memory. [Masters Thesis]. University of Toronto; 2009. Available from: http://hdl.handle.net/1807/18804


University of Toronto

24. Chew, Lee. A System for Detecting, Preventing and Exposing Atomicity Violations in Multithreaded Programs.

Degree: 2009, University of Toronto

Multi-core machines have become common and have led to an increase in multithreaded software. In turn, the number of concurrency bugs has also increased. Such… (more)

Subjects/Keywords: Concurrency; Systems Design; Atomicity violation; 0984

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chew, L. (2009). A System for Detecting, Preventing and Exposing Atomicity Violations in Multithreaded Programs. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/18254

Chicago Manual of Style (16th Edition):

Chew, Lee. “A System for Detecting, Preventing and Exposing Atomicity Violations in Multithreaded Programs.” 2009. Masters Thesis, University of Toronto. Accessed October 16, 2018. http://hdl.handle.net/1807/18254.

MLA Handbook (7th Edition):

Chew, Lee. “A System for Detecting, Preventing and Exposing Atomicity Violations in Multithreaded Programs.” 2009. Web. 16 Oct 2018.

Vancouver:

Chew L. A System for Detecting, Preventing and Exposing Atomicity Violations in Multithreaded Programs. [Internet] [Masters thesis]. University of Toronto; 2009. [cited 2018 Oct 16]. Available from: http://hdl.handle.net/1807/18254.

Council of Science Editors:

Chew L. A System for Detecting, Preventing and Exposing Atomicity Violations in Multithreaded Programs. [Masters Thesis]. University of Toronto; 2009. Available from: http://hdl.handle.net/1807/18254


Virginia Tech

25. Barnes II, Robert Otto. Concurrency Optimization for Integrative Network Analysis.

Degree: MS, Electrical and Computer Engineering, 2013, Virginia Tech

 Virginia Tech\'s Computational Bioinformatics and Bio-imaging Laboratory (CBIL) is exploring integrative network analysis techniques to identify subnetworks or genetic pathways that contribute to various cancers.… (more)

Subjects/Keywords: BMRF; simulated annealing; subnetwork identification; concurrency; parallelism

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Barnes II, R. O. (2013). Concurrency Optimization for Integrative Network Analysis. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/23220

Chicago Manual of Style (16th Edition):

Barnes II, Robert Otto. “Concurrency Optimization for Integrative Network Analysis.” 2013. Masters Thesis, Virginia Tech. Accessed October 16, 2018. http://hdl.handle.net/10919/23220.

MLA Handbook (7th Edition):

Barnes II, Robert Otto. “Concurrency Optimization for Integrative Network Analysis.” 2013. Web. 16 Oct 2018.

Vancouver:

Barnes II RO. Concurrency Optimization for Integrative Network Analysis. [Internet] [Masters thesis]. Virginia Tech; 2013. [cited 2018 Oct 16]. Available from: http://hdl.handle.net/10919/23220.

Council of Science Editors:

Barnes II RO. Concurrency Optimization for Integrative Network Analysis. [Masters Thesis]. Virginia Tech; 2013. Available from: http://hdl.handle.net/10919/23220


Virginia Tech

26. Dai, Jing. Efficient Concurrent Operations in Spatial Databases.

Degree: Computer Science, 2009, Virginia Tech

 As demanded by applications such as GIS, CAD, ecology analysis, and space research, efficient spatial data access methods have attracted much research. Especially, moving object… (more)

Subjects/Keywords: Indexing; Query Processing; Concurrency Control; Spatial Database

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dai, J. (2009). Efficient Concurrent Operations in Spatial Databases. (Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/28987

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

Dai, Jing. “Efficient Concurrent Operations in Spatial Databases.” 2009. Thesis, Virginia Tech. Accessed October 16, 2018. http://hdl.handle.net/10919/28987.

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

MLA Handbook (7th Edition):

Dai, Jing. “Efficient Concurrent Operations in Spatial Databases.” 2009. Web. 16 Oct 2018.

Vancouver:

Dai J. Efficient Concurrent Operations in Spatial Databases. [Internet] [Thesis]. Virginia Tech; 2009. [cited 2018 Oct 16]. Available from: http://hdl.handle.net/10919/28987.

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

Council of Science Editors:

Dai J. Efficient Concurrent Operations in Spatial Databases. [Thesis]. Virginia Tech; 2009. Available from: http://hdl.handle.net/10919/28987

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


Queensland University of Technology

27. Zimmerman, John Dean. Model driven coordination framework for concurrency programming.

Degree: 2008, Queensland University of Technology

 Ensembles of distributed, autonomous and heterogenous entities that are situated in an environment, interacting over both space and time, and striving to uphold some global… (more)

Subjects/Keywords: concurrency programming; model driven coordination framework

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zimmerman, J. D. (2008). Model driven coordination framework for concurrency programming. (Thesis). Queensland University of Technology. Retrieved from https://eprints.qut.edu.au/16613/

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

Zimmerman, John Dean. “Model driven coordination framework for concurrency programming.” 2008. Thesis, Queensland University of Technology. Accessed October 16, 2018. https://eprints.qut.edu.au/16613/.

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

MLA Handbook (7th Edition):

Zimmerman, John Dean. “Model driven coordination framework for concurrency programming.” 2008. Web. 16 Oct 2018.

Vancouver:

Zimmerman JD. Model driven coordination framework for concurrency programming. [Internet] [Thesis]. Queensland University of Technology; 2008. [cited 2018 Oct 16]. Available from: https://eprints.qut.edu.au/16613/.

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

Council of Science Editors:

Zimmerman JD. Model driven coordination framework for concurrency programming. [Thesis]. Queensland University of Technology; 2008. Available from: https://eprints.qut.edu.au/16613/

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


University of Illinois – Urbana-Champaign

28. Qi, Shanxiang. Techniques to detect and avert advanced software concurrency bugs.

Degree: PhD, 0112, 2013, University of Illinois – Urbana-Champaign

 Multicore machines have become pervasive and, as a result, parallel programming has received renewed interest. Unfortunately, writing correct parallel programs is notoriously hard. One challenging… (more)

Subjects/Keywords: concurrency bugs; data race detection; dynamic analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Qi, S. (2013). Techniques to detect and avert advanced software concurrency bugs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/45603

Chicago Manual of Style (16th Edition):

Qi, Shanxiang. “Techniques to detect and avert advanced software concurrency bugs.” 2013. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed October 16, 2018. http://hdl.handle.net/2142/45603.

MLA Handbook (7th Edition):

Qi, Shanxiang. “Techniques to detect and avert advanced software concurrency bugs.” 2013. Web. 16 Oct 2018.

Vancouver:

Qi S. Techniques to detect and avert advanced software concurrency bugs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2013. [cited 2018 Oct 16]. Available from: http://hdl.handle.net/2142/45603.

Council of Science Editors:

Qi S. Techniques to detect and avert advanced software concurrency bugs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/45603


University of Illinois – Urbana-Champaign

29. Qi, Shanxiang. Tolerating asymmetric data races with minimal hardware support.

Degree: MS, 0112, 2010, University of Illinois – Urbana-Champaign

 Data races are a common type of concurrency bug in parallel programs. An important type of race that has not received much attention is Asymmetric… (more)

Subjects/Keywords: computer architecture; software reliability; concurrency bugs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Qi, S. (2010). Tolerating asymmetric data races with minimal hardware support. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/15995

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

Qi, Shanxiang. “Tolerating asymmetric data races with minimal hardware support.” 2010. Thesis, University of Illinois – Urbana-Champaign. Accessed October 16, 2018. http://hdl.handle.net/2142/15995.

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

MLA Handbook (7th Edition):

Qi, Shanxiang. “Tolerating asymmetric data races with minimal hardware support.” 2010. Web. 16 Oct 2018.

Vancouver:

Qi S. Tolerating asymmetric data races with minimal hardware support. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2010. [cited 2018 Oct 16]. Available from: http://hdl.handle.net/2142/15995.

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

Council of Science Editors:

Qi S. Tolerating asymmetric data races with minimal hardware support. [Thesis]. University of Illinois – Urbana-Champaign; 2010. Available from: http://hdl.handle.net/2142/15995

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


University of Illinois – Urbana-Champaign

30. Seo, Eun Soo. Failure diagnosis in distributed systems.

Degree: PhD, 0112, 2012, University of Illinois – Urbana-Champaign

 Failures in computing systems are unavoidable. Therefore, it is important to detect and diagnose failures early to improve the reliability of systems. In this dissertation,… (more)

Subjects/Keywords: Debugging; Bug Diagnosis; Concurrency Bugs; Error Propagation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Seo, E. S. (2012). Failure diagnosis in distributed systems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/34467

Chicago Manual of Style (16th Edition):

Seo, Eun Soo. “Failure diagnosis in distributed systems.” 2012. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed October 16, 2018. http://hdl.handle.net/2142/34467.

MLA Handbook (7th Edition):

Seo, Eun Soo. “Failure diagnosis in distributed systems.” 2012. Web. 16 Oct 2018.

Vancouver:

Seo ES. Failure diagnosis in distributed systems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2012. [cited 2018 Oct 16]. Available from: http://hdl.handle.net/2142/34467.

Council of Science Editors:

Seo ES. Failure diagnosis in distributed systems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2012. Available from: http://hdl.handle.net/2142/34467

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

.