Pete Keleher. Update Protocols and Cluster-based Shared Memory. Computer Communications, 22:1045--1055, July 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....speedup. In addition to the performance benefit, adaptive consistency protocols can also alleviate an application programmer of the burden to analyze an application to determine and specify the best protocol. We now discuss these works. 14 2.2. 1 CVM and Adaptive Protocols Keleher [Kel98, Kel99a] modified CVM to provide a access pattern based invalidate update hybrid protocol. The goal is to reduce fault latency for all shared data that a processor has accessed, under the pretense the processor will access that data in the future. Fault latency is the amount of time a processor must wait ....

....discusses conventional approaches to select the best consistency protocol for an application based on analysis of the application s shared data access patterns. Recently, a few DSM systems proposed using information about the access pattern to select the best protocol [MB98, ACD 99, Kel98, Kel99a] These systems have shown that this approach can lead to significant runtime speedups. However, these systems have several limitations. First, they are designed for LAN environments and do not consider issues that exist in WAN environments. For example, they do not consider how a protocol may ....

Pete Keleher. Update protocols and cluster-based shared memory. Computer Communications, 22(11):1045--1055, July 1999.

....diffs, quickly applies diffs, and minimizes the space used to store and transmit diffs. We show that the algorithm exhibits significantly reduced memory consumption and network costs when compared to existing differencing mechanisms. The basic method employed by all existing diff mechanisms, [5, 13, 18, 19] can be summarized as follows. Initially write access is disabled for the shared data region (we will refer to them as shared blocks) When a process attempts to modify the block, a write access fault occurs and invokes an interrupt handler. The handler creates an immutable copy of the block, ....

P. Keleher. Update protocols and cluster-based shared memory. In Computer Communications, volume 22, pages 1045-- 1055, July.

.... KY 40506 USA fdiaz,griffg dcs.uky.edu Abstract Distributed Shared Memory (DSM) systems often support exactly one consistency model for all shared data [ACD 96, BZS93] Some recent systems support adaptive consistency using heuristical analysis of recent access patterns [ACD 99, Kel98, Kel99a, Kel99b, MB98] Although approaches based on access patterns can significantly improve an application s performance, there are other factors besides access patterns that influence the performance of a consistency model, such as network bandwidth, congestion, latency and topology. These factors ....

....Unfortunately, an application is often stuck with whatever consistency model the DSM provides. Recent work has explored the concept of adaptive consistency in which the DSM observes the application s access patterns and then selects an appropriate consistency model [ACD 99, Kel98, Kel99a, Kel99b, MB98] While access patterns provide some hints about which consistency model is the best, they do not necessarily tell the whole story [DG00] Other factors such as the size of data writes and elements related to the computing environment, such as congested links, heavily loaded nodes, ....

[Article contains additional citation context not shown here]

Pete Keleher. Update protocols and clusterbased shared memory. Computer Communications, 22(11):1045--1055, Jul 1999.

....Distributed Shared Data Christopher Diaz and James Griffioen Department of Computer Science University of Kentucky Lexington, KY 40506 USA fdiaz,griffg dcs.uky.edu Abstract. Distributed Shared Memory (DSM) systems typically support one consistency protocol [3, 5, 6] However, recent work [1, 11, 12, 14, 17] proposes the use of adaptive consistency based on a heuristical analysis of recent access patterns. Although heuristic based approaches can significantly improve runtime, the access pattern alone does not necessarily define the most appropriate consistency protocol. The size of updates and ....

....of factors. In most systems, the application is stuck with whatever consistency protocol the DSM provides. Some recent work, however, has explored the concept of adaptive consistency in which the DSM observes the application s access pattern and then selects an appropriate consistency protocol [1, 11, 12, 14, 17]. Given an application s recent access pattern, the DSM uses heuristics to map the observed access pattern to a consistency protocol. For example, if a machine writes to shared data that is subsequently read by N other machines, the DSM may decide to use an updatebased approach, such as that used ....

[Article contains additional citation context not shown here]

Pete Keleher. Update protocols and cluster-based shared memory. Computer Communications, 22(11):1045--1055, July 1999.

....not use the network port and the interconnect. A shared memory approach, on the other hand, would suffer from high cost of data movement due to dynamic scheduling of the attributes among SMP nodes. It would also require a mechanism (e.g. a software or hardware distributed shared memory system [4, 9]) to manage the scheduling of attributes and to handle accesses to the data structures shared among nodes. 3.1 Data Distribution The training dataset is horizontally partitioned among the SMP nodes in the system so that each SMP node has N=P records [16] Here, N is the total number of records ....

P. Keleher. Update protocols and cluster-based shared memory. Computer Communications, 22(11):1045--1055, July 1999.

.... Data Technical Report CS300 00 Christopher Diaz James Griffioen Department of Computer Science University of Kentucky Lexington, KY 40506 USA fdiaz,griffg dcs.uky.edu Abstract Distributed Shared Memory (DSM) systems typically support one consistency model [3, 5, 6] However, recent work [1, 11, 12, 14, 16] proposes the use of adaptive consistency based on a heuristical analysis of recent access patterns. Although heuristic based approaches can significantly improve runtime, the access pattern alone does not necessarily define the most appropriate consistency model. The size of updates and other ....

....range of factors. In most systems, the application is stuck with whatever consistency model the DSM provides. Some recent work, however, has explored the concept of adaptive consistency in which the DSM observes the application s access pattern and then selects an appropriate consistency model [1, 11, 12, 14, 16]. Given an application s recent access pattern, the DSM uses heuristics to map the observed access pattern to a consistency model. For example, if a machine writes to shared data that is subsequently read by N other machines, the DSM may decide to use an updatebased approach (such as Eager Release ....

[Article contains additional citation context not shown here]

Pete Keleher. Update protocols and clusterbased shared memory. Computer Communications, 22(11):1045--1055, Jul 1999.

No context found.

Pete Keleher. Update Protocols and Cluster-based Shared Memory. Computer Communications, 22:1045--1055, July 1999.

No context found.

P. Keleher. Update protocols and cluster-based shared memory. Computer Communications, 22(11):1045--1055, July 1999.

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