Earticle

초록

영어

Distributed computation follows the models of discrete structures in combinatorial forms. In higher-dimensions, the simplex structures of topological spaces as well as homology are employed to model and analyze distributed asynchronous computations. However, the monotone spaces are the general forms of topological spaces and can be effectively employed to analyze distributed computation. This paper proposes an analytical model of distributed computation in monotone spaces. It is illustrated that, the modeling of distributed computation in monotone spaces helps in determining consistent cuts under closure and convergence of computation. Furthermore, a connective mapping between the simplexes and monotone is constructed.

목차

Abstract
 1. Introduction
  1.1. Motivation
 2. Related Work
 3. Preliminary Concepts
 4. Definitions and Model
  4.1. Definition: Boundary Elements
  4.2. Definition: Computation in D
  4.3. Definition: Monotone Distributed Computing
  4.4. Definition: Connected Monotone
  4.5. Definition: Convergent Monotone
  4.6. Definition: Consistent Monotone
 5. Analytical Properties
  5.1 Theorem 1
  5.2 Theorem 2
  5.3 Theorem 3
  5.4 Theorem 4
  5.5 Theorem 5
  5.6 Theorem 6
 6. Comparative Analysis
  6.1 Inter-spaces map
 7. Conclusions
 References

키워드

저자

• Susmit Bagchi [ Department of Aerospace and Software Engineering (Informatics), Gyeongsang National University, Jinju, Republic of Korea ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Software Engineering and Its Applications

• 간기

  월간

• pISSN

  1738-9984

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605