Relevant bibliographies by topics / Distributed shared memory

Academic literature on the topic 'Distributed shared memory'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Distributed shared memory.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Distributed shared memory"

1

Zhou, S., M. Stumm, K. Li, and D. Wortman. "Heterogeneous distributed shared memory." IEEE Transactions on Parallel and Distributed Systems 3, no. 5 (1992): 540–54. http://dx.doi.org/10.1109/71.159038.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Otto, Steve W. "Shared-memory versus distributed-memory: Halftime score." Computer Physics Communications 57, no. 1-3 (December 1989): 95–100. http://dx.doi.org/10.1016/0010-4655(89)90196-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dash, Alokika, and Brian Demsky. "Software transactional distributed shared memory." ACM SIGPLAN Notices 44, no. 4 (February 14, 2009): 297–98. http://dx.doi.org/10.1145/1594835.1504223.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Stumm, M., and S. Zhou. "Algorithms implementing distributed shared memory." Computer 23, no. 5 (May 1990): 54–64. http://dx.doi.org/10.1109/2.53355.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wu, K. L., and W. K. Fuchs. "Recoverable distributed shared virtual memory." IEEE Transactions on Computers 39, no. 4 (April 1990): 460–69. http://dx.doi.org/10.1109/12.54839.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Clarke, J. A. "Emulating shared memory to simplify distributed-memory programming." IEEE Computational Science and Engineering 4, no. 1 (1997): 55–62. http://dx.doi.org/10.1109/99.590858.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Butelle, Franck, and Camille Coti. "Data Coherency in Distributed Shared Memory." International Journal of Networking and Computing 2, no. 1 (2012): 117–30. http://dx.doi.org/10.15803/ijnc.2.1_117.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Feeley, Michael J., and Henry M. Levy. "Distributed shared memory with versioned objects." ACM SIGPLAN Notices 27, no. 10 (October 31, 1992): 247–62. http://dx.doi.org/10.1145/141937.141957.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Baillie, Clive F. "Comparing shared and distributed memory computers." Parallel Computing 8, no. 1-3 (October 1988): 101–10. http://dx.doi.org/10.1016/0167-8191(88)90113-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Protic, J., M. Tomasevic, and V. Milutinovic. "Distributed shared memory: concepts and systems." IEEE Parallel & Distributed Technology: Systems & Applications 4, no. 2 (1996): 63–71. http://dx.doi.org/10.1109/88.494605.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Distributed shared memory"

1

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Auld, Philip Ragner. "Broadcast distributed shared memory." W&M ScholarWorks, 2001. https://scholarworks.wm.edu/etd/1539623374.

Full text
Abstract:
Distributed shared memory (DSM) provides the illusion of shared memory processing to programs running on physically distributed systems. Many of these systems are connected by a broadcast medium network such as Ethernet. In this thesis, we develop a weakly coherent model for DSM that takes advantage of hardware-level broadcast. We define the broadcast DSM model (BDSM) to provide fine-grained sharing of user-defined locations. Additionally, since extremely weak DSM models are difficult to program, BDSM provides effective synchronization operations that allow it to function as a stronger memory. We show speedup results for a test suite of parallel programs and compare them to MPI versions.;To overcome the potential for message loss using broadcast on an Ethernet segment we have developed a reliable broadcast protocol, called Pipelined Broadcast Protocol (PBP). This protocol provides the illusion of a series of FIFO pipes among member process, on top of Ethernet broadcast operations. We discuss two versions of the PBP protocol and their implementations. Comparisons to TCP show the predicted benefits of using broadcast. PBP also shows strong throughput results, nearing the maximum of our 10Base-T hardware.;By combining weak DSM and hardware broadcast we developed a system that provides comparable performance to a common message-passing system, MPI. For our test programs that have all-to-all communication patterns, we actually see better performance than MPI. We show that using broadcast to perform DSM updates can be a viable alternative to message passing for parallel and distributed computation on a single Ethernet segment.
APA, Harvard, Vancouver, ISO, and other styles
3

Ananthanarayanan, R. (Rajagopal). "High performance distributed shared memory." Diss., Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/8129.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles
5

Godfrey, Andrew. "Distributed shared memory for virtual environments." Master's thesis, University of Cape Town, 1997. http://hdl.handle.net/11427/9516.

Full text
Abstract:
Bibliography: leaves 71-77.
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.
APA, Harvard, Vancouver, ISO, and other styles
6

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Marurngsith, Worawan. "Simulation modelling of distributed-shared memory multiprocessors." Thesis, University of Edinburgh, 2006. http://hdl.handle.net/1842/870.

