所属专题: Computer Architecture and Systems

• Articles • 上一篇    下一篇

Adaptive Memory Coherence Algorithms in DSVM

周建强; 谢立; 戴非; 孙钟秀;   

  1. Depariment of Computer Science; Nanjing University; Nanjing 210008;
  • 出版日期:1994-07-10 发布日期:1994-07-10

Adaptive Memory Coherence Algorithms in DSVM

Zhou Jianqiang; Xie Li; Dai Fei; Sun Zhongxiu;   

  1. Depariment of Computer Science; Nanjing University; Nanjing 210008;
  • Online:1994-07-10 Published:1994-07-10

Based on the characteristics of distrubuted system and the behavior of parallelprograms, this paper presents the fixed and randofored competitive memory coherence algorithms for distributed shared virtual memory These algorithms exploit parallel programs' locality of reference and dribit good competitive property Our simulation shows that the fixed and randomized algorithms achieve better performance and higher stability than other strategies such as write-invalldate and write-update.

关键词: duration graphs, approximation, digitization, model checking

Abstract: Based on the characteristics of distrubuted system and the behavior of parallelprograms, this paper presents the fixed and randofored competitive memory coherence algorithms for distributed shared virtual memory These algorithms exploit parallel programs' locality of reference and dribit good competitive property Our simulation shows that the fixed and randomized algorithms achieve better performance and higher stability than other strategies such as write-invalldate and write-update.

Key words: model checking, duration graphs, approximation, digitization



[1] Karlin.A.R, Manasse.M.S, Rudolph.L, Sleator.D.D. Competitive snoopy caching. Algorithmica, 1988,3: 79-119.

[2] Li Kai, Hudak Paul. Memory coherence in shared virtual memory systems. ACM Tlnns. Cormputer Systems, 1989, 7(4): 321-359.

[3] Karlin.A.R, Manasse.M.S, McGeoch.L, Owicki.S. Competitive randomized algorithms for non-uniform programs. In:The 1st Annual ACM Symp.on Discrete Algorithms,1989, pp.301-309. ……….
[1] . 暂缺[J]. , 2008, 23(5 ): 711-718 .
[2] . 一类约束Facility Location问题的计算复杂性和近似算法[J]. , 2008, 23(5 ): 740-748 .
[3] . 暂缺[J]. , 2008, 23(5 ): 749-762 .
[4] . 一种基于链暗示技术的二分图受约束最小点覆盖近似算法[J]. , 2008, 23(5 ): 763-768 .
[5] . CTL*的有界模型检测[J]. , 2007, 22(1): 39-43 .
[6] . 直接模型检测矩阵算法[J]. , 2006, 21(6): 944-949 .
[7] . 暂缺[J]. , 2006, 21(5): 765-775 .
[8] . 暂缺[J]. , 2006, 21(3): 418-429 .
[9] . 时间自动机的模型检验中消除无关原子约束[J]. , 2006, 21(1): 41-51 .
[10] . 求解 Steiner 连通支配集问题的近似算法研究[J]. , 2005, 20(5): 713-716 .
[11] . [J]. , 2005, 20(1): 0-0.
[12] . [J]. , 2005, 20(1): 0-0.
[13] . [J]. , 2005, 20(1): 0-0.
[14] . [J]. , 2004, 19(6): 0-0.
[15] . [J]. , 2004, 19(6): 0-0.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
[1] 孟力明; 徐晓飞; 常会友; 陈光熙; 胡铭曾; 李生;. A Tree-Structured Database Machine for Large Relational Database Systems[J]. , 1987, 2(4): 265 -275 .
[2] 黎仁蔚;. Soundness and Completeness of Kung s Reasoning Procedure[J]. , 1988, 3(1): 7 -15 .
[3] Andrew I. Adamatzky;. Identification of Nonstationary Cellular Automata[J]. , 1992, 7(4): 379 -382 .
[4] 马军; 马绍汉;. Efficient Parallel Algorithms for Some Graph Theory Problems[J]. , 1993, 8(4): 76 -80 .
[5] 金国华; 陈福接. On the Problem of Optimizing Parallel Programs for Complex Memory Hierarchies[J]. , 1994, 9(1): 1 -26 .
[6] 张松懋;. Weak Precedence Story Parsing Grammar[J]. , 1995, 10(1): 53 -64 .
[7] 许满武; 陆剑锋; 曾凡聪; 戴劲雯;. A Formal Semantics for DAI Language NUML[J]. , 1995, 10(3): 227 -238 .
[8] 张中;. Simulation of ATPG Neural Network and Its Experimental Results[J]. , 1995, 10(4): 310 -324 .
[9] 姚殊; 张钹;. Situated Learning of a Behavior-Based Mobile Robot Path Planner[J]. , 1995, 10(4): 375 -379 .
[10] 徐殿祥; 郑国梁;. Towards a Declarative Semantics of Inheritance with Exceptions[J]. , 1996, 11(1): 61 -71 .
版权所有 © 《计算机科学技术学报》编辑部
本系统由北京玛格泰克科技发展有限公司设计开发 技术支持:support@magtech.com.cn
总访问量: