Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(distributed memory system). Showing records 1 – 24 of 24 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


NSYSU

1. Tseng, Guo-Fu. CDPthread: A POSIX-Thread Based Distributed Computing Environment.

Degree: Master, Computer Science and Engineering, 2009, NSYSU

 Due to the limitation of single machineâs computing power, and the aspect of cost, distributed design is getting more and more popular nowadays. The Distributed(more)

Subjects/Keywords: operating system; distributed system; POSIX; distributed shared memory; thread; multi-thread

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tseng, G. (2009). CDPthread: A POSIX-Thread Based Distributed Computing Environment. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0728109-115706

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, Guo-Fu. “CDPthread: A POSIX-Thread Based Distributed Computing Environment.” 2009. Thesis, NSYSU. Accessed October 14, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0728109-115706.

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

MLA Handbook (7th Edition):

Tseng, Guo-Fu. “CDPthread: A POSIX-Thread Based Distributed Computing Environment.” 2009. Web. 14 Oct 2019.

Vancouver:

Tseng G. CDPthread: A POSIX-Thread Based Distributed Computing Environment. [Internet] [Thesis]. NSYSU; 2009. [cited 2019 Oct 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0728109-115706.

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

Council of Science Editors:

Tseng G. CDPthread: A POSIX-Thread Based Distributed Computing Environment. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0728109-115706

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


Mississippi State University

2. Wang, Zimin. A MODEL-BASED APPROACH FOR AUTOMATIC RECOVERY FROM MEMORY LEAKS IN ENTERPRISE APPLICATIONS.

Degree: MS, Electrical and Computer Engineering, 2011, Mississippi State University

  Large-scale distributed computing systems such as data centers are hosted on heterogeneous and networked servers that execute in a dynamic and uncertain operating environment,… (more)

Subjects/Keywords: memory leak; limited lookahead control; distributed system; web server; fault management

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, Z. (2011). A MODEL-BASED APPROACH FOR AUTOMATIC RECOVERY FROM MEMORY LEAKS IN ENTERPRISE APPLICATIONS. (Masters Thesis). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-06182011-172817/ ;

Chicago Manual of Style (16th Edition):

Wang, Zimin. “A MODEL-BASED APPROACH FOR AUTOMATIC RECOVERY FROM MEMORY LEAKS IN ENTERPRISE APPLICATIONS.” 2011. Masters Thesis, Mississippi State University. Accessed October 14, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-06182011-172817/ ;.

MLA Handbook (7th Edition):

Wang, Zimin. “A MODEL-BASED APPROACH FOR AUTOMATIC RECOVERY FROM MEMORY LEAKS IN ENTERPRISE APPLICATIONS.” 2011. Web. 14 Oct 2019.

Vancouver:

Wang Z. A MODEL-BASED APPROACH FOR AUTOMATIC RECOVERY FROM MEMORY LEAKS IN ENTERPRISE APPLICATIONS. [Internet] [Masters thesis]. Mississippi State University; 2011. [cited 2019 Oct 14]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-06182011-172817/ ;.

Council of Science Editors:

Wang Z. A MODEL-BASED APPROACH FOR AUTOMATIC RECOVERY FROM MEMORY LEAKS IN ENTERPRISE APPLICATIONS. [Masters Thesis]. Mississippi State University; 2011. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-06182011-172817/ ;


Texas A&M University

3. Papadopoulos, Ioannis. STAPL-RTS: A Runtime System for Massive Parallelism.

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

 Modern High Performance Computing (HPC) systems are complex, with deep memory hierarchies and increasing use of computational heterogeneity via accelerators. When developing applications for these… (more)

Subjects/Keywords: parallel; runtime system; high performance; nested parallelism; asynchronous; shared memory; distributed memory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Papadopoulos, I. (2016). STAPL-RTS: A Runtime System for Massive Parallelism. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/156985

Chicago Manual of Style (16th Edition):

Papadopoulos, Ioannis. “STAPL-RTS: A Runtime System for Massive Parallelism.” 2016. Doctoral Dissertation, Texas A&M University. Accessed October 14, 2019. http://hdl.handle.net/1969.1/156985.

MLA Handbook (7th Edition):

Papadopoulos, Ioannis. “STAPL-RTS: A Runtime System for Massive Parallelism.” 2016. Web. 14 Oct 2019.

Vancouver:

Papadopoulos I. STAPL-RTS: A Runtime System for Massive Parallelism. [Internet] [Doctoral dissertation]. Texas A&M University; 2016. [cited 2019 Oct 14]. Available from: http://hdl.handle.net/1969.1/156985.

Council of Science Editors:

Papadopoulos I. STAPL-RTS: A Runtime System for Massive Parallelism. [Doctoral Dissertation]. Texas A&M University; 2016. Available from: http://hdl.handle.net/1969.1/156985


NSYSU

4. Chen, Chun-hung. Communication reduction problem in Schur complement method on distributed memory architecture.

Degree: Master, Applied Mathematics, 2018, NSYSU

 A common approach to solving a large sparse linear system in parallel is using the k-way partition method to relabel the variables and equations so… (more)

Subjects/Keywords: large sparse linear system; distributed memory system; k-way partition; Schur complement; parallel computation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, C. (2018). Communication reduction problem in Schur complement method on distributed memory architecture. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0030118-154212

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

Chicago Manual of Style (16th Edition):

Chen, Chun-hung. “Communication reduction problem in Schur complement method on distributed memory architecture.” 2018. Thesis, NSYSU. Accessed October 14, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0030118-154212.

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

MLA Handbook (7th Edition):

Chen, Chun-hung. “Communication reduction problem in Schur complement method on distributed memory architecture.” 2018. Web. 14 Oct 2019.

Vancouver:

Chen C. Communication reduction problem in Schur complement method on distributed memory architecture. [Internet] [Thesis]. NSYSU; 2018. [cited 2019 Oct 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0030118-154212.

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

Council of Science Editors:

Chen C. Communication reduction problem in Schur complement method on distributed memory architecture. [Thesis]. NSYSU; 2018. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0030118-154212

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

5. Farooq, Mohammad Habibur Rahman and Qaisar. Performance Prediction of Parallel Programs in a Linux Environment.

Degree: 2010, , School of Computing

Context. Today’s parallel systems are widely used in different computational tasks. Developing parallel programs to make maximum use of the computing power of parallel… (more)

Subjects/Keywords: VPPB; Pthreads; parallel programming; performance tuning; performance prediction; distributed memory system; shared memory system; Computer Sciences; Datavetenskap (datalogi)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Farooq, M. H. R. a. Q. (2010). Performance Prediction of Parallel Programs in a Linux Environment. (Thesis). , School of Computing. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:bth-1143

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

Farooq, Mohammad Habibur Rahman and Qaisar. “Performance Prediction of Parallel Programs in a Linux Environment.” 2010. Thesis, , School of Computing. Accessed October 14, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-1143.

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

MLA Handbook (7th Edition):

Farooq, Mohammad Habibur Rahman and Qaisar. “Performance Prediction of Parallel Programs in a Linux Environment.” 2010. Web. 14 Oct 2019.

Vancouver:

Farooq MHRaQ. Performance Prediction of Parallel Programs in a Linux Environment. [Internet] [Thesis]. , School of Computing; 2010. [cited 2019 Oct 14]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-1143.

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

Council of Science Editors:

Farooq MHRaQ. Performance Prediction of Parallel Programs in a Linux Environment. [Thesis]. , School of Computing; 2010. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-1143

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


Virginia Tech

6. Zhang, Bo. Supporting Software Transactional Memory in Distributed Systems: Protocols for Cache-Coherence, Conflict Resolution and Replication.

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

 Lock-based synchronization on multiprocessors is inherently non-scalable, non-composable, and error-prone. These problems are exacerbated in distributed systems due to an additional layer of complexity: multinode… (more)

Subjects/Keywords: Cache-Coherence; Distributed Queuing; Contention Management; Software Transactional Memory; Replication; Quorum System

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, B. (2011). Supporting Software Transactional Memory in Distributed Systems: Protocols for Cache-Coherence, Conflict Resolution and Replication. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/29571

Chicago Manual of Style (16th Edition):

Zhang, Bo. “Supporting Software Transactional Memory in Distributed Systems: Protocols for Cache-Coherence, Conflict Resolution and Replication.” 2011. Doctoral Dissertation, Virginia Tech. Accessed October 14, 2019. http://hdl.handle.net/10919/29571.

MLA Handbook (7th Edition):

Zhang, Bo. “Supporting Software Transactional Memory in Distributed Systems: Protocols for Cache-Coherence, Conflict Resolution and Replication.” 2011. Web. 14 Oct 2019.

Vancouver:

Zhang B. Supporting Software Transactional Memory in Distributed Systems: Protocols for Cache-Coherence, Conflict Resolution and Replication. [Internet] [Doctoral dissertation]. Virginia Tech; 2011. [cited 2019 Oct 14]. Available from: http://hdl.handle.net/10919/29571.

Council of Science Editors:

Zhang B. Supporting Software Transactional Memory in Distributed Systems: Protocols for Cache-Coherence, Conflict Resolution and Replication. [Doctoral Dissertation]. Virginia Tech; 2011. Available from: http://hdl.handle.net/10919/29571


EPFL

7. Kozhaya, David. Reliable and Real-Time Distributed Abstractions.

Degree: 2016, EPFL

 The celebrated distributed computing approach for building systems and services using multiple machines continues to expand to new domains. Computation devices nowadays have additional sensing… (more)

Subjects/Keywords: Distributed abstractions; probabilistic message loss; transmission policy; partially observable Markov decision problem; reliable links; failure detection; consensus; distributed control system; membership; distributed shared memory; real-time systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kozhaya, D. (2016). Reliable and Real-Time Distributed Abstractions. (Thesis). EPFL. Retrieved from http://infoscience.epfl.ch/record/223523

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

Kozhaya, David. “Reliable and Real-Time Distributed Abstractions.” 2016. Thesis, EPFL. Accessed October 14, 2019. http://infoscience.epfl.ch/record/223523.

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

MLA Handbook (7th Edition):

Kozhaya, David. “Reliable and Real-Time Distributed Abstractions.” 2016. Web. 14 Oct 2019.

Vancouver:

Kozhaya D. Reliable and Real-Time Distributed Abstractions. [Internet] [Thesis]. EPFL; 2016. [cited 2019 Oct 14]. Available from: http://infoscience.epfl.ch/record/223523.

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

Council of Science Editors:

Kozhaya D. Reliable and Real-Time Distributed Abstractions. [Thesis]. EPFL; 2016. Available from: http://infoscience.epfl.ch/record/223523

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


Indian Institute of Science

8. Srimugunthan, *. Efficient Usage Of Flash Memories In High Performance Scenarios.

Degree: 2012, Indian Institute of Science

 New PCI-e flash cards and SSDs supporting over 100,000 IOPs are now available, with several usecases in the design of a high performance storage system.… (more)

Subjects/Keywords: Flash Cards; Flash Memory Scaling; High Performance Computing; Distributed Flash Memories; Word Recognition; Flash Translation Layer (FTL); Distributed File System; Parallelism Flash Cards; Flash Cards - Garbage Collection; Flash Storage Nodes; Cluster Storage; Distributed Storage System; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Srimugunthan, *. (2012). Efficient Usage Of Flash Memories In High Performance Scenarios. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/2562

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

Srimugunthan, *. “Efficient Usage Of Flash Memories In High Performance Scenarios.” 2012. Thesis, Indian Institute of Science. Accessed October 14, 2019. http://hdl.handle.net/2005/2562.

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

MLA Handbook (7th Edition):

Srimugunthan, *. “Efficient Usage Of Flash Memories In High Performance Scenarios.” 2012. Web. 14 Oct 2019.

Vancouver:

Srimugunthan *. Efficient Usage Of Flash Memories In High Performance Scenarios. [Internet] [Thesis]. Indian Institute of Science; 2012. [cited 2019 Oct 14]. Available from: http://hdl.handle.net/2005/2562.

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

Council of Science Editors:

Srimugunthan *. Efficient Usage Of Flash Memories In High Performance Scenarios. [Thesis]. Indian Institute of Science; 2012. Available from: http://hdl.handle.net/2005/2562

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


Indian Institute of Science

9. Srimugunthan, *. Efficient Usage Of Flash Memories In High Performance Scenarios.

Degree: 2012, Indian Institute of Science

 New PCI-e flash cards and SSDs supporting over 100,000 IOPs are now available, with several usecases in the design of a high performance storage system.… (more)

Subjects/Keywords: Flash Cards; Flash Memory Scaling; High Performance Computing; Distributed Flash Memories; Word Recognition; Flash Translation Layer (FTL); Distributed File System; Parallelism Flash Cards; Flash Cards - Garbage Collection; Flash Storage Nodes; Cluster Storage; Distributed Storage System; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Srimugunthan, *. (2012). Efficient Usage Of Flash Memories In High Performance Scenarios. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/handle/2005/2562 ; http://etd.ncsi.iisc.ernet.in/abstracts/3329/G25746-Abs.pdf

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

Chicago Manual of Style (16th Edition):

Srimugunthan, *. “Efficient Usage Of Flash Memories In High Performance Scenarios.” 2012. Thesis, Indian Institute of Science. Accessed October 14, 2019. http://etd.iisc.ernet.in/handle/2005/2562 ; http://etd.ncsi.iisc.ernet.in/abstracts/3329/G25746-Abs.pdf.

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

MLA Handbook (7th Edition):

Srimugunthan, *. “Efficient Usage Of Flash Memories In High Performance Scenarios.” 2012. Web. 14 Oct 2019.

Vancouver:

Srimugunthan *. Efficient Usage Of Flash Memories In High Performance Scenarios. [Internet] [Thesis]. Indian Institute of Science; 2012. [cited 2019 Oct 14]. Available from: http://etd.iisc.ernet.in/handle/2005/2562 ; http://etd.ncsi.iisc.ernet.in/abstracts/3329/G25746-Abs.pdf.

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

Council of Science Editors:

Srimugunthan *. Efficient Usage Of Flash Memories In High Performance Scenarios. [Thesis]. Indian Institute of Science; 2012. Available from: http://etd.iisc.ernet.in/handle/2005/2562 ; http://etd.ncsi.iisc.ernet.in/abstracts/3329/G25746-Abs.pdf

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

10. Shao, Cheng. Multi-writer consistency conditions for shared memory objects.

Degree: 2009, Texas A&M University

 Regularity is a shared memory consistency condition that has received considerable attention, notably in connection with quorum-based shared memory. Lamport's original definition of regularity assumed… (more)

Subjects/Keywords: shared memory; distributed data structures; quorum system; regularity; consistency conditions

…systems. A consistency condition in a shared memory system is a set of constraints on values… …a high-cost implementation. Conversely, a shared memory system with a weak consistency… …local, it means that the whole shared memory system satisfies the consistency condition if and… …extend our results to a multivariable shared memory system. Atomicity ID, WB, LC ID, WB ID… …74 1 CHAPTER I INTRODUCTION A. Overview Distributed computer systems are ubiquitous… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shao, C. (2009). Multi-writer consistency conditions for shared memory objects. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2041

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

Shao, Cheng. “Multi-writer consistency conditions for shared memory objects.” 2009. Thesis, Texas A&M University. Accessed October 14, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2041.

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

MLA Handbook (7th Edition):

Shao, Cheng. “Multi-writer consistency conditions for shared memory objects.” 2009. Web. 14 Oct 2019.

Vancouver:

Shao C. Multi-writer consistency conditions for shared memory objects. [Internet] [Thesis]. Texas A&M University; 2009. [cited 2019 Oct 14]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2041.

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

Council of Science Editors:

Shao C. Multi-writer consistency conditions for shared memory objects. [Thesis]. Texas A&M University; 2009. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2041

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

11. Aivars, Sablis. Benefits of transactive memory systems in large-scale development.

Degree: 2016, , Department of Software Engineering

  Context. Large-scale software development projects are those consisting of a large number of teams, maybe even spread across multiple locations, and working on large… (more)

Subjects/Keywords: Large-scale; software development; transactive memory system; empirical study; multi-case study; knowledge management; TMS; team performance; distributed; global software engineering; expertise coordination;

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Aivars, S. (2016). Benefits of transactive memory systems in large-scale development. (Thesis). , Department of Software Engineering. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:bth-11703

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

Aivars, Sablis. “Benefits of transactive memory systems in large-scale development.” 2016. Thesis, , Department of Software Engineering. Accessed October 14, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-11703.

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

MLA Handbook (7th Edition):

Aivars, Sablis. “Benefits of transactive memory systems in large-scale development.” 2016. Web. 14 Oct 2019.

Vancouver:

Aivars S. Benefits of transactive memory systems in large-scale development. [Internet] [Thesis]. , Department of Software Engineering; 2016. [cited 2019 Oct 14]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-11703.

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

Council of Science Editors:

Aivars S. Benefits of transactive memory systems in large-scale development. [Thesis]. , Department of Software Engineering; 2016. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-11703

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


University of Hong Kong

12. Hong, Chao. Parallel processing in power systems computation on a distributed memory message passing multicomputer.

Degree: PhD, 2000, University of Hong Kong

published_or_final_version

Electrical and Electronic Engineering

Doctoral

Doctor of Philosophy

Subjects/Keywords: Electric power system stability.; Sparse matrices.; Distributed shared memory.; Parallel processing (Electronic computers)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hong, C. (2000). Parallel processing in power systems computation on a distributed memory message passing multicomputer. (Doctoral Dissertation). University of Hong Kong. Retrieved from Hong, C. [洪潮]. (2000). Parallel processing in power systems computation on a distributed memory message passing multicomputer. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3124032 ; http://dx.doi.org/10.5353/th_b3124032 ; http://hdl.handle.net/10722/35539

Chicago Manual of Style (16th Edition):

Hong, Chao. “Parallel processing in power systems computation on a distributed memory message passing multicomputer.” 2000. Doctoral Dissertation, University of Hong Kong. Accessed October 14, 2019. Hong, C. [洪潮]. (2000). Parallel processing in power systems computation on a distributed memory message passing multicomputer. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3124032 ; http://dx.doi.org/10.5353/th_b3124032 ; http://hdl.handle.net/10722/35539.

MLA Handbook (7th Edition):

Hong, Chao. “Parallel processing in power systems computation on a distributed memory message passing multicomputer.” 2000. Web. 14 Oct 2019.

Vancouver:

Hong C. Parallel processing in power systems computation on a distributed memory message passing multicomputer. [Internet] [Doctoral dissertation]. University of Hong Kong; 2000. [cited 2019 Oct 14]. Available from: Hong, C. [洪潮]. (2000). Parallel processing in power systems computation on a distributed memory message passing multicomputer. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3124032 ; http://dx.doi.org/10.5353/th_b3124032 ; http://hdl.handle.net/10722/35539.

Council of Science Editors:

Hong C. Parallel processing in power systems computation on a distributed memory message passing multicomputer. [Doctoral Dissertation]. University of Hong Kong; 2000. Available from: Hong, C. [洪潮]. (2000). Parallel processing in power systems computation on a distributed memory message passing multicomputer. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3124032 ; http://dx.doi.org/10.5353/th_b3124032 ; http://hdl.handle.net/10722/35539


Kyoto University

13. Yanagisawa, Nayuta. Wait-free Solvability of Colorless Tasks in Anonymous Shared-memory Model .

Degree: 2018, Kyoto University

Subjects/Keywords: Distributed computing; Shared-memory; Wait-free computability; Anonymous system; Colorless task; Topology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yanagisawa, N. (2018). Wait-free Solvability of Colorless Tasks in Anonymous Shared-memory Model . (Thesis). Kyoto University. Retrieved from http://hdl.handle.net/2433/232218

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

Yanagisawa, Nayuta. “Wait-free Solvability of Colorless Tasks in Anonymous Shared-memory Model .” 2018. Thesis, Kyoto University. Accessed October 14, 2019. http://hdl.handle.net/2433/232218.

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

MLA Handbook (7th Edition):

Yanagisawa, Nayuta. “Wait-free Solvability of Colorless Tasks in Anonymous Shared-memory Model .” 2018. Web. 14 Oct 2019.

Vancouver:

Yanagisawa N. Wait-free Solvability of Colorless Tasks in Anonymous Shared-memory Model . [Internet] [Thesis]. Kyoto University; 2018. [cited 2019 Oct 14]. Available from: http://hdl.handle.net/2433/232218.

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

Council of Science Editors:

Yanagisawa N. Wait-free Solvability of Colorless Tasks in Anonymous Shared-memory Model . [Thesis]. Kyoto University; 2018. Available from: http://hdl.handle.net/2433/232218

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


University of Waterloo

14. Demaine, Erik. Effcient Simulation of Message-Passing in Distributed-Memory Architectures.

Degree: 1996, University of Waterloo

 In this thesis we propose a distributed-memory parallel-computer simulation system called PUPPET (Performance Under a Pseudo-Parallel EnvironmenT). It allows the evaluation of parallel programs run… (more)

Subjects/Keywords: Computer Science; distributed-memory; parallel-computer; simulation; system; Performance; Pseudo-Parallel; Environment

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Demaine, E. (1996). Effcient Simulation of Message-Passing in Distributed-Memory Architectures. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/1069

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

Demaine, Erik. “Effcient Simulation of Message-Passing in Distributed-Memory Architectures.” 1996. Thesis, University of Waterloo. Accessed October 14, 2019. http://hdl.handle.net/10012/1069.

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

MLA Handbook (7th Edition):

Demaine, Erik. “Effcient Simulation of Message-Passing in Distributed-Memory Architectures.” 1996. Web. 14 Oct 2019.

Vancouver:

Demaine E. Effcient Simulation of Message-Passing in Distributed-Memory Architectures. [Internet] [Thesis]. University of Waterloo; 1996. [cited 2019 Oct 14]. Available from: http://hdl.handle.net/10012/1069.

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

Council of Science Editors:

Demaine E. Effcient Simulation of Message-Passing in Distributed-Memory Architectures. [Thesis]. University of Waterloo; 1996. Available from: http://hdl.handle.net/10012/1069

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

15. Shafiee Sarjaz, Behrooz. Behrooz File System (BFS).

Degree: 2015, University of Waterloo

 In this thesis, the Behrooz File System (BFS) is presented, which provides an in-memory distributed file system. BFS is a simple design which combines the… (more)

Subjects/Keywords: File system; Distributed; In-memory; POSIX; ZooKeeper; FUSE

memory of many servers is aggregated to create a large-scale storage system. In order to… …provides strong consistency, or a modern distributed file system that provides high availability… …fact, in this case BFS performs similar to an in-memory file system since files are mainly… …permanently. 2.2 System Overview BFS aggregates the main memory of several machines (BFS… …other distributed file systems, use a DHT system known as Consistent Hashing [27]… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shafiee Sarjaz, B. (2015). Behrooz File System (BFS). (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/9579

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

Shafiee Sarjaz, Behrooz. “Behrooz File System (BFS).” 2015. Thesis, University of Waterloo. Accessed October 14, 2019. http://hdl.handle.net/10012/9579.

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

MLA Handbook (7th Edition):

Shafiee Sarjaz, Behrooz. “Behrooz File System (BFS).” 2015. Web. 14 Oct 2019.

Vancouver:

Shafiee Sarjaz B. Behrooz File System (BFS). [Internet] [Thesis]. University of Waterloo; 2015. [cited 2019 Oct 14]. Available from: http://hdl.handle.net/10012/9579.

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

Council of Science Editors:

Shafiee Sarjaz B. Behrooz File System (BFS). [Thesis]. University of Waterloo; 2015. Available from: http://hdl.handle.net/10012/9579

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


Deakin University

16. Silcock, J. Programmer friendly and efficient distributed shared memory integrated into a distributed operating system.

Degree: School of Computing and Mathematics, 1998, Deakin University

Distributed Shared Memory (DSM) provides programmers with a shared memory environment in systems where memory is not physically shared. Clusters of Workstations (COWs), an often… (more)

Subjects/Keywords: Distributed operating systems (Computers); Electronic data processing - Distributed systems - Design; Memory management (Computer science); RHODOS (Computer system)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Silcock, J. (1998). Programmer friendly and efficient distributed shared memory integrated into a distributed operating system. (Thesis). Deakin University. Retrieved from http://hdl.handle.net/10536/DRO/DU:30023433

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

Silcock, J. “Programmer friendly and efficient distributed shared memory integrated into a distributed operating system.” 1998. Thesis, Deakin University. Accessed October 14, 2019. http://hdl.handle.net/10536/DRO/DU:30023433.

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

MLA Handbook (7th Edition):

Silcock, J. “Programmer friendly and efficient distributed shared memory integrated into a distributed operating system.” 1998. Web. 14 Oct 2019.

Vancouver:

Silcock J. Programmer friendly and efficient distributed shared memory integrated into a distributed operating system. [Internet] [Thesis]. Deakin University; 1998. [cited 2019 Oct 14]. Available from: http://hdl.handle.net/10536/DRO/DU:30023433.

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

Council of Science Editors:

Silcock J. Programmer friendly and efficient distributed shared memory integrated into a distributed operating system. [Thesis]. Deakin University; 1998. Available from: http://hdl.handle.net/10536/DRO/DU:30023433

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


Indian Institute of Science

17. Dharmadeep, M C. Optimizations In Storage Area Networks And Direct Attached Storage.

Degree: 2007, Indian Institute of Science

 The thesis consists of three parts. In the first part, we introduce the notion of device-cache-aware schedulers. Modern disk subsystems have many megabytes of memory(more)

Subjects/Keywords: Computer Storage; Computer Memory Devices; Adaptive Caching Algorithms; Cooperative Caching; Redhat Global File System - Caching; Device-Cache-Aware Schedulers; Clustered Shared Disk Systems; Scheduler Architecture; Storage Area Networks; Direct Attached Storage; Distributed Lock Manager (DLM); Global File System (GFS); Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dharmadeep, M. C. (2007). Optimizations In Storage Area Networks And Direct Attached Storage. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/574

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

Dharmadeep, M C. “Optimizations In Storage Area Networks And Direct Attached Storage.” 2007. Thesis, Indian Institute of Science. Accessed October 14, 2019. http://hdl.handle.net/2005/574.

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

MLA Handbook (7th Edition):

Dharmadeep, M C. “Optimizations In Storage Area Networks And Direct Attached Storage.” 2007. Web. 14 Oct 2019.

Vancouver:

Dharmadeep MC. Optimizations In Storage Area Networks And Direct Attached Storage. [Internet] [Thesis]. Indian Institute of Science; 2007. [cited 2019 Oct 14]. Available from: http://hdl.handle.net/2005/574.

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

Council of Science Editors:

Dharmadeep MC. Optimizations In Storage Area Networks And Direct Attached Storage. [Thesis]. Indian Institute of Science; 2007. Available from: http://hdl.handle.net/2005/574

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

18. Ha, Viet Hai. Optimization of memory management on distributed machine : Optimisation de la gestion mémoire sur machines distribuées.

Degree: Docteur es, Informatique, 2012, Evry, Institut national des télécommunications

 Afin d'exploiter les capacités des architectures parallèles telles que les grappes, les grilles, les systèmes multi-processeurs, et plus récemment les nuages et les systèmes multi-cœurs,… (more)

Subjects/Keywords: CAPE; Open MP; DICKPT; UHLRC; Mémoire distribuée; Parallèlisme; CAPE; Chekpointing aided parallel execution; Open MP compliance; DICKPT; Discontinuous incremental checkpointing; UHLRC; Updated home-based lazy relaxed consistency; Distributed memory system; Parallel computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ha, V. H. (2012). Optimization of memory management on distributed machine : Optimisation de la gestion mémoire sur machines distribuées. (Doctoral Dissertation). Evry, Institut national des télécommunications. Retrieved from http://www.theses.fr/2012TELE0042

Chicago Manual of Style (16th Edition):

Ha, Viet Hai. “Optimization of memory management on distributed machine : Optimisation de la gestion mémoire sur machines distribuées.” 2012. Doctoral Dissertation, Evry, Institut national des télécommunications. Accessed October 14, 2019. http://www.theses.fr/2012TELE0042.

MLA Handbook (7th Edition):

Ha, Viet Hai. “Optimization of memory management on distributed machine : Optimisation de la gestion mémoire sur machines distribuées.” 2012. Web. 14 Oct 2019.

Vancouver:

Ha VH. Optimization of memory management on distributed machine : Optimisation de la gestion mémoire sur machines distribuées. [Internet] [Doctoral dissertation]. Evry, Institut national des télécommunications; 2012. [cited 2019 Oct 14]. Available from: http://www.theses.fr/2012TELE0042.

Council of Science Editors:

Ha VH. Optimization of memory management on distributed machine : Optimisation de la gestion mémoire sur machines distribuées. [Doctoral Dissertation]. Evry, Institut national des télécommunications; 2012. Available from: http://www.theses.fr/2012TELE0042

19. Craveiro, Gisele da Silva. Um ambiente de execução para suporte à programação paralela com variáveis compartilhadas em sistemas distribuídos heterogêneos.

Degree: PhD, Sistemas Digitais, 2003, University of São Paulo

O avanço na tecnologia de hardware está permitindo que máquinas SMP de 2 a 8 processadores estejam disponíveis a um custo cada vez menor, possibilitando… (more)

Subjects/Keywords: aglomerado de nós mono e multiprocessadores; cluter of mono and multiprocessor nodes; CPAR; distributed shared memory; heterogeneous distributed system; parallel programing; programação paralela CPAR; sistema de memória compartilhada distribuída; sistema distribuído heterogêneo

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Craveiro, G. d. S. (2003). Um ambiente de execução para suporte à programação paralela com variáveis compartilhadas em sistemas distribuídos heterogêneos. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/3/3141/tde-04062004-160551/ ;

Chicago Manual of Style (16th Edition):

Craveiro, Gisele da Silva. “Um ambiente de execução para suporte à programação paralela com variáveis compartilhadas em sistemas distribuídos heterogêneos.” 2003. Doctoral Dissertation, University of São Paulo. Accessed October 14, 2019. http://www.teses.usp.br/teses/disponiveis/3/3141/tde-04062004-160551/ ;.

MLA Handbook (7th Edition):

Craveiro, Gisele da Silva. “Um ambiente de execução para suporte à programação paralela com variáveis compartilhadas em sistemas distribuídos heterogêneos.” 2003. Web. 14 Oct 2019.

Vancouver:

Craveiro GdS. Um ambiente de execução para suporte à programação paralela com variáveis compartilhadas em sistemas distribuídos heterogêneos. [Internet] [Doctoral dissertation]. University of São Paulo; 2003. [cited 2019 Oct 14]. Available from: http://www.teses.usp.br/teses/disponiveis/3/3141/tde-04062004-160551/ ;.

Council of Science Editors:

Craveiro GdS. Um ambiente de execução para suporte à programação paralela com variáveis compartilhadas em sistemas distribuídos heterogêneos. [Doctoral Dissertation]. University of São Paulo; 2003. Available from: http://www.teses.usp.br/teses/disponiveis/3/3141/tde-04062004-160551/ ;

20. Δημητρέλος, Δημήτριος. Προσομοίωση και ανάπτυξη πολυπαραμετρικού συστήματος κατανεμημένης μοιραζομένης μνήμης για μαζικά παράλληλους πολυεπεξεργαστές.

Degree: 1999, Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ); National and Kapodistrian University of Athens

ΤΑ ΣΥΣΤΗΜΑΤΑ ΚΑΤΑΝΕΜΗΜΕΝΗΣ ΜΟΙΡΑΖΟΜΕΝΗΣ ΜΝΗΜΗΣ(ΚΜΜ) ΕΠΙΧΕΙΡΟΥΝ ΝΑ ΓΕΦΥΡΩΣΟΥΝ ΤΟ ΧΑΣΜΑ ΠΟΥ ΠΑΡΑΔΟΣΙΑΚΑ ΥΠΗΡΧΕ ΜΕΤΑΞΥ ΤΩΝ ΠΟΛΥΕΠΕΞΕΡΓΑΣΤΩΝ ΚΑΤΑΝΕΜΗΜΕΝΗΣ ΜΝΗΜΗΣ ΚΑΙ ΤΟΥ ΠΡΟΓΡΑΜΜΑΤΙΣΤΙΚΟΥ ΜΟΝΤΕΛΟΥ ΤΩΝ ΚΟΙΝΩΝ ΜΕΤΑΒΛΗΤΩΝ.ΣΤΗΝ… (more)

Subjects/Keywords: Κατανεμημένη Μοιραζομένη Μνήμη; Πολυεπεξεργαστές πλέγματος; Αντίστροφη Διανομή Ευρετηρίου; Παράλληλη επεξεργασία; Ηλεκτρονικοί υπολογιστές; Εικονική Μοιραζομένη Μνήμη; Σύστημα πολυπαραμετρικό; Distributed shared memory; Grid multiprocessors; Reciprocal directory distribution; Parallel processing; Computers; Vitrual shared memory; Multiparametric system

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Δημητρέλος, . (1999). Προσομοίωση και ανάπτυξη πολυπαραμετρικού συστήματος κατανεμημένης μοιραζομένης μνήμης για μαζικά παράλληλους πολυεπεξεργαστές. (Thesis). Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ); National and Kapodistrian University of Athens. Retrieved from http://hdl.handle.net/10442/hedi/12263

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

Δημητρέλος, Δημήτριος. “Προσομοίωση και ανάπτυξη πολυπαραμετρικού συστήματος κατανεμημένης μοιραζομένης μνήμης για μαζικά παράλληλους πολυεπεξεργαστές.” 1999. Thesis, Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ); National and Kapodistrian University of Athens. Accessed October 14, 2019. http://hdl.handle.net/10442/hedi/12263.

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

MLA Handbook (7th Edition):

Δημητρέλος, Δημήτριος. “Προσομοίωση και ανάπτυξη πολυπαραμετρικού συστήματος κατανεμημένης μοιραζομένης μνήμης για μαζικά παράλληλους πολυεπεξεργαστές.” 1999. Web. 14 Oct 2019.

Vancouver:

Δημητρέλος . Προσομοίωση και ανάπτυξη πολυπαραμετρικού συστήματος κατανεμημένης μοιραζομένης μνήμης για μαζικά παράλληλους πολυεπεξεργαστές. [Internet] [Thesis]. Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ); National and Kapodistrian University of Athens; 1999. [cited 2019 Oct 14]. Available from: http://hdl.handle.net/10442/hedi/12263.

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

Council of Science Editors:

Δημητρέλος . Προσομοίωση και ανάπτυξη πολυπαραμετρικού συστήματος κατανεμημένης μοιραζομένης μνήμης για μαζικά παράλληλους πολυεπεξεργαστές. [Thesis]. Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ); National and Kapodistrian University of Athens; 1999. Available from: http://hdl.handle.net/10442/hedi/12263

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

21. 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 October 14, 2019. http://hdl.handle.net/10315/30672.

MLA Handbook (7th Edition):

Shafiei, Niloufar. “Non-Blocking Data Structures Handling Multiple Changes Atomically.” 2015. Web. 14 Oct 2019.

Vancouver:

Shafiei N. Non-Blocking Data Structures Handling Multiple Changes Atomically. [Internet] [Doctoral dissertation]. York University; 2015. [cited 2019 Oct 14]. 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


University of South Africa

22. Janeke, Hendrik Christiaan. Connectionist modelling in cognitive science: an exposition and appraisal .

Degree: 2009, University of South Africa

 This thesis explores the use of artificial neural networks for modelling cognitive processes. It presents an exposition of the neural network paradigm, and evaluates its… (more)

Subjects/Keywords: Artificial neural networks; Attractor memory models; Classical cognitive approach; Coarse coding; Cognition and computation; Cognitive science; Connectionist modelling; Distributed representations; Functionalism; Mental representation; Physical symbol system; Turing machine

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Janeke, H. C. (2009). Connectionist modelling in cognitive science: an exposition and appraisal . (Doctoral Dissertation). University of South Africa. Retrieved from http://hdl.handle.net/10500/635

