Author image not provided
 Marcos Kawazoe Aguilera

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article23.02
Citation Count1,289
Publication count56
Publication years1996-2011
Available for download22
Average downloads per article671.00
Downloads (cumulative)14,762
Downloads (12 Months)496
Downloads (6 Weeks)39
SEARCH
ROLE
Arrow RightAuthor only
· Editor only
· Other only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


56 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 56
Result page: 1 2 3

Sort by:

1 published by ACM
April 2011 Journal of the ACM (JACM): Volume 58 Issue 2, April 2011
Publisher: ACM
Bibliometrics:
Citation Count: 16
Downloads (6 Weeks): 2,   Downloads (12 Months): 20,   Downloads (Overall): 824

Full text available: PDFPDF
This article deals with the emulation of atomic read/write (R/W) storage in dynamic asynchronous message passing systems. In static settings, it is well known that atomic R/W storage can be implemented in a fault-tolerant manner even if the system is completely asynchronous, whereas consensus is not solvable. In contrast, all ...
Keywords: atomic storage, dynamic systems, Shared-memory emulations

2 published by ACM
October 2010 Hotnets-IX: Proceedings of the 9th ACM SIGCOMM Workshop on Hot Topics in Networks
Publisher: ACM
Bibliometrics:
Citation Count: 7
Downloads (6 Weeks): 0,   Downloads (12 Months): 8,   Downloads (Overall): 260

Full text available: PDFPDF
Cloud applications have increasingly come to rely on distributed storage systems that hide the complexity of handling network and node failures behind simple, data-centric interfaces (such as PUTs and GETs on key-value pairs). While these interfaces are very easy to use, the application is completely oblivious to the location of ...
Keywords: key-value stores, location, network topology, cloud computing

3
September 2010 DISC'10: Proceedings of the 24th international conference on Distributed computing
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0


4
September 2010 DISC'10: Proceedings of the 24th international conference on Distributed computing
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

We give randomized agreement algorithms with constant expected running time in asynchronous systems subject to process failures, where up to a minority of processes may fail. We consider three types of process failures: crash, omission, and Byzantine. For crash or omission failures, we solve consensus assuming private channels or a ...

5 published by ACM
November 2009 ACM Transactions on Computer Systems (TOCS): Volume 27 Issue 3, November 2009
Publisher: ACM
Bibliometrics:
Citation Count: 25
Downloads (6 Weeks): 7,   Downloads (12 Months): 30,   Downloads (Overall): 1,370

Full text available: PDFPDF
We propose a new paradigm for building scalable distributed systems. Our approach does not require dealing with message-passing protocols, a major complication in existing distributed systems. Instead, developers just design and manipulate data structures within our service called Sinfonia. Sinfonia keeps data for applications on a set of memory nodes, ...
Keywords: scalability, transactions, Distributed systems, shared memory, two-phase commit, fault tolerance

6 published by ACM
August 2009 SPAA '09: Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 9,   Downloads (Overall): 168

Full text available: PDFPDF
We consider the problem of providing byzantine-tolerant storage in distributed systems where client-server links are much thinner and slower than server-server links. We provide storage algorithms that are unique in two ways. First, our algorithms take into consideration the asymmetry in network connectivity by minimizing client-server communication. To provide this ...
Keywords: byzantine failures, distributed system, digital signatures, algorithms, distributed storage

7 published by ACM
August 2009 PODC '09: Proceedings of the 28th ACM symposium on Principles of distributed computing
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 1,   Downloads (12 Months): 14,   Downloads (Overall): 160

Full text available: PDFPDF
We introduce a new model of partial synchrony for read-write shared memory systems. This model is based on the notion of set timeliness --a natural and straightforward generalization of the seminal concept of timeliness in the partially synchrony model of Dwork, Lynch and Stockmeyer [8]. Despite its simplicity, the concept ...
Keywords: algorithms, failure detectors, consensus, impossibility, bivalency, partial synchrony, set agreement, timeliness

8 published by ACM
August 2009 PODC '09: Proceedings of the 28th ACM symposium on Principles of distributed computing
Publisher: ACM
Bibliometrics:
Citation Count: 12
Downloads (6 Weeks): 2,   Downloads (12 Months): 16,   Downloads (Overall): 299

Full text available: PDFPDF
This paper deals with the emulation of atomic read/write (R/W) storage in dynamic asynchronous message passing systems. In static settings, it is well known that atomic R/W storage can be implemented in a fault-tolerant manner even if the system is completely asynchronous, whereas consensus is not solvable. In contrast, all ...
Keywords: atomic storage, dynamic systems, shared-memory emulations

9
May 2009 HotOS'09: Proceedings of the 12th conference on Hot topics in operating systems
Publisher: USENIX Association
Bibliometrics:
Citation Count: 5


10
April 2009 NSDI'09: Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Publisher: USENIX Association
Bibliometrics:
Citation Count: 7

We propose the RPC chain, a simple but powerful communication primitive that allows an application to reduce the performance effects of wide-area links on enterprise and data center applications that span multiple sites. This primitive chains together multiple RPC invocations so that the computation can flow from one server to ...

