Brief Announcement: Optimally work-competitive scheduling for cooperative computing with merging groups
Shvartsman, A. A.
SourceProceedings of the Annual ACM Symposium on Principles of Distributed Computing
Proceedings of the Twenty - First Annual ACM Symposium on Principles of Distributed Computing PODC 2002
Google Scholar check
MetadataShow full item record
The development of algorithms with guaranteed work efficiency for any pattern of fragmentations and merges of the underlying network is addressed. Current results are discussed for the abstract setting where asynchronous processors start performing tasks in isolation and where an adversary can force an arbitrary pattern of merges. Following a merge, processors are able to share their knowledge about the computational progress prior to the merge.
Showing items related by title, author, creator and subject.
Samaras, George S. (Institute of Electrical and Electronics Engineers Inc., 2002)Mobile computing is distributed computing that involves elements whose location changes in the course of computation. Elements may be software components such as mobile agents or moving objects-data or hardware such as ...
Neofytou, Marios S.; Tanos, Vasilios; Constantinou, Ioannis P.; Kyriacou, Efthyvoulos C.; Pattichis, Marios S.; Pattichis, Constantinos S. (2015)The paper presents the development of a computeraided diagnostic (CAD) system for the early detection of endometrial cancer. The proposed CAD system supports reproducibility through texture feature standardization, ...
Grid Computing : Second European AcrossGrids Conference, AxGrids 2004, Nicosia, Cyprus, January 28-30, 2004. Revised Papers European Across, Grids Conference; Dikaiakos, Marios D.; European Across, Grids Conference; Dikaiakos, Marios D.; SpringerLink (Online service); European Across, Grids Conference (2004)