Author image not provided
 Brandon Holt

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article5.83
Citation Count35
Publication count6
Publication years2012-2016
Available for download3
Average downloads per article252.33
Downloads (cumulative)757
Downloads (12 Months)168
Downloads (6 Weeks)16
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


6 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 6 of 6
Sort by:

1
November 2016 OSDI'16: Proceedings of the 12th USENIX conference on Operating Systems Design and Implementation
Publisher: USENIX Association
Bibliometrics:
Citation Count: 0

Users of today's popular wide-area apps (e.g., Twitter, Google Docs, and Words with Friends) must no longer save and reload when updating shared data; instead, these applications are reactive , providing the illusion of continuous synchronization across mobile devices and the cloud. Achieving this illusion poses a complex distributed data ...

2 published by ACM
October 2016 SoCC '16: Proceedings of the Seventh ACM Symposium on Cloud Computing
Publisher: ACM
Bibliometrics:
Citation Count: 5
Downloads (6 Weeks): 15,   Downloads (12 Months): 148,   Downloads (Overall): 493

Full text available: PDFPDF
Distributed applications and web services, such as online stores or social networks, are expected to be scalable, available, responsive, and fault-tolerant. To meet these steep requirements in the face of high round-trip latencies, network partitions, server failures, and load spikes, applications use eventually consistent datastores that allow them to weaken ...
Keywords: consistency, programming model, type system

3
July 2015 USENIX ATC '15: Proceedings of the 2015 USENIX Conference on Usenix Annual Technical Conference
Publisher: USENIX Association
Bibliometrics:
Citation Count: 7

We present Grappa, a modern take on software distributed shared memory (DSM) for in-memory data-intensive applications. Grappa enables users to program a cluster as if it were a single, large, non-uniform memory access (NUMA) machine. Performance scales up even for applications that have poor locality and input-dependent load distribution. Grappa ...

4 published by ACM
April 2015 PaPoC '15: Proceedings of the First Workshop on Principles and Practice of Consistency for Distributed Data
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 1,   Downloads (12 Months): 12,   Downloads (Overall): 127

Full text available: PDFPDF
Out of the many NoSQL databases in use today, some that provide simple data structures for records, such as Redis and MongoDB, are now becoming popular. Building applications out of these complex data types provides a way to communicate intent to the database system without sacrificing flexibility or committing to ...

5 published by ACM
October 2014 OOPSLA '14: Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 0,   Downloads (12 Months): 8,   Downloads (Overall): 137

Full text available: PDFPDF
Partitioned Global Address Space (PGAS) environments simplify writing parallel code for clusters because they make data movement implicit - dereferencing global pointers automatically moves data around. However, it does not free the programmer from needing to reason about locality - poor placement of data can lead to excessive and even ...
Keywords: continuation-passing style, llvm, locality, pgas, thread migration
Also published in:
December 2014  ACM SIGPLAN Notices - OOPSLA '14: Volume 49 Issue 10, October 2014

6
June 2012 HotPar'12: Proceedings of the 4th USENIX conference on Hot Topics in Parallelism
Publisher: USENIX Association
Bibliometrics:
Citation Count: 0

For communication-intensive applications on distributed memory systems, performance is bounded by remote memory accesses. Task migration is a potential candidate for reducing network traffic in such applications, thereby improving performance. We seek to answer the question: can a run-time profitably predict when it is better to move the task to ...



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