Kai Li. Shared Virtual Memory on Loosely Coupled Multiprocessors. PhD thesis, Dep. of Computer Science, Yale University, New Haven, CT, October 1986. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Local Relaxed Consistency Schemes on Shared-Memory Clusters - Schulz, Tao, McKee (Correct)
....and that these events coincide with consistency requirements. Therefore, relaxed consistency models can often be introduced without any or with only minor code changes. Relaxed consistency models have been extensively researched in the realm of Software Distributed Shared Memory (SW DSM) [13], 14] 15] and implemented in the form of relaxed consistency protocols [16] 17] While latter ones are not applicable or necessary in HW DSM scenarios, the concept of relaxed consistency models can be applied in a rather straightforward way. The result for the programmer is a secure, global ....
K. Li, "Shared Virtual Memory on Loosely Coupled Multiprocessors," Ph.D. dissertation, Yale University, Sept. 1986, available as TR492.
Heaps and Stacks in Distributed Shared Memory - Pizka, Rehn (2002) (1 citation) (Correct)
....to this memory layout model, which is unsuitable for distributed and parallel computations. Hence it is not possible to reuse e.g. a heap management library without significant modifications. 2. Related Work DSMs have been of strong interest to the OS community from the mid 80s to the late 90s [Li86, ea99]. The main motivation was to provide a simplified programming model relative to the omnipresent message passing paradigm [Sun93] Ivy [Li86] was the first page based DSM, followed by improvements such as Mirage [ea94] TreadMarks [ea96] or Odin [Pea96] Due to the possibility of false sharing, ....
....library without significant modifications. 2. Related Work DSMs have been of strong interest to the OS community from the mid 80s to the late 90s [Li86, ea99] The main motivation was to provide a simplified programming model relative to the omnipresent message passing paradigm [Sun93] Ivy [Li86] was the first page based DSM, followed by improvements such as Mirage [ea94] TreadMarks [ea96] or Odin [Pea96] Due to the possibility of false sharing, the performance of these systems strongly depends on the partitioning of data and the access characteristics of the distributed computation ....
Kai Li. Shared Virtual Memory on Loosely Coupled Multiprocessors. PhD thesis, Dep. of Computer Science, Yale University, New Haven, CT, October 1986.
Designing an Extensible Distributed Language with a Meta-Level .. - Chiba, Masuda (1993) (82 citations) (Correct)
....there is no restriction in terms of the defi. of the method Update( the programmer candefi. any action that is executed whenever the shared data are updated. This kind of processing cannot be adequately treated by other mechanisms for distributed shared data, such as distributed shared memory [13], because they do not support a functionality that invokes userdefi. r actions on eachmachine that shares the data. Although in the example above other metaobjects arenotifi. of a method call immediately, some mechanisms for distributed shared data improve performance by using an algorithm in ....
Li, K., Shared Virtual Memory on Loosely Coupled Multiprocessors. PhD thesis, Dept. of Computer Science, Yale Univ., 1986.
the Garbage Collection Bibliography - Richard Jones (2003) (Correct)
....O. J. Dahl. The SIMULA storage allocation scheme. NCC Document 62, Norsk Regnesentral, November 1963. Danvy and Jean, 1986] Olivier Danvy and Danielle Jean. Langage d imple ementation pour langages applicatifs: contribution a l etude d une r ealisation informatique. Technical Report 86 23, LITP, France, January 1986. Also Bigre Globule 48, 3e journ ees d etude sur les Langages Orient es Objet. Danvy, 1986a] Olivier Danvy. Agir avec LILA: le manuel de r ef erence. Technical Report 86 40, LITP, France, May 1986. Danvy, 1986b] Olivier Danvy. LILA: a virtual machine for functional and declarative ....
....contribution a l etude d une r ealisation informatique. Technical Report 86 23, LITP, France, January 1986. Also Bigre Globule 48, 3e journ ees d etude sur les Langages Orient es Objet. Danvy, 1986a] Olivier Danvy. Agir avec LILA: le manuel de r ef erence. Technical Report 86 40, LITP, France, May 1986. Danvy, 1986b] Olivier Danvy. LILA: a virtual machine for functional and declarative languages. Technical Report 86 38, LITP, France, May 1986. Workshop on Future Directions in Computer Science and Software. Danvy, 1987] Olivier Danvy. Memory allocation and higher order functions. ACM ....
[Article contains additional citation context not shown here]
Kai Li. Shared Virtual Memory on Loosely Coupled Multiprocessors. PhD thesis, Yale University, 1986.
A Preliminary Speedup Comparison Between Two Scope.. - Marino, de Campos (Correct)
....in two generations, the first one characterized by a big number of consistency messages and the sequential consistency and the second one, by a big reduction of the number of consistency messages and by the adoption of a release consistency model. The first generation can be exemplified with Ivy[6]. The second generation can be exemplified with Munin[2] 7] TreadMarks[3] and JIAJIA[4] This pa per introduces a DSM system that belongs to the sec ond generation: Nautilus[5] Commonly, DSM comparisons base on simulations, rather than confronting execution results, for example, two different ....
Li K, Shared Virtual Memory on Loosely Coupled Multiprocessors, PHD Thesis,Yale University, 1986.
Memory Coherence in Shared Virtual Memory Systems - Li, Hudak (1989) (692 citations) (Correct)
....workstations. We present experimental results on non trivial parallel programs that demonstrate the viability of shared virtual memory even on very loosely coupled systems such as the Apollo network. Our success suggests a tThis research was supported in part by NSF Grants MCS 8302018 nd DCR 8106181. Permission to copy without fee all or part of this material is granted provided that the copies arc not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission ....
....or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and or specfic permission. 1986 ACM 0 89791 198 9 86 0800 0229 75 229 radically different viewpoint of such architectures, in which one can exploit the total processing power and memory capabilities of such systems in a far more unified way than the traditional message passing approach. 2 Design Choices for Memory Co ....
[Article contains additional citation context not shown here]
Kai Li. Shared Virtual Memory on Loosely-coupled Multiprocessors. PhD thesis, Yale University, 1986. In preparation.
An Efficient Causal Logging Scheme for Recoverable.. - Park, Lee, Yeom (2002) (Correct)
....Corresponding author. Tel. 822 3408 3240; fax: 822 3408 3321. Email addresses: tspark sejong.ac.kr (Taesoon Park) inseon snu.ac.kr (Inseon Lee) yeom snu.ac.kr (Heon Y. Yeom) Preprint submitted to Elsevier Science 10 August 2002 1 Introduction Distributed shared memory(DSM) systems [12] transform the existing network of workstations into a powerful shared memory parallel computer. Due to the cost e ective high computing power, the DSM systems are gaining popularity. However, as the number of workstations participating in a DSM system increases, the probability of failure also ....
....which is called a checkpoint, so that the system can recover from one of the checkpoints after a system failure occurs. However, in a DSM system, the computational states of the processes become dependent on one another by accessing the common data items. In the sequentially consistent DSM systems[12], the process accessing a data item becomes dependent on the process which has produced that item, and in the DSM systems based on the relaxed memory models[1,7,10] the dependency relation is explicitly synchronized by the lock or barrier operations. Such inter process dependency may have to make ....
K. Li, Shared virtual memory on loosely coupled multiprocessors, PhD thesis, Department of Computer Science, Yale University, 1986.
A Virtual Memory Model for Parallel Supercomputers - Reis, Scherson (1996) (Correct)
....1. Introduction Although well understood in traditional operating systems, virtual memory is not a reality for massively parallel computers (MPPs) Parts of this problem have been tackled in different forms. Noteworthy is the virtual shared memory on distributed memory developed by Kai Li [7, 8]. A shared memory system is built on top of a distributed memory system and the total memory available is the sum of the local memories. The user is able to program in a shared memory environment that is actually a distributed memory one. Cormen [5] analyzes permutations, a very common data ....
....assigned to the various processors will define the search strategy. We envision two ways of assigning pages: 1. Pages are statically assigned to a given processor (or VP) and stay there; 2. Pages move around. Each page has a manager that keeps track of its location (as proposed by Kai Li [7]) Copies may or may not be allowed. If we allow copies, some extra management is required in order to avoid consistency problems. The cost of moving pages, instead of a few bytes, between processors may only be compensated if this page will be referenced frequently enough. These two strategies ....
[Article contains additional citation context not shown here]
K. Li. SharedVirtual Memory on Loosely-coupled Multiprocessors. PhD thesis, Yale University, October 1986.
LOTS: A Software DSM Supporting Large Object Space - Cheung, Wang, Lau (2004) Self-citation (Li) (Correct)
No context found.
Kai Li. Shared Virtual Memory on Loosely Coupled Multiprocessors. PhD thesis, Yale University, September 1986.
Heaps and Stacks in Distributed Shared Memory - Pizka Rehn Technische (Correct)
No context found.
Kai Li. Shared Virtual Memory on Loosely Coupled Multiprocessors. PhD thesis, Dep. of Computer Science, Yale University, New Haven, CT, October 1986.
Constituting the Need for Flexibility in - Distributed Operating Systems (Correct)
No context found.
Kai Li. Shared Virtual Memory on Loosely Coupled Multiprocessors. PhD thesis, Department of Computer Science, Yale University, New Haven, CT, October 1986.
Improving Distributed OS Performance by - Flexible Incremental Linking (Correct)
No context found.
Kai Li. Shared Virtual Memory on Loosely Coupled Multiprocessors. PhD thesis, Department of Computer Science, Yale University, New Haven, CT, October 1986.
Emulation of a Virtual Shared Memory Architecture - Raina (1993) (3 citations) (Correct)
No context found.
K. Li. Shared Virtual Memory on Loosely Coupled Multiprocessors. PhD thesis, Yale University, Sep. 1986.
Implementing Transparent Shared Memory on Clusters - Using Virtual Machines (Correct)
No context found.
K. Li. Shared Virtual Memory on Loosely Coupled Multiprocessors. Phd thesis, Yale Univ., Dept. of Computer Science, 1986. RR-492.
Implementing Transparent Shared Memory on Clusters - Using Virtual Machines (Correct)
No context found.
K. Li. Shared Virtual Memory on Loosely Coupled Multiprocessors. Phd thesis, Yale Univ., Dept. of Computer Science, 1986. RR-492.
Process Migration based on Gobelins Distributed Shared .. - Vallee, Morin.. (2002) (2 citations) (Correct)
No context found.
Kai Li. Shared Virtual Memory on Loosely Coupled Multiprocessors. PhD thesis, Yale University, September 1986.
Murks - A POSIX Threads Based DSM System - Pizka, Rehn (2001) (2 citations) (Correct)
No context found.
Kai Li. Shared Virtual Memory on Loosely Coupled Multiprocessors. PhD thesis, Dep. of Computer Science, Yale University, New Haven, CT, October 1986.
An Evaluation of the Influence of Cache-Only Write Detection .. - Marino, de Campos (Correct)
No context found.
Li K, Shared Virtual Memory on Loosely Coupled Multiprocessors, PHD Thesis, Yale University, 1986.
Improving Distributed OS Performance by Flexible Incremental Linking - Pizka (Correct)
No context found.
Kai Li. Shared Virtual Memory on Loosely Coupled Multiprocessors. PhD thesis, Department of Computer Science, Yale University, New Haven, CT, October 1986.
Performance Analysis Environment for SVM-Fortran Programs - Gerndt (1994) (Correct)
No context found.
K. Li, Shared Virtual Memory on Loosely Coupled Multiprocessors, Ph.D. Dissertation, Yale University 1986, Technical Report YALEU/DCS/RR-492
Murks - A POSIX Threads Based DSM System - Pizka, Rehn (2001) (2 citations) (Correct)
No context found.
Kai Li. Shared Virtual Memory on Loosely Coupled Multiprocessors. PhD thesis, Dep. of Computer Science, Yale University, New Haven, CT, October 1986.
Modules, Objects and Distributed Programming: Issues in RPC.. - Levy, Tempero (1991) (1 citation) (Correct)
No context found.
K. Li, `Shared virtual memory on loosely coupled multiprocessors', Ph.D. Thesis, Yale University, September 1986. YALEU/DCS/RR-492.
Software---Practice And Experience, Vol. 24(1).. - Automating Data.. (Correct)
No context found.
K. Li, `Shared virtual memory on loosely coupled multiprocessors', Ph.D. Thesis, Department of Computer Science, Yale University, 1986.
MIRAGE+: A Kernel Implementation of Distributed Shared Memory.. - Fleisch, Hyde (1994) (2 citations) (Correct)
No context found.
Kai Li, `Shared virtual memory on loosely coupled multiprocessors', Ph.D. dissertation, Yale University, September 1986.
An Asynchronous Protocol for Release Consistent Distributed.. - Yeo, Yeom, Park (Correct)
No context found.
K. Li, Shared Virtual Memory on Loosely Coupled Multiprocessors. PhD thesis, Department of Computer Science, Yale University, Sep. 1986.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC