Y. Zhou, L. Iftode, and K. Li. Performance Evaluation of Two Home-Based Lazy Release Consistency Protocols for Shared Memory Virtual Memory Systems. In Proc. of the OSDI'96, pp. 75--88, Oct 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....processors all store this copy at the same virtual address. The protocol is based on self invalidation, which means the cached copy of a region remains valid until the thread itself invalidates the copy, which occurs whenever it reaches a synchronization point. Jackal combines features of HLRC [28] and TreadMarks [14] As in HLRC, modifications are flushed to a home node; as in TreadMarks, twinning and diffing are used to allow concurrent writes to shared data. Unlike TreadMarks, Jackal uses software access checks inserted before each object usage to detect non local or stable data. The ....

Y. Zhou, L. Iftode, and K. Li. Performance evaluation of two home-based lazy release-consistency protocols for shared virtual memory systems. In Proceedings 2nd USENIX Symposium on Operating Systems Design and Implementation, pages 75--88, 1996.

....becomes inappropriate, as it requires communicating processors to synchronize at the communication point. The model should also facilitate buffer management for asynchronous messages if the requestreply behavior is to be relaxed as in page based software DSMs such as ADSM [12] AEC [16] or HLRC [17], where some form of update coherence is applied. This restriction makes the remote memory write model (VMMC2) inadequate, since neither senders nor receivers can control the receive buffer usage. In order to avoid overwriting messages in this model, a large amount of buffer space must be coupled ....

Y. Zhou, L. Iftode, and K. Li. Performance Evaluation of Two Home-Based Lazy Release Consistency Protocols for Shared Memory Virtual Memory Systems. In Proceedings of the 2nd OSDI, October 1996.

....12.75s CLASS=A MPICH 111.91s 46.71s 28.01s CC MPI 40.19s 21.34s 11.23s Table 5: Execution time for FT with di#erent MPI libraries, di#erent number of nodes and di#erent problem sizes. SDSM is built within the Filaments package [22] and uses an eager version of home based release consistency [33]. We tested the potential of using Level 1 compiled communication for MPI Alltoallv to implement exchange of page information through a synthetic application that first modifies a set number of pages on each node and then invokes a barrier. The barrier causes all pages to be made consistent ....

Y. Zhou, L. Iftode, and K. Li. Performance Evaluation of Two Home-based Lazy Release Consistency Protocols for Shared Memory Virtual Memory Systems. In Proc. of the 2nd Symp. on Operating Systems Design and Implementation (OSDI'96), pages 75--88, 1996.

....main memory without interrupting the remote host processor. VMMC also tolerates transient network errors by using packet retransmission, and guarantees FIFO message delivery. 3.2. Original SVM protocol The original SVM protocol, GeNIMA [5] is based on home based lazy release consistency (HLRC) [34] and is designed to take advantage of a number of architectural features in modern clusters and system area networks. In order to comply with the partial order requirements of LRC for shared memory accesses [18] the application execution of each processor on each node is partitioned into time ....

....on each node is partitioned into time intervals that are delimited by consecutive release operations executed by threads on the same SMP. During each time interval all local page updates are recorded into a common update list. Shared pages in GeNIMA are assigned a home node according to HLRC [34], to which writers send their page updates eagerly, upon a release. Nodes propagate page updates in the form of diffs, which consist of the modifications applied to the version of the page before its first write (also called the twin) Diffs address the problem of false sharing as they allow ....

Y. Zhou, L. Iftode, and K. Li. Performance evaluation of two homebased lazy release consistency protocols for shared virtual memory systems. In Proc. of the 2nd Symp. on Operating Systems Design and Implementation, pages 75--88, 1996.

....The final adaptive protocol used in Brazos is an adaptive page management mecha nism. Some previous studies have shown that distributed page based systems outper form home based page systems [27] while yet other studies have argued that home based page systems offer superior performance [53]. We have elected to provide an adaptive mechanism whereby those pages better suited to a home based management technique can switch from the default distributed algorithm. To determine when a page should change page management mechanisms, processes continually monitor the size of the diffs being ....

Y. Zhou, L. Iftode, and K. Li. Performance evaluation of two home-based lazy release consistency protocols for shared virtual memory systems. In Proceedizgs of the Secod USENIX Slmposium o Operatig Slstem Desig ad Implemem tation, pages 75 88, November 1996.

....runtime system. If a processor runs out of free physical memory, it initiates a global garbage collection that frees both Java objects and physical memory pages. 3. 3 Coherence Protocol and Access Checks Jackal employs an invalidation based, multiple writer protocol that combines features of HLRC [29] and TreadMarks [17] As in HLRC, modifications are flushed to a home node; as in TreadMarks, twinning and diffing is used to allow concurrent writes to shared data. Unlike TreadMarks, Jackal uses software access checks inserted before each object array usage to detect non local and stale data. ....

Y. Zhou, L. Iftode, and K. Li. Performance Evaluation of Two Home-Based Lazy Release-Consistency Protocols for Shared Virtual Memory Systems. In 2nd USENIX Symp. on Operating Systems Design and Implementation, pages 75--88, Seattle, WA, October 1996.

....the probability of system failures increases as the system size grows. This existence of vulnerability is unacceptable, especially for long running applications and high availability situations. Hence, a mechanism for supporting fast crash recovery in SDSM is indispensable. Home based SDSM [18] is one type of SDSM developed under the notion of relaxed memory consistency model [1] While it relies on a virtual memory trap as other SDSM systems [2, 5] home based SDSM assigns a home node for each shared memory page to collect updates from all writers of that page. This home node offers ....

....fault nor requires any summary of write modifications, ii) it takes only one round trip message to bring a remote copy of any shared memory page up to date, and (iii) no garbage collection is needed. Due to these advantages, the home based SDSM protocol has been a focus of several recent studies [7, 10, 14, 18]. Unfortunately, no prior work has ever been attempted on crash recovery in home based SDSM. This paper is the very first one to deal with crash recovery in such SDSM. Message logging is a popular technique for providing home less SDSM with fault tolerant capability [6, 11, 12, 13, 17] This ....

[Article contains additional citation context not shown here]

Y. Zhou, L. Iftode, and K. Li. Performance Evaluation of Two Home-Based Lazy Release Consistency Protocols for Shared Virtual Memory Systems. In Proc. of the 2nd USENIX Symp. on Operating Systems Design and Implementation (OSDI), pages 75--88, October 1996.

....runtime system. If a processor runs out of free physical memory, it initiates a global garbage collection that frees both Java objects and physical memory pages. 3. 3 Coherence Protocol and Access Checks Jackal employs an invalidation based, multiple writer protocol that combines features of HLRC [26] and TreadMarks [15] As in HLRC, modifications are flushed to a home node; as in TreadMarks, twinning and diffing is used to allow concurrent writes to shared data. Unlike TreadMarks, Jackal uses software access checks inserted before each object array usage to detect non local and stale data. ....

Y. Zhou, L. Iftode, and K. Li. Performance Evaluation of Two Home-Based Lazy Release-Consistency Protocols for Shared Virtual Memory Systems. In 2nd USENIX Symp. on Operating Systems Design and Implementation, pages 75--88, Seattle, WA, October 1996.

....but also enhances scalability because it enables computing nodes to be used as backup nodes while performing useful computation. We use as our starting point the GeNIMA shared virtual memory system [4] that has been optimized for this type of interconnects. GeNIMA is a home based protocol [26, 19] that was shown to provide scalable performance to the 64 processor level [9] We extend GeNIMA by introducing additional operations to guarantee consistency in the presence of failures. GeNIMA, as well as our extensions use low overhead direct remote operations (read, write) provided by ....

