Author image not provided
 Eric John Anderson

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article10.96
Citation Count296
Publication count27
Publication years1998-2011
Available for download9
Average downloads per article398.00
Downloads (cumulative)3,582
Downloads (12 Months)91
Downloads (6 Weeks)11
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


27 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 27
Result page: 1 2

Sort by:

1 published by ACM
June 2011 ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review: Volume 39 Issue 1, June 2011
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 4,   Downloads (Overall): 61

Full text available: PDFPDF
Keywords: cloud computing, performance, data-intensive computing, efficiency

2 published by ACM
June 2011 SIGMETRICS '11: Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 5,   Downloads (Overall): 126

Full text available: PDFPDF
Keywords: performance, data-intensive computing, efficiency, cloud computing

3
October 2010 HotDep'10: Proceedings of the Sixth international conference on Hot topics in system dependability
Publisher: USENIX Association
Bibliometrics:
Citation Count: 17

Many key-value stores have recently been proposed as platforms for always-on, globally-distributed, Internet-scale applications. To meet their needs, these stores often sacrifice consistency for availability. Yet, few tools exist that can verify the consistency actually provided by a key-value store, and quantify the violations if any. How can a user ...

4
June 2010 Algorithmica: Volume 57 Issue 2, June 2010
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

The data migration problem is the problem of computing a plan for moving data objects stored on devices in a network from one configuration to another. Load balancing or changing usage patterns might necessitate such a rearrangement of data. In this paper, we consider the case where the objects are ...
Keywords: Edge coloring, Space constraints, Load-balancing, Approximation algorithms, Data migration

5 published by ACM
March 2010 ACM SIGOPS Operating Systems Review: Volume 44 Issue 1, January 2010
Publisher: ACM
Bibliometrics:
Citation Count: 12
Downloads (6 Weeks): 1,   Downloads (12 Months): 12,   Downloads (Overall): 482

Full text available: PDFPDF
Current data intensive scalable computing (DISC) systems, although scalable, achieve embarrassingly low rates of processing per node. We feel that current DISC systems have repeated a mistake of old high-performance systems: focusing on scalability without considering efficiency. This poor efficiency comes with issues in reliability, energy, and cost. As the ...

6
February 2010 Algorithmica: Volume 57 Issue 2, February 2010
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 4

The data migration problem is the problem of computing a plan for moving data objects stored on devices in a network from one configuration to another. Load balancing or changing usage patterns might necessitate such a rearrangement of data. In this paper, we consider the case where the objects are ...
Keywords: Load-balancing, Approximation algorithms, Edge coloring, Space constraints

7
February 2009 FAST '09: Proccedings of the 7th conference on File and storage technologies
Publisher: USENIX Association
Bibliometrics:
Citation Count: 16

We describe methods to capture, convert, store and analyze NFS workloads that are 20-100× more intense, in terms of operations/day, than any previously published. We describe three techniques that improve capture performance by up to 10× over previous techniques. For conversion, we use a general-purpose format that is both highly ...

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

Full text available: PDFPDF
Structured serial data is used in many scientific fields; such data sets consist of a series of records, and are typically written once, read many times, chronologically ordered, and read sequentially. In this paper we introduce DataSeries, an on-disk format, run-time library and set of tools for storing and analyzing ...
Keywords: performance, compression, data format, trace-analysis

9
December 2008 HotDep'08: Proceedings of the Fourth conference on Hot topics in system dependability
Publisher: USENIX Association
Bibliometrics:
Citation Count: 5

Current weak consistency semantics provide worst-case guarantees to clients. These guarantees fail to adequately describe systems that provide varying levels of consistency in the face of distinct failure modes, or that achieve better than worst-case guarantees during normal execution. The inability to make precise statements about consistency throughout a system's ...

10 published by ACM
November 2005 ACM Transactions on Computer Systems (TOCS): Volume 23 Issue 4, November 2005
Publisher: ACM
Bibliometrics:
Citation Count: 36
Downloads (6 Weeks): 4,   Downloads (12 Months): 17,   Downloads (Overall): 1,084

Full text available: PDFPDF
Despite the importance of storage in enterprise computer systems, there are few adequate tools to design and configure a storage system to meet application data requirements efficiently. Storage system design involves choosing the disk arrays to use, setting the configuration options on those arrays, and determining an efficient mapping of ...

11 published by ACM
July 2005 SPAA '05: Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Publisher: ACM
Bibliometrics:
Citation Count: 6
Downloads (6 Weeks): 0,   Downloads (12 Months): 10,   Downloads (Overall): 465

Full text available: PDFPDF
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multiprocessor deadline scheduling problem that arises in several commercially-important applications, including animation rendering, protein analysis, and seismic signal processing. DSSP differs from most previously-studied deadline scheduling problems because ...
Keywords: animation rendering, deadline scheduling, multiprocessor job scheduling, simulation

12
June 2005 JSSPP'05: Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

Recently HP Labs engaged in a joint project with DreamWorks Animation to develop a Utility Rendering Service that was used to render part of the computer-animated feature film Shrek 2 . In a companion paper [2] we formalized the problem of scheduling animation rendering jobs and demonstrated that the general ...

13 published by ACM
June 2005 SIGMETRICS '05: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 6,   Downloads (Overall): 293

Full text available: PDFPDF
Keywords: deadline scheduling, simulation, animation rendering
Also published in:
June 2005  ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review: Volume 33 Issue 1, June 2005

14
March 2004 FAST '04: Proceedings of the 3rd USENIX Conference on File and Storage Technologies
Publisher: USENIX Association
Bibliometrics:
Citation Count: 12

In benchmarking I/O systems, it is important to generate, accurately, the I/O access pattern that one is intending to generate. However, timing accuracy ( issuing I/Os at the desired time) at high I/O rates is difficult to achieve on stock operating systems. We currently lack tools to easily and accurately ...

15
March 2004 FAST'04: Proceedings of the 3rd USENIX conference on File and storage technologies
Publisher: USENIX Association
Bibliometrics:
Citation Count: 7

In benchmarking I/O systems, it is important to generate, accurately, the I/O access pattern that one is intending to generate. However, timing accuracy ( issuing I/Os at the desired time) at high I/O rates is difficult to achieve on stock operating systems. We currently lack tools to easily and accurately ...

16
September 2002 Theoretical Computer Science: Volume 287 Issue 2, 28 September 2002
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 0

The list update problem, a well-studied problem in dynamic data structures, can be described abstractly as a metrical task system. In this paper, we prove that a generic metrical task system algorithm, called the work function algorithm , has constant competitive ratio for list update. In the process, we present ...

17
January 2002 FAST '02: Proceedings of the 1st USENIX Conference on File and Storage Technologies
Publisher: USENIX Association
Bibliometrics:
Citation Count: 4


18
January 2002 FAST '02: Proceedings of the 1st USENIX Conference on File and Storage Technologies
Publisher: USENIX Association
Bibliometrics:
Citation Count: 1


19
January 2002 FAST'02: Proceedings of the 1st USENIX conference on File and storage technologies
Publisher: USENIX Association
Bibliometrics:
Citation Count: 0

Disk arrays have a myriad of configuration parameters that interact in counter-intuitive ways, and those interactions can have significant impacts on cost, performance, and reliability. Even after values for these parameters have been chosen, there are exponentially-many ways to map data onto the disk arrays' logical units. Meanwhile, the importance ...

20
January 2002 FAST '02: Proceedings of the Conference on File and Storage Technologies
Publisher: USENIX Association
Bibliometrics:
Citation Count: 79




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