J. Kim, N. Vaidya. A cost-comparison approach for adaptive distributed shared memory. In Proceedings of the 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....executable that contains all of the different paths. 7. 2 Adaptive Execution Techniques Many other researchers have recognized the need to use dynamic performance data to optimize the execution of programs [Dubnicki and LeBlanc 1992; Cox and Fowler 1993; Romer et al. 1994; Saavedra and Park 1996; Kim and Vaidya 1996; Falsafi and Wood 1997] Some of the adaptive execution approaches described in the literature can be viewed as using control theoretic approaches to select the values of variables that control the behavior of a parameterized algorithm. Typically, the programmer defines a set of observable ....

....authors do not describe a clear feedback mechanism and adaptation strategy. In the context of consistency protocols for distributed shared memory machines, researchers have developed systems that measure the behavior of the program to gather statistics about the pages that the program accesses [Kim and Vaidya 1996; Falsafi and ACM Transactions on Computer Systems, Vol. 17, No. 6, May 1999. Eliminating Synchronization Overhead Using Dynamic Feedback Delta 33 Wood 1997] These systems use the gathered statistics to dynamically select a memory consistency protocol for each page. The SCI standard uses a ....

KIM, J.-H. AND VAIDYA, N. H. 1996. A cost-comparison approach for adaptive distributed shared memory. In Proceedings of the 1996 ACM International Conference on Supercomputing. ACM Press, New York, NY.

....it imposes undue burden on the programmer. An adaptive implementation that automatically chooses the appropriate protocol (at run time) for each shared memory page will ease the task of programming for DSM. We have developed a simple but effective approach for implementing adaptive DSM [9]. This approach is similar to adaptive mechanisms used to solve many other problems. This work is supported in part by the National Science Foundation under grant MIP 9502563. Our scheme can be summarized as follows: 1. Collect statistics over a sampling period . Accesses to each memory page ....

....Quarks (Beta release 0.8) 1, 6] Experimental results show that our adaptive scheme performs well. This results suggest that our adaptive scheme can predict the optimal consistency protocol accurately when memory access patterns do not change frequently. Further measurements are presented in [9]. We plan to evaluate the impact of our adaptive scheme on execution time of the applications. 3 Adaptive Migratory Scheme On a migratory sharing, a message for sending a copy of a page to a remote node, on which a page fault occurs, is directly followed by an invalidation request from the remote ....

J.-H. Kim and N. H. Vaidya, "A cost-comparison approach for adaptive distributed shared memory," in ACM International ConferenceonSupercomputing (ICS), pp. 44--51,May 1996.

....Science Foundation under grant MIP 9502563. 1 Introduction This report presents an adaptive migratory DSM algorithm which can dynamically selfinvalidate local copy of a page on a migratory memory access pattern. The adaptive migratory algorithm is implemented based on our previous work [9] which can adapt to memory access patterns to reduce coherency overhead by adjusting update limit . Adaptive DSM [9] outperforms a competitive update protocol as well as an invalidate protocol and an update protocol in many types of applications. However, 9] can not adapt to a migratory memory ....

....which can dynamically selfinvalidate local copy of a page on a migratory memory access pattern. The adaptive migratory algorithm is implemented based on our previous work [9] which can adapt to memory access patterns to reduce coherency overhead by adjusting update limit . Adaptive DSM [9] outperforms a competitive update protocol as well as an invalidate protocol and an update protocol in many types of applications. However, 9] can not adapt to a migratory memory access pattern. On a migratory sharing, a message for sending a copy of a page to a remote node, on which a page fault ....

[Article contains additional citation context not shown here]

J.-H. Kim and N. H. Vaidya, "A cost-comparison approach for adaptive distributed shared memory," in ACM International Conference on Supercomputing (ICS), pp. 44-- 51, May 1996.

....Abstract This paper presents a new cost analysis model for distributed shared memory (DSM) using competitive update protocol. The cost metric of interest here is the overhead of message passing necessary to implement DSM. This approach is based on segment model proposed previously [10, 11]. Input parameter for the cost analysis model proposed here is the probability density function of the number of remote updates in a segment. This distribution can quite accurately characterize many applications. The proposed model is validated by comparing analytical results obtained using the ....

....traditional invalidate protocol. Thus, selecting appropriate limit L is important in the competitive update protocol. This paper presents a new cost analysis model for the competitive update protocol. This model is based on probability density function (pdf) for number of updates in a segment [10, 11] a segment for page P is defined as the sequence of remote updates to page P between two consecutive local access of page P by a node. More accurately, a new segment begins with the first local access by a node following an update to the page by another node. Segments are defined from the point ....

J.-H. Kim and N. H. Vaidya, "A cost-comparison approach for adaptive distributed shared memory," in Proc. of 1996 International Conference on Supercomputing, pp. 44--51, May 1996.

No context found.

J. Kim, N. Vaidya. A cost-comparison approach for adaptive distributed shared memory. In Proceedings of the 1996.

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