The Approximate Agreement Problem of Massively Parallel Systems
博士 === 國立交通大學 === 資訊工程研究所 === 82 === An appropiate approach--neighborhood approach--is proposed forng an approximate agreement in massively prallel systems. Instead-to-all broadcasting that conventional approaches adopt, pproach requires only direct ne...
Main Authors: | Ren-Liang Cheng, 鄭仁亮 |
---|---|
Other Authors: | Chung-Ping Chung |
Format: | Others |
Language: | en_US |
Published: |
1994
|
Online Access: | http://ndltd.ncl.edu.tw/handle/69764168854156157955 |
Similar Items
-
The study of consistency problem for bus-connected multiprocessor systems
by: ZHENG, REN-LIANG, et al.
Published: (1987) -
Solving the stokes problem on a massively parallel computer
by: O. Axelsson, et al.
Published: (2001-06-01) -
Massive Parallelization of Multibody System Simulation
by: Michael Valášek, et al.
Published: (2012-01-01) -
Scalable Parallel Distributed Coprocessor System for Graph Searching Problems with Massive Data
by: Wanrong Huang, et al.
Published: (2017-01-01) -
PUMA: An Operating System for Massively Parallel Systems
by: Stephen R. Wheat, et al.
Published: (1994-01-01)