• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2007, Vol. 29 ›› Issue (7): 128-133.

• 论文 • 上一篇    下一篇

k-组群通信成本的研究

陈君 黄干平   

  • 出版日期:2007-07-01 发布日期:2010-06-02

  • Online:2007-07-01 Published:2010-06-02

摘要:

Kakugana在文献[1]引入k-组群(k-Coteries)的概念来解决分布系统中的k-互斥问题。本文研究使用k-组群技术解决k-互斥问题时的通信成本,它是单个组群通信成本的扩  展。在对k-组群通信成本进行精确定义并给出受支配和不受支配k-组群的概念之后,本文证明了不受支配k-组群的通信成本不会大于它所支配的k-组群的通信成本,据此定理  ,给出了获得通信成本最小k-组群的方法。

关键词: 分布互斥 组群 k-组群 通信成本

Abstract:

Kakugawa et al introduced the concept of k-coteries to solve the k-mutex problem in distributed systems. In this paper,we define the communication cos t of a k-coterie as an extension to the communication cost of a coterie. After this, we give the conceptions of dominated and norrdominated k-coteries and prove that the communication cost of a k-coterie cannot exceed that of the k-coterie it dominates. Based on this theorem, we introduce a method of ob taining delay-optimal k-coteries.

Key words:  (distributed mutual exclusion, coterie, k-coterie, communication cost)