Search
Now showing items 11-13 of 13
Distributed Cooperation and Adversity: Complexity Trade-Offs
(2003)
The problem of cooperatively performing a collection of tasks in a decentralized setting where the computing medium is subject to adversarial perturbations is one of the fundamental problems in distributed computing. Such ...
Brief Announcement: Optimally work-competitive scheduling for cooperative computing with merging groups
(2002)
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 ...
Portable parallel implementation of two novel mathematical biology algorithms in ZPL
(ACM, 1995)
This paper shows that mathematical models of biological pattern formation are ideally suited to data parallelism. We present two new algorithms, one for simulating the dynamic structure of fibroblasts, and the other for ...