| Document Date: 2007-11-27 04:34:37
Open Document File Size: 269,83 KBShare Result on Facebook
City Cambridge / Storrs / / Company Oracle / USA (e-mail / Currency pence / / / Event Product Issues / Product Recall / / Facility University of Connecticut / Technology Square / Massachusetts Institute of Technology / / IndustryTerm crash-prone processors / asynchronous shared-memory algorithm / parallel-time×processor product / distributed search / parallel algorithms / to each processor / physical crash-prone processors / efficient message-passing algorithm / message-passing algorithms / iterative algorithm / extant algorithms / synchronous processors / active processors / fault-prone processors / distributed computing / message-passing algorithm / arbitrary pram algorithms / failure-prone processors / synchronous shared-memory systems / virtual processors / synchronous failure-free processors / synchronous shared-memory algorithm / synchronous message-passing processors / synchronous shared-memory algorithms / fault-tolerant algorithm / ai processors / synchronous shared-memory computing / virtual processor / r-time shared-memory algorithm / specific algorithms / partitionable networks / failureprone processors / specific algorithm / obvious solution / processor algorithm / randomized solutions / failure-free algorithms / failure-free processors / efficient algorithms / physical processors / / Organization National Science Foundation / University of Connecticut / Massachusetts Institute of Technology / Department of Computer Science and Engineering / / Position second author / author / coordinator / / Product Now / Fact 1 / / ProvinceOrState Connecticut / Massachusetts / / Technology asynchronous shared-memory algorithm / specific algorithm / 2 4.3 Iterative Do-All Do-All algorithms / fault-prone processors / processor algorithm / un-assigned processors / oracle-based algorithm / live processors / message-passing algorithm / Do-All algorithms / two known efficient algorithms / time algorithm / failure-free algorithms / i=1 ai processors / fault-tolerant algorithm / Random Access / synchronous failure-free processors / shared memory / synchronous shared-memory algorithms / physical crash-prone processors / r-time shared-memory algorithm / message-passing algorithms / two algorithms / failure-prone processors / virtual processors / specific algorithms / crash-prone processors / synchronous shared-memory algorithm / synchronous message-passing processors / simulated processor / Pi processors / failureprone processors / live processor / two known algorithms / remaining processors / 200 Technology / efficient message-passing algorithm / chosen Do-All algorithm / virtual processor / iterative algorithm / simulation / failure-free processors / Do-All algorithm / Write-All algorithm / at least one processor / arbitrary pram algorithms / /
SocialTag |
Distrib. Comput[removed]: 47–63 Digital Object Identifier (DOI[removed]s00446[removed]The complexity of synchronous iterative Do-All with crashes Chryssis Georgiou1 , Alexander Russell1 , Alex A. Shvartsman1,2