Chicago Manual of Style (16th Edition):

Janeke, Hendrik Christiaan. “Connectionist modelling in cognitive science: an exposition and appraisal .” 2009. Doctoral Dissertation, University of South Africa. Accessed October 14, 2019. http://hdl.handle.net/10500/635.

MLA Handbook (7th Edition):

Janeke, Hendrik Christiaan. “Connectionist modelling in cognitive science: an exposition and appraisal .” 2009. Web. 14 Oct 2019.

Vancouver:

Janeke HC. Connectionist modelling in cognitive science: an exposition and appraisal . [Internet] [Doctoral dissertation]. University of South Africa; 2009. [cited 2019 Oct 14]. Available from: http://hdl.handle.net/10500/635.

Council of Science Editors:

Janeke HC. Connectionist modelling in cognitive science: an exposition and appraisal . [Doctoral Dissertation]. University of South Africa; 2009. Available from: http://hdl.handle.net/10500/635


Universitetet i Tromsø

23. Mortensen, Magnus. Design and evaluation of a recommender system .

Degree: 2007, Universitetet i Tromsø

 In the recent years, the Web has undergone a tremendous growth regarding both content and users. This has lead to an information overload problem in… (more)

Subjects/Keywords: VDP::Teknologi: 500::Informasjons- og kommunikasjonsteknologi: 550::Datateknologi: 551; music; system; distribuert; internett; presisjon; anbefaling; filtrering; tilbakemelding; e-handel; tilbakemelding; brukere; skalerbarhet; recommender; filtering; collaborative; content-based; context; mood; feedback; precision; information overload; mean squared difference; web; e-commerce; retrieval; sparsity; intrusiveness; distributed; empirical; scalability; model; memory; mp3

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mortensen, M. (2007). Design and evaluation of a recommender system . (Masters Thesis). Universitetet i Tromsø. Retrieved from http://hdl.handle.net/10037/762

Chicago Manual of Style (16th Edition):

Mortensen, Magnus. “Design and evaluation of a recommender system .” 2007. Masters Thesis, Universitetet i Tromsø. Accessed October 14, 2019. http://hdl.handle.net/10037/762.

MLA Handbook (7th Edition):

Mortensen, Magnus. “Design and evaluation of a recommender system .” 2007. Web. 14 Oct 2019.

Vancouver:

Mortensen M. Design and evaluation of a recommender system . [Internet] [Masters thesis]. Universitetet i Tromsø 2007. [cited 2019 Oct 14]. Available from: http://hdl.handle.net/10037/762.

Council of Science Editors:

Mortensen M. Design and evaluation of a recommender system . [Masters Thesis]. Universitetet i Tromsø 2007. Available from: http://hdl.handle.net/10037/762

24. 高田, 雅美. 分散メモリ環境における数値計算の並列化 : Parallelizations of Numerical Calculations on Distributed Memory Systems.

Degree: 博士(理学), 2004, Nara Women’s University / 奈良女子大学

When analyzing physical and natural phenomena, numerical simulations are used. Large-scale computational quantities and memory are often needed for the numerical calcula-tions. Even when computer… (more)

Subjects/Keywords: turbulent flow simulation; parallelized program; distributed memory system; performance evaluation; direct numerical simulation; i-APPLI; surplus calculation resources; genetic algorithm; island model; Master-Slave; 乱流シミュレーション; 並列プログラム; 分散メモリシステム; 性能評価; 直接数値シミュレーション; iアプリ; 余剰計算リソース; 遺伝的アルゴリズム; 島モデル

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

高田, . (2004). 分散メモリ環境における数値計算の並列化 : Parallelizations of Numerical Calculations on Distributed Memory Systems. (Thesis). Nara Women’s University / 奈良女子大学. Retrieved from http://hdl.handle.net/10935/599

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

高田, 雅美. “分散メモリ環境における数値計算の並列化 : Parallelizations of Numerical Calculations on Distributed Memory Systems.” 2004. Thesis, Nara Women’s University / 奈良女子大学. Accessed October 14, 2019. http://hdl.handle.net/10935/599.

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

MLA Handbook (7th Edition):

高田, 雅美. “分散メモリ環境における数値計算の並列化 : Parallelizations of Numerical Calculations on Distributed Memory Systems.” 2004. Web. 14 Oct 2019.

Vancouver:

高田 . 分散メモリ環境における数値計算の並列化 : Parallelizations of Numerical Calculations on Distributed Memory Systems. [Internet] [Thesis]. Nara Women’s University / 奈良女子大学; 2004. [cited 2019 Oct 14]. Available from: http://hdl.handle.net/10935/599.

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

Council of Science Editors:

高田 . 分散メモリ環境における数値計算の並列化 : Parallelizations of Numerical Calculations on Distributed Memory Systems. [Thesis]. Nara Women’s University / 奈良女子大学; 2004. Available from: http://hdl.handle.net/10935/599

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

.