Quasi Asynchronous Parallel Process Migration Algorithm Based on Message Forwarding
-
摘要: 针对并行机群系统的进程迁移问题,提出了一种新的基于消息转发的类异步并行迁移算法, 该算法使用消息驱赶、消息转发、缓存优先匹配等多种机制,避免了一般类异步迁移算法集 中式管理,非迁移进程参与协调工作较多的缺点,通过算法描述和实验结果表明,该算法具 有迁移效率高、易于管理和控制、健壮性好等优点.Abstract: A new quasi-asynchronous parallel process migration algorithm based on message forwarding was presented to solve the problem of process migration in parallel c luster system. The algorithm used message driving out mechanism, message forward i n g mechanism, priority matching buffer mechanism, etc., to avoid the disadvantage s of central management and too much coordination of non-migrated process. The a lgorithm description and experiments show that it has the advantages of high eff iciency, easy management and control, and good robustness.
-
Key words:
- migration /
- communication channels /
- autonomy /
- parallel migration algorithm
-
[1] Dan P, Wang D S, Zhang Y H, et al. Quasi-asynchronous migration:A novel migration protocol for PVM tasks[J]. ACM Operating Systems Review, 1999, 33(2) :5~15 [2] Iskra K A, Linden F V D, Hendriske Z W, et al. The implementation of dynamite-an environment for migrating PVM tasks[J]. Operating Systems Review, 2000,34(3):40~55 [3] Stellner G, Pruyne J. Resource management and checkpointing for PVM. Proceedings of the 2nd European PVM Users' Group Meeting. France:Edit ion Hermes, 1995. 131~136 -
点击查看大图
计量
- 文章访问数: 1917
- HTML全文浏览量: 103
- PDF下载量: 8
- 被引次数: 0
下载:
