K. Li. IVY: A Shared Virtual Memory System for Parallel Computing. Proceedings of the 1988.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....facility, the MBP has various features to reduce overheads on the DSM and to lower the hardware cost of the system. The details are given in Chapter 2. 1.2 Software DSM In 1988 K. Li developed a new software solution for the generation of shared virtual spaces on clusters of PCs [32] by exploiting the memory page management mechanisms of the processors. In recent generations, high end microprocessors have included page management units, and illegal access to pages which are not mapped or allowed for the allocated task (process) is detected by page traps. K. Li exploited this ....

....memory references and as main memory for local data. The system thus has hierarchical cache system: the on chip caches of the processors (L1 caches) are at level 1, snoop caches (L2 caches) are at level 2 and the memory banks of the nodes are at level 3. Page level directory schemes such as IVY[32] were used in the MBP systems instead of cache block level directory schemes [31] in order to reduce the amount of directory memory and to use translation look aside buffers (TLBs) to accelerate consistency preserving operations. The unit of data transmission, however, is the size of an L1 cache ....

K. Li. IVY: A Shared Virtual Memory System for Parallel Computing. In Proc. of the 1988.

....over 8 word blocks, allowing different blocks within the same mapped page to be in different states. This fine grain control over data is similar to that provided in hardware based cache coherent multiprocessors, and alleviates the false sharing that exists in other software data coherence systems [21]. The two block status bits are used to encode the following four states: INVALID: The block may not be read, written, or placed in the hardware cache. READ ONLY: The block may be read, but not written. READ WRITE: The block may be read or written. DIRTY: The block may be read or written, ....

....KSR 1 [9] perform a function similar to that of the block status bits of the M Machine. Implementing remote memory access and coherence completely in software on a conventional processor would involve delays much greater than those shown in Table 1, as evidenced by experience with the Ivy system [21]. The M Machine s fast exception handling in a dedicated H Thread avoids the delay associated with context switching and allows the user thread to execute in parallel with the exception handler. The GTLB avoids the overhead of manual translation and the cost of a system call to access the network. ....

LI, K. Ivy: A shared virtual memory system for parallel computing. In International Conference on Parallel Processing (1988), pp. 94-101.

....but no consis tency. Moving the distribution functionality into the OS is an interesting alternative. This can be achieved by a Distributed Shared Memory (DSM) mechanism providing a virtual address space shared among tasks on loosely coupled processors, like introduced by Keedy [1] and Li [2]. The application programmer is offered a transparent view at shared data on several nodes connected via a network. Regular pointers are used for both local and remote memory accesses. OS and memory management hardware jointly will detect a remote memory access, fetch the desired memory block and ....

....software or hardware based systems and hybrid architectures have been de veloped [4] We do not attempt to give a com prehensive perspective of the state of DSM systems in this section. However, because Plurix is a page based system we shortly review some representative paged based systems: IVY [2], Mirage [5] and TreadMarks [6] Page based DSM systems detect memory accesses to pages by using the protection features of the MMU. MMU hardware support can substantially speed up program execution in comparison to software based implementations but it is afflicted by the false sharing problem. ....

[Article contains additional citation context not shown here]

K. Li. IVY: A Shared Virtual Memory System for Parallel Computing. In Proceedings of the International Conference on Parallel Processing, 1988.

....Machine (JVM) like JavaOS does [1] Herewith we gain efficiency and speed. Language based OS development has been successfully demonstrated by native Oberon [2] and others. The well known Distributed Shared Memory (DSM) paradigm offers a natural solution for distributing data among several nodes [3]. Applications running on top of a DSM are not aware of data locations. Any reference can either point to a local or a remote memory block. During program execution the OS detects a remote memory access and automatically fetches the desired memory block. Plurix implements a page based DSM using ....

K. Li, "IVY: A Shared Virtual Memory System for Parallel Computing", Int. Conference on Parallel Processing, 1988.

....a lean distributed Operating System (OS) from scratch for the PC platform. We suggest that the distribution functionality should be moved into the OS and not be reimplemented by each distributed application. This is achieved using the wellknown Distributed Shared Memory (DSM) paradigm [1] [2]. A DSM provides a virtual address space shared among tasks on loosely coupled nodes. The distribution of data on several computers is not noticed by the application programmer. Any reference can either point to local or remote memory blocks. During program execution the OS or run time environment ....

K. Li, "IVY: A Shared Virtual Memory System for Parallel Computing", In Proceedings of the International Conference on Parallel Processing, 1988.

....evolution and version management for different type generations. KEY WORDS: Type Evolution, Persistence, Version Management, Object Oriented Languages. 1. INTRODUCTION The Plurix Operating System (OS) uses the well known Distributed Shared Memory (DSM) paradigm introduced by Keedy [1] and Li [2] and implements a new memory consistency model using restartable transactions in combination with an optimistic synchronization scheme [3] A primary research goal is to investigate the DSM as a general purpose communication medium e.g. for simplified development of distributed applications. ....

K. Li, "IVY: A Shared Virtual Memory System for Parallel Computing", International Conference on Parallel Processing, 1988.

....efficiency and speed. Furthermore Plurix is not implemented on top of an existing OS discarding any overhead caused by commercially justified backward compatibility The well known Distributed Shared Memory (DSM) paradigm offers a natural solution for distributing data among several nodes, 3] [4]. Applications running on top of the Plurix DSM are not aware of data locations. Any reference can either point to local or remote memory blocks. During program execution the OS detects a remote memory access and automatically fetches the desired block. A file system can be avoided by ....

K. Li, "IVY: A Shared Virtual Memory System for Parallel Computing", In Proceedings of the International Conference on Parallel Processing, 1988.

....results of an early prototype which was shown at the CeBIT 2000 trade fair. Keywords: Distributed Shared Memory, Network Protocols, Transactions, Optimistic Concurrency Control, Operating Systems, Plurix. 1. INTRODUCTION Plurix supports the concept of distributed virtual storage [5][6] where distributed memory access is transparent to the application. Remote object access is resolved automatically by the OS. This DSM concept simplifies development of distributed applications because explicit communication as used by Java RMI, DCOM or CORBA is avoided. Programming of distributed ....

K. Li. IVY: A Shared Virtual Memory System for Parallel Computing. In Proceedings of the International Conference on Parallel Processing, 1988.

....static software DSM approach appears to remain fairly limited. Dynamic Approaches Dynamic software DSM systems typically support a more general programming model than their static counterparts, typically allowing multiple independent threads of control to operate within the shared address space [4, 5, 11, 21, 37, 52, 75]. Given mechanisms for inter thread synchronization (e.g. semaphores, barriers) a programmer is able to express essentially any form of parallelism. For the most part, these systems utilize a data shipping paradigm in which threads of computation are relatively immobile and data items (or ....

.... Mostly Software Many software DSM systems are actually mostly software systems in which the hit miss check functionality is implemented in hardware (e.g. by leveraging off of virtual memory protection mechanisms to provide access control) Typical examples of mostly software systems include Ivy [52], Munin [11] and TreadMarks [38] coherence units in these systems are the size of virtual memory pages. Blizzard [70] implements a similar scheme on the CM 5 at the granularity of individual cache lines. By manipulating the error correcting code bits associated with every memory block, Blizzard ....

[Article contains additional citation context not shown here]

Kai Li. IVY: A Shared Virtual Memory System for Parallel Computing. In Proceedings of the International Conference on Parallel Computing, pages 94--101, 1988.

....for PHD. hierarchy worth of messages plus one direct data delivery message need to be sent for PHD as opposed to four traversals of the hierarchy worth of messages for the strict hierarchy. 1.4. 3 Ownership The concept of ownership [10] as used in this protocol was derived from both Li [16] [17] and Totty [27] An owner of a block is responsible for it. Any other node can only have a copy of the block, which can be asynchronously thrown away in order to make room for other blocks. That node can then inform the rest of the system at its leisure without affecting the correctness of the ....

Kai Li. IVY: A shared virtual memory system for parallel computing. In International Conference on Parallel Computing, pages 94-101, 1988.

....is thus given the illusion of a large global address space encompassing all available memory, eliminating the task of explicitly moving data between processes located on separate machines. Both hardware DSM systems (e.g. Alewife [15] DASH [36] FLASH [31] and software DSM systems (e.g. Ivy [37], Munin [13] TreadMarks [28] have been implemented. The majority of software DSM systems use page based memory protection hard ware and the low level message passing facilities of the host operating system to implement the necessary shared memory abstractions. Programmers write programs using ....

....this section we present a brief discussion of previous efforts to reduce the amount of communication necessary in software DSM systems. A detailed discussion of related work can be found in Chapter 5. 1.1. 1 Using Relaxed Consistency Models to Reduce Communication Early DSM systems, such as IVY [37], enforced sequential consistency [32] to maintain coherence between processes in a DSM system. Sequential consistency requires that each write be globally performed before the process issuing the write is allowed to proceed. This restriction severely limits the performance achievable by these ....

[Article contains additional citation context not shown here]

K. Li. Ivy: A shared virtual memory system for parallel computing. In Proceed- igs of the 1955.

No context found.

K. Li. IVY: A Shared Virtual Memory System for Parallel Computing. Proceedings of the 1988.

No context found.

K. Li. IVY: A Shared Virtual Memory System for Parallel Computing. In Proceedings of the International Conference on Parallel Processing, pp.94-101, August 1988.

No context found.

K. Li, "IVY: A Shared Virtual Memory System for Parallel Computing", Proceedings of the International Conference on Parallel Processing, 1988.

No context found.

K. Li. Ivy: A shared virtual memory system for parallel computing. In Proceedings of the 1988.

No context found.

K. Li, "IVY: A Shared Virtual Memory System for Parallel Computing", In Proceedings of the International Conference on Parallel Processing, 1988.

No context found.

K. Li, "IVY: A Shared Virtual Memory System for Parallel Computing", In Proceedings of the International Conference on Parallel Processing, 1988.

No context found.

K. Li, "IVY: A Shared Virtual Memory System for Parallel Computing", in: Proceedings of the International Conference on Parallel Computing, 1988.

No context found.

K. Li. IVY: A shared virtual memory system for parallel computing. Proceedings of the 1988.

No context found.

K. Li. IVY: A shared virtual memory system for parallel computing. In Proc. of the International Conference on Parallel Processing, pages 94--101, 1988.

No context found.

K. Li, \IVY: A Shared Virtual Memory System for Parallel Computing," in Proceedings of the International Conference on Parallel Computing, 1988, pp. 94-101.

No context found.

Kai Li. Ivy: A shared virtual memory system for parallel computing. In Proceedings of the 1988 International Conference on Parallel Processing, volume II Software, pages 94--101, August 1988.

No context found.

K. Li. IVY: A Shared Virtual Memory System for Parallel Computing. In Proc. of the 1988.

No context found.

K. Li, IVY: a shared virtual memory system for parallel computing, in: Proceedings of the International Conference on Parallel Processing (ICPP), vol. 2, 1989, pp. 94--101.

No context found.

Kai Li, `IVY: a shared virtual memory system for parallel computing', Proceedings 1988 International Conference on Parallel Processing, volume 2, August 1988, pp. 94--101.

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