"분산 알고리즘"의 두 판 사이의 차이

수학노트
둘러보기로 가기 검색하러 가기
(→‎노트: 새 문단)
 
(→‎메타데이터: 새 문단)
11번째 줄: 11번째 줄:
 
===소스===
 
===소스===
 
  <references />
 
  <references />
 +
 +
== 메타데이터 ==
 +
 +
===위키데이터===
 +
* ID :  [https://www.wikidata.org/wiki/Q2835898 Q2835898]

2020년 12월 26일 (토) 04:38 판

노트

  1. A distributed algorithm is an algorithm designed to run on computer hardware constructed from interconnected processors.[1]
  2. In the latter two cases, the resulting distributed algorithms are shown to be equivalent.[2]
  3. The distributed algorithms have been designed to be nearly indistinguishable from the single machine versions.[3]
  4. The distributed algorithms respect all of the usual parameters.[3]
  5. There are a few things to be aware of when using distributed algorithms, though.[3]
  6. As we noted earlier, distributed algorithms work best if all of the workers give very similar performance.[3]
  7. Second, we derive multiple candidate distributed algorithms for network repair.[4]
  8. Agent system is adopted for distributed algorithm .[5]

소스

메타데이터

위키데이터