|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 70 occurrences of 47 keywords
|
|
|
Results
Found 44 publication records. Showing 44 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
79 | Sandeep S. Kulkarni, Umamaheswaran Arumugam |
Transformations for Write-All-with-Collision Model. |
OPODIS |
2003 |
DBLP DOI BibTeX RDF |
Model conversions, Preserving stabilization, Atomicity refinement, Write-all-with-collision model, Read/Write model |
72 | Bogdan S. Chlebus, Dariusz R. Kowalski |
Cooperative asynchronous update of shared memory. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
problem Write-All, read and write register, work efficiency, distributed algorithm, expander, asynchrony, disperser |
72 | Bogdan S. Chlebus, Stefan Dobrev, Dariusz R. Kowalski, Grzegorz Malewicz, Alexander A. Shvartsman, Imrich Vrto |
Towards practical deteministic write-all algorithms. |
SPAA |
2001 |
DBLP DOI BibTeX RDF |
Write-All, contention of permutations, scheduling, parallel algorithms, work |
56 | Grzegorz Malewicz |
A work-optimal deterministic algorithm for the asynchronous certified write-all problem. |
PODC |
2003 |
DBLP DOI BibTeX RDF |
design and analysis of parallel algorithms, write-all |
55 | Jan Friso Groote, Wim H. Hesselink, Sjouke Mauw, Rogier Vermeulen |
An algorithm for the asynchronous Write-All problem based on process collision. |
Distributed Comput. |
2001 |
DBLP DOI BibTeX RDF |
Write-all problem, Distributed algorithms, Dynamic load balancing, PRAM, Wait-free, Work complexity |
49 | Dariusz R. Kowalski, Alexander A. Shvartsman |
Writing-all deterministically and optimally using a non-trivial number of asynchronous processors. |
SPAA |
2004 |
DBLP DOI BibTeX RDF |
write-all, distributed algorithms, shared memory, asynchrony, work |
48 | Dariusz R. Kowalski, Alexander A. Shvartsman |
Writing-all deterministically and optimally using a nontrivial number of asynchronous processors. |
ACM Trans. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
Write-All, distributed algorithms, shared memory, Asynchrony, work |
35 | Charles U. Martel, Ramesh Subramonian |
On the Complexity of Certified Write All Algorithms. |
FSTTCS |
1992 |
DBLP DOI BibTeX RDF |
|
29 | Stephen A. Cook, Jan K. Pachl, Irwin S. Pressman |
The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy. |
Distributed Comput. |
2002 |
DBLP DOI BibTeX RDF |
Optimization, Dynamic programming, NP-completeness, Data replication |
27 | Michael N. Nelson, Brent B. Welch, John K. Ousterhout |
Caching in the Sprite Network File System (Extended Abstract). (long version: ACM Trans. Comput. Syst. 6(1): 134-154(1988)) |
SOSP |
1987 |
DBLP DOI BibTeX RDF |
|
24 | Mahesh Arumugam |
A Distributed and Deterministic TDMA Algorithm for Write-All-With-Collision Model. |
SSS |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Grzegorz Malewicz |
A Method for Creating Near-Optimal Instances of a Certified Write-All Algorithm (Extended Abstract). |
ESA |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Paris C. Kanellakis, Dimitrios Michailidis, Alexander A. Shvartsman |
Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms (Extended Abstract). |
WDAG |
1993 |
DBLP DOI BibTeX RDF |
|
18 | Soyee Choi, Hyunwoo Park, Sang Won Lee 0001 |
Don't write all data pages in one stream. |
EDBT |
2018 |
DBLP DOI BibTeX RDF |
|
18 | Mahesh Arumugam |
A Distributed and Deterministic TDMA Algorithm for Write-All-With-Collision Model |
CoRR |
2008 |
DBLP BibTeX RDF |
|
18 | Sandeep S. Kulkarni, Mahesh Arumugam |
Transformations for write-all-with-collision model, . |
Comput. Commun. |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Grzegorz Malewicz |
A Work-Optimal Deterministic Algorithm for the Certified Write-All Problem with a Nontrivial Number of Asynchronous Processors. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Richard J. Anderson, Heather Woll |
Algorithms for the Certified Write-All Problem. |
SIAM J. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
18 | Charles U. Martel, Ramesh Subramonian |
On the Complexity of Certified Write-All Algorithms. |
J. Algorithms |
1994 |
DBLP DOI BibTeX RDF |
|
18 | Michael Rabinovich, Edward D. Lazowska |
An Efficient and Highly Available Read-One Write-All Protocol for Replicated Data Management. |
PDIS |
1993 |
DBLP DOI BibTeX RDF |
|
18 | Alexander A. Shvartsman |
An Efficient Write-All Algorithm for Fail-Stop PRAM Without Initialized Memory. |
Inf. Process. Lett. |
1992 |
DBLP DOI BibTeX RDF |
|
18 | Irwin S. Pressman, Stephen A. Cook, Jan K. Pachl |
The optimal placement of replicas in a network using a read any - write all policy. |
CASCON |
1992 |
DBLP BibTeX RDF |
|
15 | Rohaya Latip, Hamidah Ibrahim, Mohamed Othman, Md Nasir Sulaiman, Azizol Abdullah |
Quorum Based Data Replication in Grid Environment. |
RSKT |
2008 |
DBLP DOI BibTeX RDF |
Replica control protocol, Grid, Availability, Data management, Data replication |
13 | Sandeep S. Kulkarni, Anish Arora |
Automating the Addition of Fault-Tolerance. |
FTRTFT |
2000 |
DBLP DOI BibTeX RDF |
|
11 | Ricardo Jiménez-Peris, Marta Patiño-Martínez, Gustavo Alonso, Bettina Kemme |
Are quorums an alternative for data replication? |
ACM Trans. Database Syst. |
2003 |
DBLP DOI BibTeX RDF |
distributed transactions., scalability, availability, Data replication, quorums |
11 | Ricardo Jiménez-Peris, Marta Patiño-Martínez, Bettina Kemme, Gustavo Alonso |
How to Select a Replication Protocol According to Scalability, Availability, and Communication Overhead. |
SRDS |
2001 |
DBLP DOI BibTeX RDF |
transactions, data replication, quorums |
11 | Ouri Wolfson, Yixiu Huang |
Competitive Analysis of Caching in Distributed Databases. |
IEEE Trans. Parallel Distributed Syst. |
1998 |
DBLP DOI BibTeX RDF |
mobile computing, caching, distributed database, wireless communication, competitiveness, Object allocation |
10 | Lei Gao, Michael Dahlin, Jiandan Zheng, Lorenzo Alvisi, Arun Iyengar |
Dual-Quorum Replication for Edge Services. |
Middleware |
2005 |
DBLP DOI BibTeX RDF |
|
10 | D. Frank Hsu, Xiao-Dong Hu 0001, Hejiao Huang, Xiaohua Jia |
Optimal Data Replica Placements in Linear Bus Networks. |
ISPAN |
2004 |
DBLP DOI BibTeX RDF |
|
10 | Ashton Applewhite |
Not Just the Facts: What "Requirements" Mean to a Nonfiction Writer. |
IEEE Softw. |
2002 |
DBLP DOI BibTeX RDF |
|
10 | Divyakant Agrawal, Arthur J. Bernstein |
A Nonblocking Quorum Consensus Protocol for Replicated Data. |
IEEE Trans. Parallel Distributed Syst. |
1991 |
DBLP DOI BibTeX RDF |
nonblocking quorum protocol, one-copy serializability, fault tolerance, protocols, distributed databases, availability, database theory, replica control, fault tolerantcomputing, access latency |
8 | Ali Mamat, Mustafa Mat Deris, Jemal H. Abawajy, Suhaila Ismail |
Managing Data Using Neighbor Replication on Triangular-Grid Structure. |
International Conference on Computational Science (4) |
2006 |
DBLP DOI BibTeX RDF |
|
6 | Borzoo Bonakdarpour, Sandeep S. Kulkarni, Fuad Abujarad |
Distributed Synthesis of Fault-Tolerant Programs in the High Atomicity Model. |
SSS |
2007 |
DBLP DOI BibTeX RDF |
Parallel synthesis, Fault-tolerance, Distributed algorithms, Program transformation, Program synthesis |
6 | Hyun-Jin Choi, Seung-Ho Lim, Kyu Ho Park |
JFTL: A flash translation layer based on a journal remapping for flash memory. |
ACM Trans. Storage |
2009 |
DBLP DOI BibTeX RDF |
garbage detection, journal remapping, journaling file system, Flash memory, flash translation layer |
6 | Edward F. Gehringer, Carolyn S. Miller |
Student-generated active-learning exercises. |
SIGCSE |
2009 |
DBLP DOI BibTeX RDF |
kinesthetic learning exercises, active learning, peer review |
6 | José A. Joao, Onur Mutlu, Yale N. Patt |
Flexible reference-counting-based hardware acceleration for garbage collection. |
ISCA |
2009 |
DBLP DOI BibTeX RDF |
garbage collection, reference counting |
6 | Jingjing Ma, R. H. Redfield |
Lattice-ordered Fields Determined by d -elements. |
Appl. Categorical Struct. |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 06F25, 06F15, 18A40, 15A03 |
6 | Rui Oliveira 0001, José Pereira 0001, Alfrânio Correia Jr., Edward Archibald |
Revisiting 1-copy equivalence in clustered databases. |
SAC |
2006 |
DBLP DOI BibTeX RDF |
|
6 | Zhiyuan Shao, Hai Jin 0001 |
Middleware Based High Performance and High Available Database Cluster. |
GCC |
2006 |
DBLP DOI BibTeX RDF |
|
6 | Sandeep S. Kulkarni, Ali Ebnenasir |
The Effect of the Specification Model on the Complexity of Adding Masking Fault Tolerance. |
IEEE Trans. Dependable Secur. Comput. |
2005 |
DBLP DOI BibTeX RDF |
safety specification, Fault-tolerance, formal methods, program synthesis, automatic addition of fault tolerance |
6 | Ranjana Bhadoria, Shukti Das, Manoj Misra, Anil Kumar Sarje |
Performance Comparison of Majority Voting with ROWA Replication Method over PlanetLab. |
IWDC |
2005 |
DBLP DOI BibTeX RDF |
|
6 | Sandeep S. Kulkarni, Ali Ebnenasir |
Automated Synthesis of Multitolerance. |
DSN |
2004 |
DBLP DOI BibTeX RDF |
Fault-tolerance, Formal methods, Distributed programs, Program synthesis, Automatic addition of fault-tolerance |
6 | Amir Milo, Ouri Wolfson |
Placement of Replicated Items in Distributed Databases. |
EDBT |
1988 |
DBLP DOI BibTeX RDF |
|
6 | Jo-Mei Chang |
Simplifying Distributed Database Systems Design by Using a Broadcast Network. |
SIGMOD Conference |
1984 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #44 of 44 (100 per page; Change: )
|
|