Cole, R., Zajicek, O.: The Expected Advantage of Asynchrony. 3rd ACM Symposium on Parallel Algorithms and Architectures SPAA'90, (1990) 85--94 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Method for Creating Near-Optimal Instances of a Certified.. - Malewicz (2003) (Correct)
....omitted from the main body of the paper appear in the appendix. 2 Model and de nitions We consider an asynchronous shared memory system where processors can work at arbitrarily varying paces. Our formal de nition is based on the Atomic Asynchronous Parallel System as presented by [5] cf. [11, 12, 15, 24, 28, 34]) The system consists of p processors, each has a dedicated local memory and a unique identi er from the set f1; pg, and any processor has access to shared memory. Any processor has a discrete local clock ranging over N = f1; 2; 3; g. A processor executes exactly one basic action ....
Cole, R., Zajicek, O.: The Expected Advantage of Asynchrony. 3rd ACM Symposium on Parallel Algorithms and Architectures SPAA'90, (1990) 85-94
A Work-Optimal Deterministic Algorithm for the Asynchronous.. - Malewicz (2003) (1 citation) (Correct)
....left out from the main body of the paper appear in the appendix. 2 Model and definitions We consider an asynchronous shared memory system where processors can work at arbitrarily varying paces. Our formal definition is based on the Atomic Asynchronous Parallel System as presented by [4] cf. [11, 12, 15, 24, 27, 33]) The system consists of p processors each has a dedicated local memory and all processors have access to shared memory. Any processor has a discrete local clock ranging over N = f1; 2; 3; g. A processor executes exactly one basic action at any tick of the local clock unless the processor ....
Cole, R., Zajicek, O.: The Expected Advantage of Asynchrony. 3rd ACM Symposium on Parallel Algorithms and Architectures SPAA'90, (1990) 85--94
Distributed Scheduling for Disconnected Cooperation - Malewicz (2003) (1 citation) (Correct)
No context found.
Cole, R., Zajicek, O.: The Expected Advantage of Asynchrony. 3rd ACM Symposium on Parallel Algorithms and Architectures SPAA'90, (1990) 85--94
A Method for Creating Near-Optimal Instances of a Certified.. - Malewicz (2003) (Correct)
No context found.
Cole, R., Zajicek, O.: The Expected Advantage of Asynchrony. 3rd ACM Symposium on Parallel Algorithms and Architectures SPAA'90, (1990) 85--94
A Work-Optimal Deterministic Algorithm for the Asynchronous.. - Malewicz (2003) (1 citation) (Correct)
No context found.
Cole, R., Zajicek, O.: The Expected Advantage of Asynchrony. 3rd ACM Symposium on Parallel Algorithms and Architectures SPAA'90, (1990) 85--94
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC