Author image not provided
 Austin T Clements

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article27.75
Citation Count333
Publication count12
Publication years2005-2017
Available for download8
Average downloads per article1,730.63
Downloads (cumulative)13,845
Downloads (12 Months)3,576
Downloads (6 Weeks)776
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


12 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 12 of 12
Sort by:

1 published by ACM
October 2017 SOSP '17: Proceedings of the 26th Symposium on Operating Systems Principles
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 279,   Downloads (12 Months): 1,320,   Downloads (Overall): 1,320

Full text available: PDFPDF
It is challenging to simultaneously achieve multicore scalability and high disk throughput in a file system. For example, even for commutative operations like creating different files in the same directory, current file systems introduce cache-line conflicts when updating an in-memory copy of the on-disk directory block, which limits scalability. ScaleFS ...

2 published by ACM
July 2017 Communications of the ACM: Volume 60 Issue 8, August 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 424,   Downloads (12 Months): 1,415,   Downloads (Overall): 1,415

Full text available: HtmlHtml  PDFPDF
Developing software that scales on multicore processors is an inexact science dominated by guesswork, measurement, and expensive cycles of redesign and reimplementation. Current approaches are workload-driven and, hence, can reveal scalability bottlenecks only for known workloads and available software and hardware. This paper introduces an interface-driven approach to building scalable ...

3 published by ACM
January 2015 ACM Transactions on Computer Systems (TOCS): Volume 32 Issue 4, January 2015
Publisher: ACM
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 16,   Downloads (12 Months): 172,   Downloads (Overall): 1,149

Full text available: PDFPDF
What opportunities for multicore scalability are latent in software interfaces, such as system call APIs? Can scalability challenges and opportunities be identified even before any implementation exists, simply by considering interface specifications? To answer these questions, we introduce the scalable commutativity rule: whenever interface operations commute, they can be implemented ...
Keywords: conflict freedom, multicore, software interfaces, Commutativity

4 published by ACM
November 2013 SOSP '13: Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
Publisher: ACM
Bibliometrics:
Citation Count: 44
Downloads (6 Weeks): 41,   Downloads (12 Months): 527,   Downloads (Overall): 7,961

Full text available: PDFPDF
What fundamental opportunities for scalability are latent in interfaces , such as system call APIs? Can scalability opportunities be identified even before any implementation exists, simply by considering interface specifications? To answer these questions this paper introduces the following rule: Whenever interface operations commute, they can be implemented in a ...

5 published by ACM
April 2013 EuroSys '13: Proceedings of the 8th ACM European Conference on Computer Systems
Publisher: ACM
Bibliometrics:
Citation Count: 30
Downloads (6 Weeks): 9,   Downloads (12 Months): 60,   Downloads (Overall): 362

Full text available: PDFPDF
RadixVM is a new virtual memory system design that enables fully concurrent operations on shared address spaces for multithreaded processes on cache-coherent multicore computers. Today, most operating systems serialize operations such as mmap and munmap, which forces application developers to split their multithreaded applications into multiprocess applications, hoard memory to ...

6 published by ACM
March 2012 ASPLOS XVII: Proceedings of the seventeenth international conference on Architectural Support for Programming Languages and Operating Systems
Publisher: ACM
Bibliometrics:
Citation Count: 40
Downloads (6 Weeks): 4,   Downloads (12 Months): 55,   Downloads (Overall): 517

Full text available: PDFPDF
Software developers commonly exploit multicore processors by building multithreaded software in which all threads of an application share a single address space. This shared address space has a cost: kernel virtual memory operations such as handling soft page faults, growing the address space, mapping files, etc. can limit the scalability ...
Keywords: virtual memory, lock-free algorithms, scalability, RCU, concurrent balanced trees, multicore
Also published in:
April 2012  ACM SIGARCH Computer Architecture News - ASPLOS '12: Volume 40 Issue 1, March 2012 June 2012  ACM SIGPLAN Notices - ASPLOS '12: Volume 47 Issue 4, April 2012

7
October 2010 OSDI'10: Proceedings of the 9th USENIX conference on Operating systems design and implementation
Publisher: USENIX Association
Bibliometrics:
Citation Count: 107

This paper analyzes the scalability of seven system applications (Exim, memcached, Apache, PostgreSQL, gmake, Psearchy, and MapReduce) running on Linux on a 48- core computer. Except for gmake, all applications trigger scalability bottlenecks inside a recent Linux kernel. Using mostly standard parallel programming techniques-- this paper introduces one new technique, ...

8
October 2010 OSDI'10: Proceedings of the 9th USENIX conference on Operating systems design and implementation
Publisher: USENIX Association
Bibliometrics:
Citation Count: 25

Distributed in-memory application data caches like memcached are a popular solution for scaling database-driven web sites. These systems are easy to add to existing deployments, and increase performance significantly by reducing load on both the database and application servers. Unfortunately, such caches do not integrate well with the database or ...

9
June 2009 USENIX'09: Proceedings of the 2009 conference on USENIX Annual technical conference
Publisher: USENIX Association
Bibliometrics:
Citation Count: 57

File systems hosting virtual machines typically contain many duplicated blocks of data resulting in wasted storage space and increased storage array cache footprint. Deduplication addresses these problems by storing a single instance of each unique data block and sharing it between all original sources of that data. While deduplication is ...

10 published by ACM
March 2008 ASPLOS XIII: Proceedings of the 13th international conference on Architectural support for programming languages and operating systems
Publisher: ACM
Bibliometrics:
Citation Count: 16
Downloads (6 Weeks): 1,   Downloads (12 Months): 22,   Downloads (Overall): 774

Full text available: PDFPDF
Today's system programmers go to great lengths to extend the languages in which they program. For instance, system-specific compilers find errors in Linux and other systems, and add support for specialized control flow to Qt and event-based programs. These compilers are difficult to build and cannot always understand each other's ...
Keywords: extension-oriented compilers
Also published in:
March 2008  ACM SIGARCH Computer Architecture News - ASPLOS '08: Volume 36 Issue 1, March 2008 March 2008  ACM SIGOPS Operating Systems Review - ASPLOS '08: Volume 42 Issue 2, March 2008 March 2008  ACM SIGPLAN Notices - ASPLOS '08: Volume 43 Issue 3, March 2008

11 published by ACM
October 2005 SOSP '05: Proceedings of the twentieth ACM symposium on Operating systems principles
Publisher: ACM
Bibliometrics:
Citation Count: 5
Downloads (6 Weeks): 2,   Downloads (12 Months): 5,   Downloads (Overall): 347

Full text available: PDFPDF
The availability of previous file versions is invaluable for recovering from file corruption or user errors such as accidental deletions. Versioned file systems address this need by retaining earlier versions of changed files. Many existing file systems, such as Plan 9, WAFL, AFS, and others, use a snap-shotting approach: they ...

12
February 2005 IPTPS'05: Proceedings of the 4th international conference on Peer-to-Peer Systems
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 3

Arpeggio is a peer-to-peer file-sharing network based on the Chord lookup primitive. Queries for data whose metadata matches a certain criterion are performed efficiently by using a distributed keyword-set index , augmented with index-side filtering. We introduce index gateways , a technique for minimizing index maintenance overhead. Because file data ...



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