The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Ko...
In this work, we address Byzantine agreement in a message passing system with homonyms, i.e. a system with a number l of authenticated identities that is independent of the total ...
Alewife is a multiprocessor architecture that supports up to 512 processing nodes connected over a scalable and cost-effective mesh network at a constant cost per node. The MIT Al...
Anant Agarwal, Ricardo Bianchini, David Chaiken, K...
Although shared memory programming models show good programmability compared to message passing programming models, their implementation by page-based software distributed shared m...
We designed eSports—a collaborative and synchronous video annotation platform, which is to be used in Internet scale cross-platform grid computing environment to facilitate Comp...
Gang Zhai, Geoffrey Fox, Marlon E. Pierce, Wenjun ...