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:(Concurrent Data Structures). Showing records 1 – 13 of 13 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters

1. Aksenov, Vitalii. Synchronization costs in parallel programs and concurrent data structures : Coûts de synchronization dans les programmes parallèlles et les structures de données simultanées.

Degree: Docteur es, Informatique. Programmation simultanée, 2018, Sorbonne Paris Cité; ITMO University

Pour utiliser la puissance de calcul des ordinateurs modernes, nous devons écrire des programmes concurrents. L’écriture de programme concurrent efficace est notoirement difficile, principalement en… (more)

Subjects/Keywords: Structures de données simultanées; Contrôle de la granularité; Programme concurrent; Concurrent data structures; Granularity control; Concurrent programs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Aksenov, V. (2018). Synchronization costs in parallel programs and concurrent data structures : Coûts de synchronization dans les programmes parallèlles et les structures de données simultanées. (Doctoral Dissertation). Sorbonne Paris Cité; ITMO University. Retrieved from http://www.theses.fr/2018USPCC025

Chicago Manual of Style (16th Edition):

Aksenov, Vitalii. “Synchronization costs in parallel programs and concurrent data structures : Coûts de synchronization dans les programmes parallèlles et les structures de données simultanées.” 2018. Doctoral Dissertation, Sorbonne Paris Cité; ITMO University. Accessed December 06, 2019. http://www.theses.fr/2018USPCC025.

MLA Handbook (7th Edition):

Aksenov, Vitalii. “Synchronization costs in parallel programs and concurrent data structures : Coûts de synchronization dans les programmes parallèlles et les structures de données simultanées.” 2018. Web. 06 Dec 2019.

Vancouver:

Aksenov V. Synchronization costs in parallel programs and concurrent data structures : Coûts de synchronization dans les programmes parallèlles et les structures de données simultanées. [Internet] [Doctoral dissertation]. Sorbonne Paris Cité; ITMO University; 2018. [cited 2019 Dec 06]. Available from: http://www.theses.fr/2018USPCC025.

Council of Science Editors:

Aksenov V. Synchronization costs in parallel programs and concurrent data structures : Coûts de synchronization dans les programmes parallèlles et les structures de données simultanées. [Doctoral Dissertation]. Sorbonne Paris Cité; ITMO University; 2018. Available from: http://www.theses.fr/2018USPCC025


EPFL

2. David, Tudor Alexandru. Universally Scalable Concurrent Data Structures.

Degree: 2017, EPFL

 The increase in the number of cores in processors has been an important trend over the past decade. In order to be able to efficiently… (more)

Subjects/Keywords: Concurrent data structures; multi-core; transactions; scalability; performance; non-volatile RAM

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

David, T. A. (2017). Universally Scalable Concurrent Data Structures. (Thesis). EPFL. Retrieved from http://infoscience.epfl.ch/record/231157

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

David, Tudor Alexandru. “Universally Scalable Concurrent Data Structures.” 2017. Thesis, EPFL. Accessed December 06, 2019. http://infoscience.epfl.ch/record/231157.

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

MLA Handbook (7th Edition):

David, Tudor Alexandru. “Universally Scalable Concurrent Data Structures.” 2017. Web. 06 Dec 2019.

Vancouver:

David TA. Universally Scalable Concurrent Data Structures. [Internet] [Thesis]. EPFL; 2017. [cited 2019 Dec 06]. Available from: http://infoscience.epfl.ch/record/231157.

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

Council of Science Editors:

David TA. Universally Scalable Concurrent Data Structures. [Thesis]. EPFL; 2017. Available from: http://infoscience.epfl.ch/record/231157

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

3. Papadopoulos, Lazaros. Μεθοδολογία παραμετροποίησης εφαρμογών βασισμένων σε ταυτόχρονες δομές δεδομένων για ενσωματωμένα συστήματα.

Degree: 2016, National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ)

Modern embedded system architectures integrate multiple cores and they often execute applications that rely on concurrent data structures. The selection of an efficient concurrent data(more)

Subjects/Keywords: Ταυτόχρονες Δομές Δεδομένων; Ενσωματωμένα συστήματα; Concurrent Data Structures; Embedded systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Papadopoulos, L. (2016). Μεθοδολογία παραμετροποίησης εφαρμογών βασισμένων σε ταυτόχρονες δομές δεδομένων για ενσωματωμένα συστήματα. (Thesis). National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ). Retrieved from http://hdl.handle.net/10442/hedi/38650

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

Papadopoulos, Lazaros. “Μεθοδολογία παραμετροποίησης εφαρμογών βασισμένων σε ταυτόχρονες δομές δεδομένων για ενσωματωμένα συστήματα.” 2016. Thesis, National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ). Accessed December 06, 2019. http://hdl.handle.net/10442/hedi/38650.

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

MLA Handbook (7th Edition):

Papadopoulos, Lazaros. “Μεθοδολογία παραμετροποίησης εφαρμογών βασισμένων σε ταυτόχρονες δομές δεδομένων για ενσωματωμένα συστήματα.” 2016. Web. 06 Dec 2019.

Vancouver:

Papadopoulos L. Μεθοδολογία παραμετροποίησης εφαρμογών βασισμένων σε ταυτόχρονες δομές δεδομένων για ενσωματωμένα συστήματα. [Internet] [Thesis]. National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); 2016. [cited 2019 Dec 06]. Available from: http://hdl.handle.net/10442/hedi/38650.

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

Council of Science Editors:

Papadopoulos L. Μεθοδολογία παραμετροποίησης εφαρμογών βασισμένων σε ταυτόχρονες δομές δεδομένων για ενσωματωμένα συστήματα. [Thesis]. National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); 2016. Available from: http://hdl.handle.net/10442/hedi/38650

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

4. Kanellou, Eleni. Data structures for current multi-core and future many-core architectures : Structures de données pour des architectures multi-cœur actuelles et de futures architectures many-cœur.

Degree: Docteur es, Informatique, 2015, Rennes 1

Actuellement, la majorité des architectures de processeurs sont fondées sur une mémoire partagée avec cohérence de caches. Des prototypes intégrant de grandes quantités de cœurs,… (more)

Subjects/Keywords: Mémoire transactionnelle logicielle; Programmation concurrente; Structures de données; Structures de données (informatique); Stm; Concurrent programming; Data structures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kanellou, E. (2015). Data structures for current multi-core and future many-core architectures : Structures de données pour des architectures multi-cœur actuelles et de futures architectures many-cœur. (Doctoral Dissertation). Rennes 1. Retrieved from http://www.theses.fr/2015REN1S171

Chicago Manual of Style (16th Edition):

Kanellou, Eleni. “Data structures for current multi-core and future many-core architectures : Structures de données pour des architectures multi-cœur actuelles et de futures architectures many-cœur.” 2015. Doctoral Dissertation, Rennes 1. Accessed December 06, 2019. http://www.theses.fr/2015REN1S171.

MLA Handbook (7th Edition):

Kanellou, Eleni. “Data structures for current multi-core and future many-core architectures : Structures de données pour des architectures multi-cœur actuelles et de futures architectures many-cœur.” 2015. Web. 06 Dec 2019.

Vancouver:

Kanellou E. Data structures for current multi-core and future many-core architectures : Structures de données pour des architectures multi-cœur actuelles et de futures architectures many-cœur. [Internet] [Doctoral dissertation]. Rennes 1; 2015. [cited 2019 Dec 06]. Available from: http://www.theses.fr/2015REN1S171.

Council of Science Editors:

Kanellou E. Data structures for current multi-core and future many-core architectures : Structures de données pour des architectures multi-cœur actuelles et de futures architectures many-cœur. [Doctoral Dissertation]. Rennes 1; 2015. Available from: http://www.theses.fr/2015REN1S171


University of California – Irvine

5. Ou, Peizhao. CDSSPEC: Testing Concurrent Data Structures Under the C/C++11 Memory Model.

Degree: Electrical and Computer Engineering, 2014, University of California – Irvine

Concurrent data structures often provide better performance on multi-core platforms, but are significantly more difficult to design and verify than their sequential counterparts. The C/C++11… (more)

Subjects/Keywords: Computer science; Computer engineering; C/C++11; Concurrent Data Structures; Memory Model; Testing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ou, P. (2014). CDSSPEC: Testing Concurrent Data Structures Under the C/C++11 Memory Model. (Thesis). University of California – Irvine. Retrieved from http://www.escholarship.org/uc/item/93s3701k

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

Ou, Peizhao. “CDSSPEC: Testing Concurrent Data Structures Under the C/C++11 Memory Model.” 2014. Thesis, University of California – Irvine. Accessed December 06, 2019. http://www.escholarship.org/uc/item/93s3701k.

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

MLA Handbook (7th Edition):

Ou, Peizhao. “CDSSPEC: Testing Concurrent Data Structures Under the C/C++11 Memory Model.” 2014. Web. 06 Dec 2019.

Vancouver:

Ou P. CDSSPEC: Testing Concurrent Data Structures Under the C/C++11 Memory Model. [Internet] [Thesis]. University of California – Irvine; 2014. [cited 2019 Dec 06]. Available from: http://www.escholarship.org/uc/item/93s3701k.

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

Council of Science Editors:

Ou P. CDSSPEC: Testing Concurrent Data Structures Under the C/C++11 Memory Model. [Thesis]. University of California – Irvine; 2014. Available from: http://www.escholarship.org/uc/item/93s3701k

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

6. Crain, Tyler. On improving the ease of use of the software transactional memory abstraction : Faciliter l'utilisation des mémoires transactionnelles logicielles.

Degree: Docteur es, Informatique, 2013, Rennes 1

Les architectures multicœurs changent notre façon d'écrire des programmes. L'écriture de programmes concurrents est bien connue pour être difficile. Traditionnellement, l'utilisation de verrous (locks) permettant… (more)

Subjects/Keywords: Mémoire transactionnelle logicielle; STM; Programmation concurrente; Structures de données; Software transactional memory; STM; Concurrent programming; Data structures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Crain, T. (2013). On improving the ease of use of the software transactional memory abstraction : Faciliter l'utilisation des mémoires transactionnelles logicielles. (Doctoral Dissertation). Rennes 1. Retrieved from http://www.theses.fr/2013REN1S022

Chicago Manual of Style (16th Edition):

Crain, Tyler. “On improving the ease of use of the software transactional memory abstraction : Faciliter l'utilisation des mémoires transactionnelles logicielles.” 2013. Doctoral Dissertation, Rennes 1. Accessed December 06, 2019. http://www.theses.fr/2013REN1S022.

MLA Handbook (7th Edition):

Crain, Tyler. “On improving the ease of use of the software transactional memory abstraction : Faciliter l'utilisation des mémoires transactionnelles logicielles.” 2013. Web. 06 Dec 2019.

Vancouver:

Crain T. On improving the ease of use of the software transactional memory abstraction : Faciliter l'utilisation des mémoires transactionnelles logicielles. [Internet] [Doctoral dissertation]. Rennes 1; 2013. [cited 2019 Dec 06]. Available from: http://www.theses.fr/2013REN1S022.

Council of Science Editors:

Crain T. On improving the ease of use of the software transactional memory abstraction : Faciliter l'utilisation des mémoires transactionnelles logicielles. [Doctoral Dissertation]. Rennes 1; 2013. Available from: http://www.theses.fr/2013REN1S022


University of North Texas

7. John, Ajita. Linearly Ordered Concurrent Data Structures on Hypercubes.

Degree: 1992, University of North Texas

 This thesis presents a simple method for the concurrent manipulation of linearly ordered data structures on hypercubes. The method is based on the existence of… (more)

Subjects/Keywords: linearly ordered data structures; hypercubes; concurrent manipulation; Hypercube.; Data structures (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

John, A. (1992). Linearly Ordered Concurrent Data Structures on Hypercubes. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc501197/

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

John, Ajita. “Linearly Ordered Concurrent Data Structures on Hypercubes.” 1992. Thesis, University of North Texas. Accessed December 06, 2019. https://digital.library.unt.edu/ark:/67531/metadc501197/.

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

MLA Handbook (7th Edition):

John, Ajita. “Linearly Ordered Concurrent Data Structures on Hypercubes.” 1992. Web. 06 Dec 2019.

Vancouver:

John A. Linearly Ordered Concurrent Data Structures on Hypercubes. [Internet] [Thesis]. University of North Texas; 1992. [cited 2019 Dec 06]. Available from: https://digital.library.unt.edu/ark:/67531/metadc501197/.

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

Council of Science Editors:

John A. Linearly Ordered Concurrent Data Structures on Hypercubes. [Thesis]. University of North Texas; 1992. Available from: https://digital.library.unt.edu/ark:/67531/metadc501197/

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


Lehigh University

8. Liu, Yujie. Crafting Concurrent Data Structures.

Degree: PhD, Computer Science, 2015, Lehigh University

Concurrent data structures lie at the heart of modern parallel programs. The design and implementation of concurrent data structures can be challenging due to the… (more)

Subjects/Keywords: Concurrent data structures; Hash tables; Linked lists; Lock-freedom; Priority queues; Computer Sciences; Physical Sciences and Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, Y. (2015). Crafting Concurrent Data Structures. (Doctoral Dissertation). Lehigh University. Retrieved from https://preserve.lehigh.edu/etd/2690

Chicago Manual of Style (16th Edition):

Liu, Yujie. “Crafting Concurrent Data Structures.” 2015. Doctoral Dissertation, Lehigh University. Accessed December 06, 2019. https://preserve.lehigh.edu/etd/2690.

MLA Handbook (7th Edition):

Liu, Yujie. “Crafting Concurrent Data Structures.” 2015. Web. 06 Dec 2019.

Vancouver:

Liu Y. Crafting Concurrent Data Structures. [Internet] [Doctoral dissertation]. Lehigh University; 2015. [cited 2019 Dec 06]. Available from: https://preserve.lehigh.edu/etd/2690.

Council of Science Editors:

Liu Y. Crafting Concurrent Data Structures. [Doctoral Dissertation]. Lehigh University; 2015. Available from: https://preserve.lehigh.edu/etd/2690


Rice University

9. Yang, Chaoran. Runtime Technologies of High Performance Parallel Computing.

Degree: PhD, Engineering, 2016, Rice University

 Due to power constraints, future growth in computing capability must explicitly leverage parallelism in software to effectively exploit hardware parallelism found in both distributed and… (more)

Subjects/Keywords: Runtime Technologies; High Performance Computing; Parallel Computing; Partitioned Global Address Space; Work-stealing; Concurrent Data Structures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yang, C. (2016). Runtime Technologies of High Performance Parallel Computing. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/95637

Chicago Manual of Style (16th Edition):

Yang, Chaoran. “Runtime Technologies of High Performance Parallel Computing.” 2016. Doctoral Dissertation, Rice University. Accessed December 06, 2019. http://hdl.handle.net/1911/95637.

MLA Handbook (7th Edition):

Yang, Chaoran. “Runtime Technologies of High Performance Parallel Computing.” 2016. Web. 06 Dec 2019.

Vancouver:

Yang C. Runtime Technologies of High Performance Parallel Computing. [Internet] [Doctoral dissertation]. Rice University; 2016. [cited 2019 Dec 06]. Available from: http://hdl.handle.net/1911/95637.

Council of Science Editors:

Yang C. Runtime Technologies of High Performance Parallel Computing. [Doctoral Dissertation]. Rice University; 2016. Available from: http://hdl.handle.net/1911/95637


EPFL

10. Alistarh, Dan. Randomized versus Deterministic Implementations of Concurrent Data Structures.

Degree: 2012, EPFL

 One of the key trends in computing over the past two decades has been increased distribution, both at the processor level, where multi-core architectures are… (more)

Subjects/Keywords: concurrent algorithms; shared memory; data structures; renaming; randomization; lower bounds; algorithmes concurrents; mémoire partagée; structures de données; renommage; méthodes probabilistes; bornes inférieures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Alistarh, D. (2012). Randomized versus Deterministic Implementations of Concurrent Data Structures. (Thesis). EPFL. Retrieved from http://infoscience.epfl.ch/record/180633

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

Alistarh, Dan. “Randomized versus Deterministic Implementations of Concurrent Data Structures.” 2012. Thesis, EPFL. Accessed December 06, 2019. http://infoscience.epfl.ch/record/180633.

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

MLA Handbook (7th Edition):

Alistarh, Dan. “Randomized versus Deterministic Implementations of Concurrent Data Structures.” 2012. Web. 06 Dec 2019.

Vancouver:

Alistarh D. Randomized versus Deterministic Implementations of Concurrent Data Structures. [Internet] [Thesis]. EPFL; 2012. [cited 2019 Dec 06]. Available from: http://infoscience.epfl.ch/record/180633.

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

Council of Science Editors:

Alistarh D. Randomized versus Deterministic Implementations of Concurrent Data Structures. [Thesis]. EPFL; 2012. Available from: http://infoscience.epfl.ch/record/180633

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


Virginia Tech

11. Hassan, Ahmed Mohamed Elsayed. Designing, Modeling, and Optimizing Transactional Data Structures.

Degree: PhD, Electrical and Computer Engineering, 2015, Virginia Tech

 Transactional memory (TM) has emerged as a promising synchronization abstraction for multi-core architectures. Unlike traditional lock-based approaches, TM shifts the burden of implementing threads synchronization… (more)

Subjects/Keywords: Transactional Memory; STM; HTM; Transactional Boosting; Concurrent Data Structures; Optimistic Semantic Synchronization; Lazy List; Balanced Trees; Hybrid Transactions; Semantic Validation; Remote Transaction Commit; Modeling; Linearizability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hassan, A. M. E. (2015). Designing, Modeling, and Optimizing Transactional Data Structures. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/56656

Chicago Manual of Style (16th Edition):

Hassan, Ahmed Mohamed Elsayed. “Designing, Modeling, and Optimizing Transactional Data Structures.” 2015. Doctoral Dissertation, Virginia Tech. Accessed December 06, 2019. http://hdl.handle.net/10919/56656.

MLA Handbook (7th Edition):

Hassan, Ahmed Mohamed Elsayed. “Designing, Modeling, and Optimizing Transactional Data Structures.” 2015. Web. 06 Dec 2019.

Vancouver:

Hassan AME. Designing, Modeling, and Optimizing Transactional Data Structures. [Internet] [Doctoral dissertation]. Virginia Tech; 2015. [cited 2019 Dec 06]. Available from: http://hdl.handle.net/10919/56656.

Council of Science Editors:

Hassan AME. Designing, Modeling, and Optimizing Transactional Data Structures. [Doctoral Dissertation]. Virginia Tech; 2015. Available from: http://hdl.handle.net/10919/56656


EPFL

12. Prokopec, Aleksandar. Data Structures and Algorithms for Data-Parallel Computing in a Managed Runtime.

Degree: 2014, EPFL

Subjects/Keywords: parallel programming; data structures; data-parallelism; parallelization; concatenation; scheduling; atomic snapshots; concurrent data structures; persistent data structures; work-stealing; linearizability; lock-freedom

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Prokopec, A. (2014). Data Structures and Algorithms for Data-Parallel Computing in a Managed Runtime. (Thesis). EPFL. Retrieved from http://infoscience.epfl.ch/record/200977

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

Prokopec, Aleksandar. “Data Structures and Algorithms for Data-Parallel Computing in a Managed Runtime.” 2014. Thesis, EPFL. Accessed December 06, 2019. http://infoscience.epfl.ch/record/200977.

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

MLA Handbook (7th Edition):

Prokopec, Aleksandar. “Data Structures and Algorithms for Data-Parallel Computing in a Managed Runtime.” 2014. Web. 06 Dec 2019.

Vancouver:

Prokopec A. Data Structures and Algorithms for Data-Parallel Computing in a Managed Runtime. [Internet] [Thesis]. EPFL; 2014. [cited 2019 Dec 06]. Available from: http://infoscience.epfl.ch/record/200977.

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

Council of Science Editors:

Prokopec A. Data Structures and Algorithms for Data-Parallel Computing in a Managed Runtime. [Thesis]. EPFL; 2014. Available from: http://infoscience.epfl.ch/record/200977

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

13. Tacla Saad, Rodrigo. Parallel model checking for multiprocessor architecture : Model checking sur architecture multiprocesseur.

Degree: Docteur es, Sûreté de logiciel et calcul de haute performance, 2011, Toulouse, INSA

Nous proposons de nouveaux algorithmes et de nouvelles structures de données pour la vérification formelle de systèmes réactifs finis sur architectures parallèles. Ces travaux se… (more)

Subjects/Keywords: Model Checking en Parallèle; Vérification Formelle et Logiques Temporelles; Algorithme et Structure de Données concurrents; Méthode Formelle; Parallel Model Checking; Concurrent algorithms and data structures; Formal Verification and Temporal Logic; Formal Methods

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tacla Saad, R. (2011). Parallel model checking for multiprocessor architecture : Model checking sur architecture multiprocesseur. (Doctoral Dissertation). Toulouse, INSA. Retrieved from http://www.theses.fr/2011ISAT0028

Chicago Manual of Style (16th Edition):

Tacla Saad, Rodrigo. “Parallel model checking for multiprocessor architecture : Model checking sur architecture multiprocesseur.” 2011. Doctoral Dissertation, Toulouse, INSA. Accessed December 06, 2019. http://www.theses.fr/2011ISAT0028.

MLA Handbook (7th Edition):

Tacla Saad, Rodrigo. “Parallel model checking for multiprocessor architecture : Model checking sur architecture multiprocesseur.” 2011. Web. 06 Dec 2019.

Vancouver:

Tacla Saad R. Parallel model checking for multiprocessor architecture : Model checking sur architecture multiprocesseur. [Internet] [Doctoral dissertation]. Toulouse, INSA; 2011. [cited 2019 Dec 06]. Available from: http://www.theses.fr/2011ISAT0028.

Council of Science Editors:

Tacla Saad R. Parallel model checking for multiprocessor architecture : Model checking sur architecture multiprocesseur. [Doctoral Dissertation]. Toulouse, INSA; 2011. Available from: http://www.theses.fr/2011ISAT0028

.