Full text
Abstract:
Distributed shared memory (DSM) systems have been recognised as a compelling platform for parallel computing due to the programming advantages and scalability. DSM systems allow applications to access data in a logically shared address space by abstracting away the distinction of physical memory location. As the location of data is transparent, the sources of overhead caused by accessing the distant memories are difficult to analyse. This memory locality problem has been identified as crucial to DSM performance. Many researchers have investigated the problem using simulation as a tool for conducting experiments resulting in the progressive evolution of DSM systems. Nevertheless, both the diversity of architectural configurations and the rapid advance of DSM implementations impose constraints on simulation model designs in two issues: the limitation of the simulation framework on model extensibility and the lack of verification applicability during a simulation run causing the delay in verification process. This thesis studies simulation modelling techniques for memory locality analysis of various DSM systems implemented on top of a cluster of symmetric multiprocessors. The thesis presents a simulation technique to promote model extensibility and proposes a technique for verification applicability, called a Specification-based Parameter Model Interaction (SPMI). The proposed techniques have been implemented in a new interpretation-driven simulation called DSiMCLUSTER on top of a discrete event simulation (DES) engine known as HASE. Experiments have been conducted to determine which factors are most influential on the degree of locality and to determine the possibility to maximise the stability of performance. DSiMCLUSTER has been validated against a SunFire 15K server and has achieved similarity of cache miss results, an average of +-6% with the worst case less than 15% of difference. These results confirm that the techniques used in developing the DSiMCLUSTER can contribute ways to achieve both (a) a highly extensible simulation framework to keep up with the ongoing innovation of the DSM architecture, and (b) the verification applicability resulting in an efficient framework for memory analysis experiments on DSM architecture.
APA, Harvard, Vancouver, ISO, and other styles
8

Johnson, Kirk Lauritz. "High-performance all-software distributed shared memory." Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/37185.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.
Includes bibliographical references (p. 165-172).
by Kirk Lauritz Johnson.
Ph.D.
APA, Harvard, Vancouver, ISO, and other styles
9

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.
Vita.
Includes bibliographical references (p. 123-131).
by Wilson Cheng-Yi Hsieh.
Ph.D.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Distributed shared memory"

1

Postavsky, Uri. Distributed compilation using distributed shared memory. Ottawa: National Library of Canada = Bibliothèque nationale du Canada, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Postavsky, Uri. Distributed compilation using distributed shared memory. Toronto: University of Toronto, Dept. of Computer Science, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tarek, El-Ghazawi, ed. UPC: Distributed shared memory programming. Hoboken, NJ: Wiley, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Jelica, Protić, Tomaševic Milo, and Milutinović Veljko, eds. Distributed shared memory: Concepts and systems. Los Alamitos, Calif: IEEE Computer Society Press, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Eva, Kühn, ed. Virtual shared memory for distributed architectures. Huntington, N.Y: Nova Science Publishers, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Abandah, Gheith A. Tools for characterizing distributed shared memory applications. Palo Alto, CA: Hewlett-Packard Laboratories, Technical Publications Department, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Gaddam, Sridhar. A distributed shared memory implementation for UNIX systems. Oxford: Oxford Brookes University, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kent, Fuchs W., and United States. National Aeronautics and Space Administration., eds. Ensuring correct rollback recovery in distributed shared memory systems. [Washington, DC: National Aeronautics and Space Administration, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

United States. Army Aviation Research and Technology Activity. and United States. National Aeronautics and Space Administration., eds. Distributed simulation using a real-time shared memory network. [Washington, DC: National Aeronautics and Space Administration, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

N, Jayasimha D., Pillay Sasi Kumar, and Lewis Research Center. Institute for Computational Mechanics in Propulsion., eds. Parallel Navier-Stokes computations on shared and distributed memory architectures. [Cleveland, Ohio]: National Aeronautics and Space Administration, Lewis Research Center, Institute for Computational Mechanics in Propulsion, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Distributed shared memory"

1

Czaja, Ludwik. "Distributed Shared Memory." In Lecture Notes in Networks and Systems, 187–226. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-72023-4_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Shankar, A. Udaya. "Distributed Shared Memory Service." In Distributed Programming, 299–303. New York, NY: Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-4881-5_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Cachin, Christian, Rachid Guerraoui, and Luís Rodrigues. "Shared Memory." In Introduction to Reliable and Secure Distributed Programming, 137–202. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15260-3_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Dongarra, Jack, Piotr Luszczek, Felix Wolf, Jesper Larsson Träff, Patrice Quinton, Hermann Hellwagner, Martin Fränzle, et al. "Software Distributed Shared Memory." In Encyclopedia of Parallel Computing, 1848–55. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-09766-4_492.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Parashar, M., and S. Chandra. "Distributed Shared Memory Tools." In Tools and Environments for Parallel and Distributed Computing, 57–77. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2004. http://dx.doi.org/10.1002/0471474835.ch3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Afek, Yehuda, Michael Merritt, and Gadi Taubenfeld. "Benign failure models for shared memory." In Distributed Algorithms, 69–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-57271-6_28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Shankar, A. Udaya. "A Single-Copy Distributed Shared Memory." In Distributed Programming, 305–12. New York, NY: Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-4881-5_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Shankar, A. Udaya. "A Multi-copy Distributed Shared Memory." In Distributed Programming, 313–20. New York, NY: Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-4881-5_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Mavronicolas, Marios, and Dan Roth. "Efficient, strongly consistent implementations of shared memory." In Distributed Algorithms, 346–61. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-56188-9_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Murer, Stephan, and Philipp Färber. "A scalable distributed shared memory." In Parallel Processing: CONPAR 92—VAPP V, 453–66. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-55895-0_443.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Distributed shared memory"

1

Bennett, J. K., J. B. Carter, A. L. Cox, E. N. Elnozahy, D. B. Johnson, P. Keleher, and W. Zwaenepoel. "Distributed shared memory." In the 5th workshop. New York, New York, USA: ACM Press, 1992. http://dx.doi.org/10.1145/506378.506384.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Geva, Mordechai, and Yair Wiseman. "Distributed Shared Memory Integration." In 2007 IEEE International Conference on Information Reuse and Integration. IEEE, 2007. http://dx.doi.org/10.1109/iri.2007.4296612.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Shan, Yizhou, Shin-Yeh Tsai, and Yiying Zhang. "Distributed shared persistent memory." In SoCC '17: ACM Symposium on Cloud Computing. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3127479.3128610.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Snir, Marc. "Shared memory programming on distributed memory systems." In the Third Conference. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1809961.1809965.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Dash, Alokika, and Brian Demsky. "Software transactional distributed shared memory." In the 14th ACM SIGPLAN symposium. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1504176.1504223.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

de la Fuente, Francisco, Felipe Torres, and Fernando R. Rannou. "Distributed-shared memory computed tomography." In 2012 IEEE Nuclear Science Symposium and Medical Imaging Conference (2012 NSS/MIC). IEEE, 2012. http://dx.doi.org/10.1109/nssmic.2012.6551558.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Haas, Andreas, Michael Lippautz, Thomas A. Henzinger, Hannes Payer, Ana Sokolova, Christoph M. Kirsch, and Ali Sezgin. "Distributed queues in shared memory." In the ACM International Conference. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2482767.2482789.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Mori, S., H. Saito, M. Goshima, S. Tomita, M. Yanagihara, T. Tanaka, D. Fraser, K. Joe, and H. Nitta. "A distributed shared memory multiprocessor ASURA." In the 1993 ACM/IEEE conference. New York, New York, USA: ACM Press, 1993. http://dx.doi.org/10.1145/169627.169825.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Feeley, Michael J., and Henry M. Levy. "Distributed shared memory with versioned objects." In conference proceedings. New York, New York, USA: ACM Press, 1992. http://dx.doi.org/10.1145/141936.141957.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Lobato, Renata Spolon, Roberta Spolon, Bruno Simioni, Aleardo Manacero, and Marcos Antonio Cavenaghi. "Simulation Platform on Distributed Shared Memory." In 2021 16th Iberian Conference on Information Systems and Technologies (CISTI). IEEE, 2021. http://dx.doi.org/10.23919/cisti52073.2021.9476546.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Distributed shared memory"

1

Hastings, Andrew B. Transactional Distributed Shared Memory. Fort Belvoir, VA: Defense Technical Information Center, July 1992. http://dx.doi.org/10.21236/ada256222.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Black, David L., Anoop Gupta, and Wolf-Dietrich Weber. Competitive Management of Distributed Shared Memory. Fort Belvoir, VA: Defense Technical Information Center, January 1988. http://dx.doi.org/10.21236/ada207322.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bershad, Brian N., Matthew J. Zekauskas, and Wayne A. Sawdon. The Midway Distributed Shared Memory System. Fort Belvoir, VA: Defense Technical Information Center, March 1993. http://dx.doi.org/10.21236/ada264645.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Aggarwal, Anshu, Dirk Grunwald, Trent R. Hein, and Evi Nemeth. Hemingway, A Distributed Shared Memory System. Fort Belvoir, VA: Defense Technical Information Center, March 1995. http://dx.doi.org/10.21236/ada459176.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Janssens, Bob, and W. K. Fuchs. Relaxing Consistency in Recoverable Distributed Shared Memory. Fort Belvoir, VA: Defense Technical Information Center, January 1993. http://dx.doi.org/10.21236/ada266931.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Fuller, Douglas James. Translation techniques for distributed-shared memory programming models. Office of Scientific and Technical Information (OSTI), January 2005. http://dx.doi.org/10.2172/850080.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Engle, Clifford. Shark: Fast Data Analysis Using Coarse-grained Distributed Memory. Fort Belvoir, VA: Defense Technical Information Center, May 2013. http://dx.doi.org/10.21236/ada577443.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Lupher, Antonio. Shark: SQL and Analytics with Cost-Based Query Optimization on Coarse-Grained Distributed Memory. Fort Belvoir, VA: Defense Technical Information Center, January 2014. http://dx.doi.org/10.21236/ada603561.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Distributed shared memory' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography