Дисертації з теми "Software distributed shared memory"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Software distributed shared memory".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Radovic, Zoran. "Software Techniques for Distributed Shared Memory." Doctoral thesis, Uppsala University, Department of Information Technology, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-6058.
Повний текст джерелаIn large multiprocessors, the access to shared memory is often nonuniform, and may vary as much as ten times for some distributed shared-memory architectures (DSMs). This dissertation identifies another important nonuniform property of DSM systems: nonuniform communication architecture, NUCA. High-end hardware-coherent machines built from large nodes, or from chip multiprocessors, are typical NUCA systems, since they have a lower penalty for reading recently written data from a neighbor's cache than from a remote cache. This dissertation identifies node affinity as an important property for scalable general-purpose locks. Several software-based hierarchical lock implementations exploiting NUCAs are presented and evaluated. NUCA-aware locks are shown to be almost twice as efficient for contended critical sections compared to traditional lock implementations.
The shared-memory “illusion”' provided by some large DSM systems may be implemented using either hardware, software or a combination thereof. A software-based implementation can enable cheap cluster hardware to be used, but typically suffers from poor and unpredictable performance characteristics.
This dissertation advocates a new software-hardware trade-off design point based on a new combination of techniques. The two low-level techniques, fine-grain deterministic coherence and synchronous protocol execution, as well as profile-guided protocol flexibility, are evaluated in isolation as well as in a combined setting using all-software implementations. Finally, a minimum of hardware trap support is suggested to further improve the performance of coherence protocols across cluster nodes. It is shown that all these techniques combined could result in a fairly stable performance on par with hardware-based coherence.
Johnson, Kirk Lauritz. "High-performance all-software distributed shared memory." Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/37185.
Повний текст джерелаIncludes bibliographical references (p. 165-172).
by Kirk Lauritz Johnson.
Ph.D.
Cheung, Wang-leung Benny. "Large object space support for software distributed shared memory." Click to view the E-thesis via HKUTO, 2005. http://sunzi.lib.hku.hk/hkuto/record/B31601741.
Повний текст джерела張宏亮 and Wang-leung Benny Cheung. "Migrating-home protocol for software distributed shared-memory system." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2000. http://hub.hku.hk/bib/B31222377.
Повний текст джерелаCheung, Wang-leung Benny, and 張宏亮. "Large object space support for software distributed shared memory." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2005. http://hub.hku.hk/bib/B31601741.
Повний текст джерелаNorgren, Magnus. "Software Distributed Shared Memory Using the VIPS Coherence Protocol." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-256975.
Повний текст джерелаCheung, Wang-leung Benny. "Migrating-home protocol for software distributed shared-memory system /." Hong Kong : University of Hong Kong, 2000. http://sunzi.lib.hku.hk/hkuto/record.jsp?B22030116.
Повний текст джерелаLo, Adley Kam Wing. "Tolerating latency in software distributed shared memory systems through multithreading." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ34040.pdf.
Повний текст джерелаAtukorala, G. S. "Porting a distributed operating system to a shared memory parallel computer." Thesis, University of Bath, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.256756.
Повний текст джерелаChan, Charles Quoc Cuong. "Tolerating latency in software distributed shared memory systems through non-binding prefetching." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ34036.pdf.
Повний текст джерелаQin, Xiaohan. "On the use and performance of communication primitives in software controlled cache-coherent cluster architectures /." Thesis, Connect to this title online; UW restricted, 1997. http://hdl.handle.net/1773/6925.
Повний текст джерелаKhalil, Mohamed Abdalla. "Integrative monitoring and control framework based on software distributed shared memory non-locking model." Thesis, Nottingham Trent University, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.403094.
Повний текст джерелаZeffer, Håkan. "Towards Low-Complexity Scalable Shared-Memory Architectures." Doctoral thesis, Uppsala University, Department of Information Technology, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-7135.
Повний текст джерелаPlentiful research has addressed low-complexity software-based shared-memory systems since the idea was first introduced more than two decades ago. However, software-coherent systems have not been very successful in the commercial marketplace. We believe there are two main reasons for this: lack of performance and/or lack of binary compatibility.
This thesis studies multiple aspects of how to design future binary-compatible high-performance scalable shared-memory servers while keeping the hardware complexity at a minimum. It starts with a software-based distributed shared-memory system relying on no specific hardware support and gradually moves towards architectures with simple hardware support.
The evaluation is made in a modern chip-multiprocessor environment with both high-performance compute workloads and commercial applications. It shows that implementing the coherence-violation detection in hardware while solving the interchip coherence in software allows for high-performing binary-compatible systems with very low hardware complexity. Our second-generation hardware-software hybrid performs on par with, and often better than, traditional hardware-only designs.
Based on our results, we conclude that it is not only possible to design simple systems while maintaining performance and the binary-compatibility envelope, it is often possible to get better performance than in traditional and more complex designs.
We also explore two new techniques for evaluating a new shared-memory design throughout this work: adjustable simulation fidelity and statistical multiprocessor cache modeling.
Govindaswamy, Kirthilakshmi. "An API for adaptive loop scheduling in shared address space architectures." Master's thesis, Mississippi State : Mississippi State University, 2003. http://sun.library.msstate.edu/ETD-db/theses/available/etd-07082003-122028/restricted/kirthi%5Fthesis.pdf.
Повний текст джерелаParastatidis, Savas. "Run-time support for parallel object-oriented computing : the NIP lazy task creation technique and the NIP object-based software distributed shared memory." Thesis, University of Newcastle Upon Tyne, 2000. http://hdl.handle.net/10443/1768.
Повний текст джерелаHussain, Shahid, and Hassan Shabbir. "Directory scalability in multi-agent based systems." Thesis, Blekinge Tekniska Högskola, Avdelningen för programvarusystem, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-3110.
Повний текст джерелаKinawi, Husam. "Optimistic distributed shared memory." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0012/NQ38454.pdf.
Повний текст джерелаAuld, Philip Ragner. "Broadcast distributed shared memory." W&M ScholarWorks, 2001. https://scholarworks.wm.edu/etd/1539623374.
Повний текст джерелаAnanthanarayanan, R. (Rajagopal). "High performance distributed shared memory." Diss., Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/8129.
Повний текст джерелаGodfrey, Andrew. "Distributed shared memory for virtual environments." Master's thesis, University of Cape Town, 1997. http://hdl.handle.net/11427/9516.
Повний текст джерелаThis work investigated making virtual environments easier to program, by designing a suitable distributed shared memory system. To be usable, the system must keep latency to a minimum, as virtual environments are very sensitive to it. The resulting design is push-based and non-consistent. Another requirement is that the system should be scaleable, over large distances and over large numbers of participants. The latter is hard to achieve with current network protocols, and a proposal was made for a more scaleable multicast addressing system than is used in the Internet protocol. Two sample virtual environments were developed to test the ease-of-use of the system. This showed that the basic concept is sound, but that more support is needed. The next step should be to extend the language and add compiler support, which will enhance ease-of-use and allow numerous optimisations. This can be improved further by providing system-supported containers.
Carter, Nicholas P. (Nicholas Parks). "Processor mechanisms for software shared memory." Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/79969.
Повний текст джерелаIncludes bibliographical references (p. 169-171).
by Nicholas Parks Carter.
Ph.D.
Girard, Gabriel. "Views and consistencies in distributed shared memory." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0009/NQ59232.pdf.
Повний текст джерелаMarurngsith, Worawan. "Simulation modelling of distributed-shared memory multiprocessors." Thesis, University of Edinburgh, 2006. http://hdl.handle.net/1842/870.
Повний текст джерелаKotselidis, Christos-Efthymios. "Exploiting distributed software transactional memory." Thesis, University of Manchester, 2011. https://www.research.manchester.ac.uk/portal/en/theses/exploiting-distributed-software-transactional-memory(33765e72-93ce-4802-bdfe-c92b72f73890).html.
Повний текст джерелаZeffer, Håkan. "Hardware–Software Tradeoffs in Shared-Memory Implementations." Licentiate thesis, Uppsala universitet, Avdelningen för datorteknik, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-86369.
Повний текст джерелаRuppert, Eric. "The consensus power of shared-memory distributed systems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0028/NQ49848.pdf.
Повний текст джерелаHsieh, Wilson Cheng-Yi. "Dynamic computation migration in distributed shared memory systems." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/36635.
Повний текст джерелаVita.
Includes bibliographical references (p. 123-131).
by Wilson Cheng-Yi Hsieh.
Ph.D.
Rakamarić, Zvonimir. "Modular verification of shared-memory concurrent system software." Thesis, University of British Columbia, 2011. http://hdl.handle.net/2429/32572.
Повний текст джерелаCosta, Prats Juan José. "Efficient openMP over sequentially consistent distributed shared memory systems." Doctoral thesis, Universitat Politècnica de Catalunya, 2011. http://hdl.handle.net/10803/81012.
Повний текст джерелаMohindra, Ajay. "Issues in the design of distributed shared memory systems." Diss., Georgia Institute of Technology, 1993. http://hdl.handle.net/1853/9123.
Повний текст джерелаGupta, Sandeep K. (Sandeep Kumar). "Protocol optimizations for the CRL distributed shared memory system." Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/41004.
Повний текст джерелаAdler, Joseph (Joseph Adam). "Implementing distributed shared memory on an extensible operating system." Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/42805.
Повний текст джерелаIncludes bibliographical references (p. 86-91).
by Joseph Adler.
S.B.and M.Eng.
Holsapple, Stephen Alan. "DSM64: A DISTRIBUTED SHARED MEMORY SYSTEM IN USER-SPACE." DigitalCommons@CalPoly, 2012. https://digitalcommons.calpoly.edu/theses/725.
Повний текст джерелаAkay, Mehmet Fatih Katsinis Constantine. "Contention resolution and memory load balancing algorithms on distributed shared memory multiprocessors /." Philadelphia, Pa. : Drexel University, 2005. http://dspace.library.drexel.edu/handle/1860/510.
Повний текст джерелаSilcock, Jackie, and mikewood@deakin edu au. "Programmer friendly and efficient distributed shared memory integrated into a distributed operating system." Deakin University. School of Computing and Mathematics, 1998. http://tux.lib.deakin.edu.au./adt-VDU/public/adt-VDU20051114.110240.
Повний текст джерелаArgile, Andrew Duncan Stuart. "Distributed processing in decision support systems." Thesis, Nottingham Trent University, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.259647.
Повний текст джерелаSilva, João André Almeida e. "Partial replication in distributed software transactional memory." Master's thesis, Faculdade de Ciências e Tecnologia, 2013. http://hdl.handle.net/10362/10769.
Повний текст джерелаDistributed software transactional memory (DSTM) is emerging as an interesting alternative for distributed concurrency control. Usually, DSTM systems resort to data distribution and full replication techniques in order to provide scalability and fault tolerance. Nevertheless, distribution does not provide support for fault tolerance and full replication limits the system’s total storage capacity. In this context, partial data replication rises as an intermediate solution that combines the best of the previous two trying to mitigate their disadvantages. This strategy has been explored by the distributed databases research field, but has been little addressed in the context of transactional memory and, to the best of our knowledge, it has never before been incorporated into a DSTM system for a general-purpose programming language. Thus, we defend the claim that it is possible to combine both full and partial data replication in such systems. Accordingly, we developed a prototype of a DSTM system combining full and partial data replication for Java programs. We built from an existent DSTM framework and extended it with support for partial data replication. With the proposed framework, we implemented a partially replicated DSTM. We evaluated the proposed system using known benchmarks, and the evaluation showcases the existence of scenarios where partial data replication can be advantageous, e.g., in scenarios with small amounts of transactions modifying fully replicated data. The results of this thesis show that we were able to sustain our claim by implementing a prototype that effectively combines full and partial data replication in a DSTM system. The modularity of the presented framework allows the easy implementation of its various components, and it provides a non-intrusive interface to applications.
Fundação para a Ciência e Tecnologia - (FCT/MCTES) in the scope of the research project PTDC/EIA-EIA/113613/2009 (Synergy-VM)
Chaiken, David Lars. "Mechanisms and interfaces for software-extended coherent shared memory." Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/34090.
Повний текст джерелаIncludes bibliographical references (p. 140-146).
by David L. Chaiken.
Ph.D.
Farook, Mohammad. "Fast lock-free linked lists in distributed shared memory systems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ32107.pdf.
Повний текст джерелаGull, Aarron. "Cherub : a hardware distributed single shared address space memory architecture." Thesis, City University London, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.356981.
Повний текст джерелаDai, Donglai. "Designing efficient communication subsystems for distributed shared memory (DSM) systems /." The Ohio State University, 1999. http://rave.ohiolink.edu/etdc/view?acc_num=osu1488186329503887.
Повний текст джерелаRamesh, Bharath. "Samhita: Virtual Shared Memory for Non-Cache-Coherent Systems." Diss., Virginia Tech, 2013. http://hdl.handle.net/10919/23687.
Повний текст джерелаPh. D.
Upadhayaya, Niraj. "Memory management and optimization using distributed shared memory systems for high performance computing clusters." Thesis, University of the West of England, Bristol, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.421743.
Повний текст джерелаShao, Cheng. "Multi-writer consistency conditions for shared memory objects." Texas A&M University, 2007. http://hdl.handle.net/1969.1/85806.
Повний текст джерелаLi, Zongpeng. "Non-blocking implementations of Queues in asynchronous distributed shared-memory systems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp05/MQ62967.pdf.
Повний текст джерелаKalvaitis, Timothy Elmer. "Distributed shared memory for real time hardware in the loop simulation." Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/35972.
Повний текст джерелаIncludes bibliographical references (p. 95-96).
by Timothy Elmer Kalvaitis.
M.S.
Zhang, Kai. "Compiling for software distributed-shared memory systems." Thesis, 2000. http://hdl.handle.net/1911/17392.
Повний текст джерелаRajamani, Karthick. "Automatic data aggregation for software distributed shared memory systems." Thesis, 1997. http://hdl.handle.net/1911/17126.
Повний текст джерелаWang, Hsiao-Hsi, and 王孝熙. "On the Coherence Problems for Software Distributed Shared Memory." Thesis, 1993. http://ndltd.ncl.edu.tw/handle/05733960280342675094.
Повний текст джерела國立交通大學
資訊工程研究所
82
Software distributed shared memory (DSM) provides a convenient and effective solution for programming parallel applications on distributed systems. However, the performance of current implementations suffers from large overhead in enforcing memory coherence. In this thesis, we propose two coherence schemes to solve memory coherence problems. The first scheme is based upon the observation that the performance of distributed shared memory depends on the memory coherence algorithms and the access characteristics of shared data. Therefore, we propose an efficient directory-based coherence scheme using multiple coherence algorithms with self-adjusting feature. This method can dynamically choose suitable coherence algorithm for each shared variable class. The second scheme is based on the observation that there exists false sharing problem that causes unnecessarily large amount of coherence faults. Various memory consistency models have been proposed in order to eliminate the effects of network traffic and memory latency. We present a hybrid approach that combines relaxed memory consistency models and a compiler strategy to solve memory coherence and false sharing problems for DSM. Experimental results show that this hybrid approach produces fewer coherence faults and is effective for reducing the memory coherence overhead of DSM.
Wong, H'sien Jin. "Integrating software distributed shared memory and message passing programming." Phd thesis, 2010. http://hdl.handle.net/1885/151533.
Повний текст джерела