11 published by ACM
January 2009 ACM SIGOPS Operating Systems Review: Volume 43 Issue 1, January 2009
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 1,   Downloads (12 Months): 8,   Downloads (Overall): 161

Full text available: PDFPDF
Storage management activities, such as reporting, file placement, migration and archiving, require the ability to discover files that belong to an application workflow by relying only on information from the file server. Some classes of application workflows, such as rendering an animated sequence from its graphics models or building an ...
Keywords: storage management, application workflow

12
September 2008 DISC '08: Proceedings of the 22nd international symposium on Distributed Computing
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 3

We propose and solve a synchronization problem called the <em>mailbox problem</em>, motivated by the interaction between devices and processor in a computer. In this problem, a postman delivers letters to the mailbox of a housewife and uses a flag to signal a non-empty mailbox. The wife must remove all letters ...

13
September 2008 P2P '08: Proceedings of the 2008 Eighth International Conference on Peer-to-Peer Computing
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 1

We introduce transaction rate limiters, new mechanisms that limit (probabilistically) the maximum number of transactions a user of a peer-to-peer system can do in any given period. They can be used to limit the consumption of selfish users and the damage done by malicious users. They complement reputation systems, solving ...
Keywords: rate limiting, anonymity, peer-to-peer

14 published by ACM
August 2008 PODC '08: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Publisher: ACM
Bibliometrics:
Citation Count: 6
Downloads (6 Weeks): 1,   Downloads (12 Months): 11,   Downloads (Overall): 178

Full text available: PDFPDF
We introduce a simple progress condition for shared object implementations that is gracefully degrading depending on the degree of synchrony in each run. This progress property, called timeliness-based wait-freedom, provides a gradual bridge between obstruction-freedom and wait-freedom in partially synchronous systems. We show that timeliness-based wait-freedom can be achieved with ...
Keywords: abortable registers, graceful degradation, memory contention, wait-freedom, dynamic leader election, shared memory, universal constructions, obstruction-freedom

15
August 2008 Proceedings of the VLDB Endowment: Volume 1 Issue 1, August 2008
Publisher: VLDB Endowment
Bibliometrics:
Citation Count: 35
Downloads (6 Weeks): 3,   Downloads (12 Months): 32,   Downloads (Overall): 907

Full text available: PDFPDF
Internet applications increasingly rely on scalable data structures that must support high throughput and store huge amounts of data. These data structures can be hard to implement efficiently. Recent proposals have overcome this problem by giving up on generality and implementing specialized interfaces and functionality (e.g., Dynamo [4]). We present ...

16 published by ACM
October 2007 SOSP '07: Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Publisher: ACM
Bibliometrics:
Citation Count: 91
Downloads (6 Weeks): 6,   Downloads (12 Months): 78,   Downloads (Overall): 2,296

Full text available: PDFPDF
We propose a new paradigm for building scalable distributed systems. Our approach does not require dealing with message-passing protocols -- a major complication in existing distributed systems. Instead, developers just design and manipulate data structures within our service called Sinfonia. Sinfonia keeps data for applications on a set of memory ...
Keywords: fault tolerance, scalability, distributed systems, transactions, shared memory, two-phase commit
Also published in:
October 2007  ACM SIGOPS Operating Systems Review - SOSP '07: Volume 41 Issue 6, December 2007

17 published by ACM
August 2007 PODC '07: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 11,   Downloads (Overall): 165

Full text available: PDFPDF
Keywords: distributed systems, byzantine fault tolerance, storage

18 published by ACM
August 2007 PODC '07: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Publisher: ACM
Bibliometrics:
Citation Count: 20
Downloads (6 Weeks): 2,   Downloads (12 Months): 17,   Downloads (Overall): 254

Full text available: PDFPDF
We introduce abortable and query-abortable objects, intended for asynchronous shared-memory systems with low contention. These objects behave like ordinary objects when accessed sequentially, but may abort operations when accessed concurrently. An aborted operation may or may not take effect, i.e., cause a state transition, and it returns no indication of ...
Keywords: memory contention, abortable types, non-triviality, shared memory, universal constructions, obstruction-freedom

19
June 2007 DSN '07: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 4

Enterprise storage systems typically containmultiple storage tiers, each having its own performance, reliability, and recoverability. The primary motivation for this multi-tier organization is cost, as storage tier costs vary considerably. In this paper, we describe a file system called TierFS that stores files at multiple storage tiers while providing high ...

20 published by ACM
May 2007 WWW '07: Proceedings of the 16th international conference on World Wide Web
Publisher: ACM
Bibliometrics:
Citation Count: 8
Downloads (6 Weeks): 1,   Downloads (12 Months): 4,   Downloads (Overall): 327

Full text available: PDFPDF
In this paper we extend the state-of-the-art in utilizing background knowledge for supervised classification by exploiting the semantic relationships between terms explicated in Ontologies. Preliminary evaluations indicate that the new approach generally improves precision and recall, more so for hard to classify cases and reveals patterns indicating the usefulness of ...
Keywords: supervised document classification, background domain knowledge, ranking semantic relationships, vector space models



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us