....safely given that the execution replay starts after the last release performed locally and there has been no other release until the point of failure. 3 Original SVM Protocol The original shared virtual memory protocol, GeNIMA [4] is based on home based lazy release consistency (HLRC) [26] and is designed to take advantage of a number of architectural features in modern clusters and system area networks. In order to comply with the partial order requirements of LRC for shared memory accesses [10] the application execution of each processor on each node is partitioned into time ....

[Article contains additional citation context not shown here]

Y. Zhou, L. Iftode, and K. Li. Performance evaluation of two home-based lazy release consistency protocols for shared memory virtual memory systems. In Proc. of the 2nd Symp. on Operating Systems Design and Implementation (OSDI'96), pages 75--88, 1996.

....targeting both scientific and commercial applications. Shared memory clusters are an attractive approach to providing a#ordable and scalable compute cycles and I O. For this reason, there has recently been a lot of work on designing e#cient shared virtual memory (SVM) protocols for such clusters [23,16,26,13]. These protocols take advantage of features provided by SANs, such as low latencies for short messages and direct remote memory operations with no remote processor intervention [12,10,9] to improve system performance and scalability [16] Providing a shared memory programming abstraction on ....

.... improve system performance and scalability [16] Providing a shared memory programming abstraction on clusters has made it easier to run applications that have been written for more traditional, tightly coupled multiprocessors (both shared bus and distributed shared memory machines) Recent work [23,16,26] has shown that the performance of SVM clusters is competitive for wide ranges of applications to more traditional, tightly coupled multiprocessors. For instance, the authors in [16] find that a 64 processor cluster o#ers, for most SPLASH 2 [24] applications (after a number of optimizations) at ....

[Article contains additional citation context not shown here]

Y. Zhou, L. Iftode, and K. Li. Performance evaluation of two home-based lazy release consistency protocols for shared virtual memory systems. In Proceedings of the Operating Systems Design and Implementation Symposium, Oct. 1996.

....consistent software shared memory layer on top of 8 processor SMP nodes. They find that the cost for page invalidations within each node is very high. Another study examined the all software home based HLRC and the original Treadmarks protocols on a 64 processor Intel Paragon multiprocessor [17]. This study focused on the ability of a communication coprocessor to overlap protocol processing with useful computation in the two protocols but it also compared the protocols at this large scale. However, the architectural features and performance parameters of the Paragon system and its ....

Y. Zhou, L. Iftode, and K. Li. Performance evaluation of two home-based lazy release consistency protocols for shared virtual memory systems. In Proceedings of the Operating Systems Design and Implementation Symposium, Oct. 1996.

No context found.

Y. Zhou, L. Iftode and K. Li. Performance Evaluation of Two Home-Based Lazy Release Consistency Protocols for Shared Memory Virtual Memory Systems. In Proc. of the 2nd Symposium on Operating Systems Design and Implementation (OSDI'96), pages 75-88, October 1996.

No context found.

Y. Zhou, L. Iftode, and K. Li. Performance evaluation of two home-based lazy release consistency protocols for shared virtual memory systems. In Proceedings of the Operating Systems Design and Implementation Symposium, October 1996.

....the page in the form of diffs to the faulting processor. The faulting processor then applies these updates in order as specified by the timestamps attached, so that the clean copy of the page can be obtained. Figure 3(b) shows the events for serving a page fault in a homeless protocol. Research [11] shows that the home based protocol is more efficient than the homeless protocol by sending fewer messages in the network. In particular, it reduces the communication overhead in serving a page fault by requesting only one processor for a copy of the page. Moreover, home based protocols are easier ....

....only. Although AURC is dedicated to the SHRIMP multicomputer, which possesses a specialized automatic update hardware, the idea of a home for each shared memory page inspires later research efforts. The most remarkable one is the home based lazy release protocol (HLRC) proposed by Zhou and Iftode [11], which is a protocol implementing lazy release consistency using the home based approach, with no specialized hardware support needed. We have discussed the underlying concept adopted by HLRC when the home based protocol is introduced in Section 2.2. Zhou and Iftode also showed in their paper ....

Y. Zhou, L. Iftode and K. Li. Performance Evaluation of Two Home-Based Lazy Release Consistency Protocols for Shared Memory Virtual Memory Systems. In Proc. of the 2nd Symposium on Operating Systems Design and Implementation (OSDI'96), pages 75-88, October 1996.

....include release consistency [10] entry consistency [2] scope consistency [13] Lazy release consistency(LRC) 15] is a software implementation of release consistency which delays the coherence action until the acquire time. Most software shared systems today use LRC based protocols [14] 11] [30] [16] These consistency models employ sophisticated protocols to reduce false sharing and fragmentation. An alternative approach is to preserve the simplicity of sequential consistency, but nd some approach to reduce the coherence granularity. Examples of providing negrained access control ....

....with ne grained access control hardware that supports multiple sizes of coherence granularity. We studied the combinations of three consistency protocols (sequential consistency (SC) 17] single writer lazy release consistency (SW LRC) 16] and home based lazy release consistency (HLRC) [30]) with four sizes of coherence granularity. We also studied two mechanisms (polling and interrupt) to handle message arrivals for each case. Our experiments used eight real benchmarks developed for hardware shared memory systems and their variations(so total 12 applications) Our applications ....

[Article contains additional citation context not shown here]

Y. Zhou, L. Iftode, and K. Li. Performance Evaluation of Two Home-Based Lazy Release Consistency Protocols for Shared Virtual Memory Systems. In Proceedings of the Operating Systems Design and Implementation Symposium, October 1996. 14

No context found.

Y. Zhou, L. Iftode, and K. Li. Performance Evaluation of Two Home-Based Lazy Release Consistency Protocols for Shared Memory Virtual Memory Systems. In Proc. of the OSDI'96, pp. 75--88, Oct 1996.

No context found.

Zhou, Y, et alli. Performance Evaluation of Two Home-based Lazy Release Consistency Protocols for Shared Virtual Memory Systems. OSDI, Oct 1996.

No context found.

Zhou, Y, et alli. Performance Evaluation of Two Homebased Lazy Release Consistency Protocols for Shared Virtual Memory Systems. OSDI, Oct 1996.

No context found.

Y. Zhou, L. Iftode, and K. Li. Performance Evaluation of Two Home-Based Lazy Release Consistency Protocols for Shared Memory Virtual Memory Systems. In Proc. of the 2nd Symp. on Operating Systems Design and Implementation (OSDI'96), pages 75--88, 1996.

No context found.

Y. Zhou, L. Iftode, and K. Li, "Performance evaluation of two home-based lazy release consistency protocols for shared virtual memory systems," in Proc. of OSDI, 1996.

No context found.

Y. Zhou, L. Iftode, and K. Li. Performance evaluation of two home-based lazy release consistency protocols for shared virtual memory systems. In ACM OSDI, 1996.

No context found.

Y. Zhou, L. Iftode, and K. Li. Performance Evaluation of Two Home-Based Lazy Release Consistency Protocols for Shared Memory Virtual Memory Systems. In Proc. of the 2nd Symp. on Operating Systems Design and Implementation (OSDI'96), pages 75--88, 1996.

No context found.

Y. Zhou, L. Iftode, and K. Li. Performance Evaluation of Two Home-Based Lazy Release Consistency Protocols for Shared Memory Virtual Memory Systems. In Proc. of the 2nd Symp. on Operating Systems Design and Implementation (OSDI'96), pages 75--88, October 1996.

No context found.

Y. Zhou, L. Iftode, and K. Li. Performance Evaluation of Two Home-based Lazy Release Consistency Protocols for Shared Memory Virtual Memory Systems. In Proc. of the 2nd Symp. on Operating Systems Design and Implementation (OSDI'96), pages 75--88, 1996.

No context found.

Y. Zhou, L. Iftode and K. Li. Performance Evaluation of Two Home-Based Lazy Release Consistency Protocols for Shared Virtual Memory Systems. In the 2nd Symposium on Operating Systems Design and Implementation, Octobre 1996.

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