Grzegorz Malewicz  Home/Search
Context Related
| ua.edu/~greg/publications/podc03.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ua.edu/~greg/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In their SIAM J. on Computing paper [27] from 1992, Martel et al. posed a question for developing a work-optimal deterministic asynchronous algorithm for the fundamental loadbalancing and synchronization problem called Certified Write-All. In this problem, introduced in a slightly di#erent form by Kanellakis and Shvartsman in a PODC'89 paper [17], p processors must update n memory cells and then signal the completion of the updates. It is known that solutions to this problem can be used to ... (Update)
Context of citations to this paper: More
...algorithm for the asynchronous CWA problem for a nontrivial number of processors p n. An extended abstract of this study will appear as [26], and a full version will appear in the upcoming doctoral dissertation of the author [27] Acknowledgements. The author would like to...
Cited by: More
Collective Asynchronous Reading with Polylogarithmic.. - Chlebus, Kowalski.. (Correct)
A Method for Creating Near-Optimal Instances of a Certified.. - Malewicz (2003) (Correct)
Similar documents (at the sentence level):
36.4%: A Work-Optimal Deterministic Algorithm for the Asynchronous.. - Malewicz (2003) (Correct)
30.7%: Distributed Scheduling for Disconnected Cooperation - Malewicz (2003) (Correct)
Active bibliography (related documents): More All
0.9: Towards Practical Deterministic - Write-All Algorithms Bogdan (Correct)
0.4: The Do-All Problem with Byzantine Processor Failures - Fernandez, Georgiou (2003) (Correct)
0.3: Towards Practical Deterministic Write-All Algorithms - Chlebus, Dobrev, Kowalski, .. (2001) (Correct)
Similar documents based on text: More All
0.2: Distributed Cooperation during the Absence of Communication - Malewicz, Russell.. (Correct)
0.2: An Auction-Based Flexible Pricing Scheme for Renegotiated.. - Malewicz, Shvartsman (1999) (Correct)
0.2: Distributed Evolutionary Algorithm for Vector Quantisation in.. - Malewicz, Skarbek (1998) (Correct)
Related documents from co-citation: More All
3: Fault-Tolerant Parallel Computation (context) - Kanellakis, Shvartsman - 1997
3: Achieving Optimal CRCWPRAM Fault-Tolerance (context) - Shvartsman - 1991
3: Parallel Algorithms with Processor Failures and Delays - Buss, Kanellakis et al. - 1991
BibTeX entry: (Update)
Malewicz, G.: A Work-Optimal Deterministic Algorithm for the Asynchronous Certi ed Write-All Problem. 22nd ACM Symposium on Principles of Distributed Computing PODC'03, (2003) to appear http://citeseer.ist.psu.edu/malewicz03workoptimal.html More
@misc{ malewicz03workoptimal,
author = "G. Malewicz",
title = "A Work-Optimal Deterministic Algorithm for the Asynchronous Certi ed Write-All
Problem",
text = "Malewicz, G.: A Work-Optimal Deterministic Algorithm for the Asynchronous
Certi ed Write-All Problem. 22nd ACM Symposium on Principles of Distributed
Computing PODC'03, (2003) to appear",
year = "2003",
url = "citeseer.ist.psu.edu/malewicz03workoptimal.html" }
Citations (may not include all citations):181 ACM Transactions on Programming Languages and Systems (context) - Herlihy - 1991
124 The Art of Computer Programming Vol (context) - Knuth - 1998
85 The APRAM: Incorporating Asynchrony into the PRAM Model (context) - Cole, Zajicek - 1989
49 CALYPSO: A Novel Software System for FaultTolerant Parallel .. - Baratloo, Dasgupta et al. - 1995
48 Clock construction in fully asynchronous parallel systems an.. (context) - Aumann, Rabin - 1994
44 the Complexity of Event Ordering for Shared-Memory Parallel .. - Netzer, Miller - 1990
43 Parallel Processing on Networks of Workstations: A Fault-Tol.. - Dasgupta, Kedem et al. - 1995
42 Fault-Tolerant Parallel Computation (context) - Kanellakis, Shvartsman - 1997
37 Asynchronous Shared Memory Parallel Computation (context) - Nishimura - 1990
35 Work-optimal asynchronous algorithms for shared memory paral.. (context) - Martel, Park et al. - 1992
35 Parallel Algorithms with Processor Failures and Delays - Buss, Kanellakis et al. - 1996
30 IEEE Transactions on Electronic Computers (context) - Bernstein - 1966
24 Combining Tentative and Definite Executions for Very Fast De.. - Kedem, Palem et al. - 1991
18 An algorithm for the asynchronous write-all problem based on.. - Groote, Hesselink et al. - 2001
17 PRAM computations resilient to memory faults - Chlebus, Gambin et al. - 1994
17 Achieving Optimal CRCWPRAM Fault-Tolerance (context) - Shvartsman - 1991
14 Algorithms for the Certified Write-All Problem - Anderson, Woll - 1997
12 the Complexity of Certified Write-All Algorithms (context) - Martel, Subramonian - 1994
11 Constructions of Permutation Arrays for Certain Scheduling C.. (context) - Naor, Roth - 1995
9 Towards Practical Deterministic Write-All Algorithms - Chlebus, Dobrev et al. - 2001
9 cient PRAM Simulation on a Distributed Memory Machine (context) - Karp, Luby et al. - 1996
7 cient Parallel Algorithms Can Be Made Robust (context) - Kanellakis, Shvartsman - 1992
7 cient program transformations for resilient parallel computa.. (context) - Kedem, Palem et al. - 1992
6 cient Asynchronous Execution of Large-Grained Parallel Progr.. (context) - Aumann, Kedem et al. - 1993
6 Tentative and Definite Distributed Computations: An Optimist.. (context) - Garofalakis, Spirakis et al. - 1994
6 Asynchronous PRAM Algorithms for List Ranking and Transitive.. (context) - Martel, Subramonian - 1990
5 rd ACM Symposium on Parallel Algorithms and Architectures SP.. (context) - Cole, Zajicek - 1990
5 nd ACM Symposium on Parallel Algorithms and Architectures SP.. (context) - Gibbons - 1989
5 How to emulate synchrony (context) - Martel, Subramonian - 1990
5 North-Holland Pub (context) - Lovasz - 1993
5 Designing synchronous algorithms for asynchronous processors (context) - Subramonian - 1992
4 Distributed Scheduling for Disconnected Cooperation - Malewicz - 2003
4 nd ACM Symposium on Theory of Computing STOC (context) - Kedem, Palem et al. - 1990
4 Theoretical Computer Science (context) - Kruskal, Rudolph et al. - 1990
3 cient execution of nondeterministic parallel programs on asy.. (context) - Aumann, Bender et al. - 1997
Documents on the same site (http://cs.ua.edu/~greg/): More
Establishing Wireless Conference Calls under Delay Constraints - Bar-Noy, Malewicz (2003) (Correct)
Local Scheduling for Distributed Cooperation - Grzegorz Greg Malewicz (Correct)
Distributed Cooperation during the Absence of Communication - Malewicz, Russell.. (2001) (Correct)
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