default search action
Alistair C. Veitch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [p1]Goetz Graefe, Mark Lillibridge, Harumi A. Kuno, Joseph A. Tucek, Alistair C. Veitch:
Controlled Lock Violation. On Transactional Concurrency Control 2019: 129-157 - 2014
- [j7]Goetz Graefe, Haris Volos, Hideaki Kimura, Harumi A. Kuno, Joseph A. Tucek, Mark Lillibridge, Alistair C. Veitch:
In-Memory Performance for Big Data. Proc. VLDB Endow. 8(1): 37-48 (2014) - [c19]Charles Johnson, Kimberly Keeton, Charles B. Morrey III, Craig A. N. Soules, Alistair C. Veitch, Stephen Bacon, Oskar Batuner, Marcelo Condotta, Hamilton Coutinho, Patrick J. Doyle, Rafael Eichelberger, Hugo Kiehl, Guilherme R. Magalhaes, James McEvoy, Padmanabhan Nagarajan, Patrick Osborne, Joaquim Souza, Andy Sparkes, Mike Spitzer, Sébastien Tandel, Lincoln Thomas, Sebastian Zangaro:
From research to practice: experiences engineering a production metadata database for a scale out file system. FAST 2014: 191-198 - 2013
- [c18]Goetz Graefe, Mark Lillibridge, Harumi A. Kuno, Joseph A. Tucek, Alistair C. Veitch:
Controlled lock violation. SIGMOD Conference 2013: 85-96 - 2012
- [c17]James Cipar, Gregory R. Ganger, Kimberly Keeton
, Charles B. Morrey III, Craig A. N. Soules, Alistair C. Veitch:
LazyBase: trading freshness for performance in a scalable database. EuroSys 2012: 169-182 - 2011
- [j6]Prith Banerjee, Rich Friedrich, Cullen E. Bash
Everything as a Service: Powering the New Information Economy. Computer 44(3): 36-43 (2011) - 2010
- [j5]Kimberly Keeton
LazyBase: freshness vs. performance in information management. ACM SIGOPS Oper. Syst. Rev. 44(1): 15-19 (2010)
2000 – 2009
- 2009
- [j4]Eric Anderson, Martin F. Arlitt, Charles B. Morrey III, Alistair C. Veitch:
DataSeries: an efficient, flexible data format for structured serial data. ACM SIGOPS Oper. Syst. Rev. 43(1): 70-75 (2009) - [j3]Marcos Kawazoe Aguilera, Arif Merchant
Sinfonia: A new paradigm for building scalable distributed systems. ACM Trans. Comput. Syst. 27(3): 5:1-5:48 (2009) - [c16]Ludmila Cherkasova, Kave Eshghi, Charles B. Morrey III, Joseph A. Tucek, Alistair C. Veitch:
Applying syntactic similarity algorithms for enterprise information management. KDD 2009: 1087-1096 - 2008
- [c15]Karl Gyllstrom, Craig A. N. Soules, Alistair C. Veitch:
Activity put in context: identifying implicit task context within the user's document interaction. IIiX 2008: 51-56 - 2007
- [c14]Karl Gyllstrom, Craig A. N. Soules, Alistair C. Veitch:
Confluence: enhancing contextual desktop search. SIGIR 2007: 717-718 - [c13]Marcos Kawazoe Aguilera, Arif Merchant
Sinfonia: a new paradigm for building scalable distributed systems. SOSP 2007: 159-174 - 2006
- [c12]Marcos Kawazoe Aguilera, Susan Spence, Alistair C. Veitch:
Olive: Distributed Point-in-Time Branching Storage for Real Systems. NSDI 2006 - 2004
- [c11]Yasushi Saito, Svend Frølund, Alistair C. Veitch, Arif Merchant
FAB: building distributed enterprise disk arrays from commodity components. ASPLOS 2004: 48-58 - [c10]Svend Frølund, Arif Merchant
A Decentralized Algorithm for Erasure-Coded Virtual Disks. DSN 2004: 125-134 - 2003
- [c9]Svend Frølund, Arif Merchant, Yasushi Saito, Susan Spence, Alistair C. Veitch:
FAB: Enterprise Storage Systems on a Shoestring. HotOS 2003: 169-174 - [c8]Minwen Ji, Alistair C. Veitch, John Wilkes:
Seneca: remote mirroring done write. USENIX ATC, General Track 2003: 253-268 - 2002
- [c7]Eric Anderson, Michael Hobbs, Kimberly Keeton, Susan Spence, Mustafa Uysal, Alistair C. Veitch:
Hippodrome: Running Circles Around Storage Administration. FAST 2002: 175-188 - [c6]Eric Anderson, Ram Swaminathan, Alistair C. Veitch, Guillermo A. Alvarez, John Wilkes:
Selecting RAID Levels for Disk Arrays. FAST 2002: 189-201 - 2001
- [j2]Guillermo A. Alvarez, Elizabeth Borowsky, Susie Go, Theodore H. Romer, Ralph A. Becker-Szendy, Richard A. Golding, Arif Merchant
Minerva: An automated resource provisioning tool for large-scale storage systems. ACM Trans. Comput. Syst. 19(4): 483-518 (2001) - [c5]Alistair C. Veitch, Erik Riedel, Simon J. Towers, John Wilkes:
Towards Global Storage Management and Data Placement. HotOS 2001: 184
1990 – 1999
- 1999
- [c4]Douglas J. Santry, Michael J. Feeley, Norman C. Hutchinson, Alistair C. Veitch:
Elephant: The File System That Never Forgets. Workshop on Hot Topics in Operating Systems 1999: 2-7 - [c3]Douglas S. Santry, Michael J. Feeley, Norman C. Hutchinson, Alistair C. Veitch, Ross W. Carton, Jacob Ofir:
Deciding when to forget in the Elephant file system. SOSP 1999: 110-123 - 1998
- [c2]Alistair C. Veitch, Norman C. Hutchinson:
Dynamic service reconfiguration and migration in the Kea kernel. CDS 1998: 156-163 - 1996
- [c1]Alistair C. Veitch, Norman C. Hutchinson:
Kea-a dynamically extensible and configurable operating system kernel. CDS 1996: 236-242 - 1991
- [j1]Alistair C. Veitch, Geoffrey Holmes:
A Modified Quickprop Algorithm. Neural Comput. 3(3): 310-311 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-17 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: