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:(Lock Tree). Showing records 1 – 5 of 5 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Toronto

1. Brown, Trevor Alexander. Techniques for Constructing Efficient Lock-free Data Structures.

Degree: PhD, 2017, University of Toronto

 Building a library of concurrent data structures is an essential way to simplify the difficult task of developing concurrent software. Lock-free data structures, in which… (more)

Subjects/Keywords: Balanced search tree; Concurrency; Data structure; Lock-free; Lock-freedom; Multithreading; 0984

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brown, T. A. (2017). Techniques for Constructing Efficient Lock-free Data Structures. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/80693

Chicago Manual of Style (16th Edition):

Brown, Trevor Alexander. “Techniques for Constructing Efficient Lock-free Data Structures.” 2017. Doctoral Dissertation, University of Toronto. Accessed May 09, 2021. http://hdl.handle.net/1807/80693.

MLA Handbook (7th Edition):

Brown, Trevor Alexander. “Techniques for Constructing Efficient Lock-free Data Structures.” 2017. Web. 09 May 2021.

Vancouver:

Brown TA. Techniques for Constructing Efficient Lock-free Data Structures. [Internet] [Doctoral dissertation]. University of Toronto; 2017. [cited 2021 May 09]. Available from: http://hdl.handle.net/1807/80693.

Council of Science Editors:

Brown TA. Techniques for Constructing Efficient Lock-free Data Structures. [Doctoral Dissertation]. University of Toronto; 2017. Available from: http://hdl.handle.net/1807/80693


Delft University of Technology

2. Huijsman, Nino (author). Analysis of piping at hydraulic structures through an event tree approach.

Degree: 2020, Delft University of Technology

 The Netherlands has always been threatened by water. To protect flood-prone areas flood defenses have been constructed. To guarantee that they keep meeting the requirements… (more)

Subjects/Keywords: Piping; Hydraulic Structures; Event Tree; Fault Tree; Structural Failure; WBI 2017; Chamber Lock; Primary Flood Defenses; Probabilisitic Analysis; Risk Analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Huijsman, N. (. (2020). Analysis of piping at hydraulic structures through an event tree approach. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:26b83ddb-82b7-4713-96da-71685974ac82

Chicago Manual of Style (16th Edition):

Huijsman, Nino (author). “Analysis of piping at hydraulic structures through an event tree approach.” 2020. Masters Thesis, Delft University of Technology. Accessed May 09, 2021. http://resolver.tudelft.nl/uuid:26b83ddb-82b7-4713-96da-71685974ac82.

MLA Handbook (7th Edition):

Huijsman, Nino (author). “Analysis of piping at hydraulic structures through an event tree approach.” 2020. Web. 09 May 2021.

Vancouver:

Huijsman N(. Analysis of piping at hydraulic structures through an event tree approach. [Internet] [Masters thesis]. Delft University of Technology; 2020. [cited 2021 May 09]. Available from: http://resolver.tudelft.nl/uuid:26b83ddb-82b7-4713-96da-71685974ac82.

Council of Science Editors:

Huijsman N(. Analysis of piping at hydraulic structures through an event tree approach. [Masters Thesis]. Delft University of Technology; 2020. Available from: http://resolver.tudelft.nl/uuid:26b83ddb-82b7-4713-96da-71685974ac82


University of Alabama

3. Islam, Md Ashfakul. Database consistency in cloud databases.

Degree: 2013, University of Alabama

 Cloud storage service is currently becoming a very popular solution for medium-sized and startup companies. However, there are still few suitable solutions being offered to… (more)

Subjects/Keywords: Electronic Thesis or Dissertation;  – thesis; Computer science; Auto Scaling; Cloud Database; Consistency; Database Transaction; Lock Tree; Serializability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Islam, M. A. (2013). Database consistency in cloud databases. (Thesis). University of Alabama. Retrieved from http://purl.lib.ua.edu/89978

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

Islam, Md Ashfakul. “Database consistency in cloud databases.” 2013. Thesis, University of Alabama. Accessed May 09, 2021. http://purl.lib.ua.edu/89978.

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

MLA Handbook (7th Edition):

Islam, Md Ashfakul. “Database consistency in cloud databases.” 2013. Web. 09 May 2021.

Vancouver:

Islam MA. Database consistency in cloud databases. [Internet] [Thesis]. University of Alabama; 2013. [cited 2021 May 09]. Available from: http://purl.lib.ua.edu/89978.

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

Council of Science Editors:

Islam MA. Database consistency in cloud databases. [Thesis]. University of Alabama; 2013. Available from: http://purl.lib.ua.edu/89978

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

4. McKenzie, Marlon. Creating a Concurrent In-Memory B-Tree Optimized for NUMA Systems.

Degree: 2015, University of Waterloo

 The size of main memory is becoming larger. With the number of Central Processing Unit (CPU) cores ever increasing in modern systems, with each of… (more)

Subjects/Keywords: B-Tree; in-memory; distributed computing; concurrency control; locking; lock-free; NUMA; replication

…locking and the performance of the tree based on the workload. • It introduces Lock-Free Read… …operations within the b-tree by considering Lock-Free and architecture aware techniques. To improve… …locking a single key-value pair, locks in the B-Tree can also be used to lock a set, or range… …contents of the B-Tree, a lock can protect from as little as one key up to a broad range of key… …implement a Lock-Free, balanced B+ -Tree using the basic CAS operation and a method for ensuring a… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

McKenzie, M. (2015). Creating a Concurrent In-Memory B-Tree Optimized for NUMA Systems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/9659

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

McKenzie, Marlon. “Creating a Concurrent In-Memory B-Tree Optimized for NUMA Systems.” 2015. Thesis, University of Waterloo. Accessed May 09, 2021. http://hdl.handle.net/10012/9659.

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

MLA Handbook (7th Edition):

McKenzie, Marlon. “Creating a Concurrent In-Memory B-Tree Optimized for NUMA Systems.” 2015. Web. 09 May 2021.

Vancouver:

McKenzie M. Creating a Concurrent In-Memory B-Tree Optimized for NUMA Systems. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2021 May 09]. Available from: http://hdl.handle.net/10012/9659.

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

Council of Science Editors:

McKenzie M. Creating a Concurrent In-Memory B-Tree Optimized for NUMA Systems. [Thesis]. University of Waterloo; 2015. Available from: http://hdl.handle.net/10012/9659

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


York University

5. Shafiei, Niloufar. Non-Blocking Data Structures Handling Multiple Changes Atomically.

Degree: PhD, Computer Science, 2015, York University

 Here, we propose a new approach to design non-blocking algorithms that can apply multiple changes to a shared data structure atomically using Compare&Swap (CAS) instructions.… (more)

Subjects/Keywords: Computer science; Engineering; computer science; shared memory; data structure; shared data structure; concurrent data structure; concurrency; list; linked list; doubly-linked list; Patricia trie; tree; binary tree; non-blocking; wait-free; lock-free; distributed computing; distributed system; complexity; analysis; amortized analysis; cursor; descriptor; info object; descriptor object; non-blocking data structure; empirical evaluation; experiments; correctness proof; proof; potential function; general approach; multiple changes; linearizable; linearizability; correctness condition; performance; abstract data structure; trie; novel sequential specification; sequential specification; black box; modular approach; modular; sequence; sequence of items; replace operation; point contention; quadtree; GIS; Geographic Information System; general technique; help; helping mechanism; robust; robust cursor; sorted; sorted list; ordered list; active cursor; multi-core system; multi-core; multicore machine; uniformly distributed keys; non-uniformly distributed keys; move; move operation; update operation; move cursor; algorithm; distributed algorithm; implementation; non-blocking implementation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shafiei, N. (2015). Non-Blocking Data Structures Handling Multiple Changes Atomically. (Doctoral Dissertation). York University. Retrieved from http://hdl.handle.net/10315/30672

Chicago Manual of Style (16th Edition):

Shafiei, Niloufar. “Non-Blocking Data Structures Handling Multiple Changes Atomically.” 2015. Doctoral Dissertation, York University. Accessed May 09, 2021. http://hdl.handle.net/10315/30672.

MLA Handbook (7th Edition):

Shafiei, Niloufar. “Non-Blocking Data Structures Handling Multiple Changes Atomically.” 2015. Web. 09 May 2021.

Vancouver:

Shafiei N. Non-Blocking Data Structures Handling Multiple Changes Atomically. [Internet] [Doctoral dissertation]. York University; 2015. [cited 2021 May 09]. Available from: http://hdl.handle.net/10315/30672.

Council of Science Editors:

Shafiei N. Non-Blocking Data Structures Handling Multiple Changes Atomically. [Doctoral Dissertation]. York University; 2015. Available from: http://hdl.handle.net/10315/30672

.