Difference between revisions of "Event:FAST 2019"

From ConfIDent
m (Text replacement - "|State=" to "|Region=")
(mobo import Concept___Events-migrated)
Line 7: Line 7:
 
|Region=MA
 
|Region=MA
 
|Country=Country:US
 
|Country=Country:US
|Submission deadline=2018/09/26
 
|Paper deadline=2019/01/24
 
|Tutorial deadline=2018/09/26
 
|Notification=2018/12/11
 
 
|Has coordinator=Arif Merchant, Hakim Weatherspoon
 
|Has coordinator=Arif Merchant, Hakim Weatherspoon
 
|has tutorial chair=John Strunk, Eno Thereska
 
|has tutorial chair=John Strunk, Eno Thereska
Line 35: Line 31:
 
|Event Mode=on site
 
|Event Mode=on site
 
}}
 
}}
 +
{{Event Deadline
 +
|Paper Deadline=2019/01/24
 +
|Tutorial Deadline=2018/09/26
 +
|Notification Deadline=2018/12/11
 +
|Submission Deadline=2018/09/26
 +
}}
 +
{{S Event}}
 
The 17th USENIX Conference on File and Storage Technologies (FAST '19) brings together storage-system researchers and practitioners to explore new directions in the design, implementation, evaluation, and deployment of storage systems. Co-located with NSDI '19
 
The 17th USENIX Conference on File and Storage Technologies (FAST '19) brings together storage-system researchers and practitioners to explore new directions in the design, implementation, evaluation, and deployment of storage systems. Co-located with NSDI '19
  

Revision as of 19:34, 22 September 2022

Deadlines
2018-12-11
2019-01-24
2018-09-26
2018-09-26
26
Sep
2018
Tutorial
26
Sep
2018
Submission
11
Dec
2018
Notification
24
Jan
2019
Paper
Venue

Boston, MA, United States of America

Loading map...

The 17th USENIX Conference on File and Storage Technologies (FAST '19) brings together storage-system researchers and practitioners to explore new directions in the design, implementation, evaluation, and deployment of storage systems. Co-located with NSDI '19

Topics

  • Topics of interest include but are not limited to:
    • Archival storage systems
    • Auditing and provenance
    • Big data, analytics, and data sciences
    • Caching, replication, and consistency
    • Cloud storage
    • Data deduplication
    • Database storage
    • Distributed and networked storage (wide-area, grid, peer-to-peer)
    • Empirical evaluation of storage systems
    • Experience with deployed systems
    • File system design
    • High-performance file systems
    • Key-value and NoSQL storage
    • Memory-only storage systems
    • Mobile, personal, embedded, and home storage
    • Parallel I/O and storage systems
    • Power-aware storage architectures
    • RAID and erasure coding
    • Reliability, availability, and disaster tolerance
    • Search and data retrieval
    • Solid state storage technologies and uses (e.g., flash, byte-addressable NVM)
    • Storage management
    • Storage networking
    • Storage performance and QoS
    • Storage security
    • Deployed Systems


Submissions

Important Dates

  • Submissions due: Wednesday, September 26, 2018, 8:59 pm PDT
  • Tutorial submissions due: Wednesday, September 26, 2018, 8:59 pm PDT
  • Notification to authors: Tuesday, December 11, 2018
  • Final papers due: Thursday, January 24, 2019

Committees

  • Program Co-Chairs
    • Arif Merchant, Google
    • Hakim Weatherspoon, Cornell University
    • Program Committee
    • Nitin Agrawal, Samsung Research
    • Mahesh Balakrishnan, Yale University and Facebook
    • André Brinkmann, Johannes Gutenberg-University Mainz
    • Vijay Chidambaram, The University of Texas at Austin
    • Angela Demke Brown, University of Toronto
    • Peter Desnoyers, Northeastern University
    • Ashvin Goel, University of Toronto
    • Ajay Gulati, ZeroStack
    • Haryadi Gunawi, University of Chicago
    • Tim Harris, Amazon
    • Cheng Huang, Microsoft Research and Azure
    • Bill Jannen, Williams College
    • Rob Johnson, VMware Research Group
    • Kim Keeton, Hewlett Packard Enterprise
    • Geoff Kuenning, Harvey Mudd College
    • Sungjin Lee, DGIST (Daegu Gyeongbuk Institute of Science and Technology)
    • Peter Macko, NetApp
    • Umesh Maheshwari, Nimble Storage (an HPE company)
    • Arif Merchant, Google
    • Onur Mutlu, ETH Zurich and Carnegie Mellon University
    • Sam H. Noh, UNIST (Ulsan National Institute of Science and Technology)
    • Florentina Popovici, Google
    • Raju Rangaswami, Florida International University
    • Ken Salem, University of Waterloo
    • Jiri Schindler, Tranquil Data
    • Bianca Schroeder, University of Toronto
    • Keith A Smith, NetApp
    • Ioan Stefanovici, Microsoft Research
    • Swaminathan Sundararaman, ParallelM
    • Nisha Talagala, ParallelM
    • Vasily Tarasov, IBM Research
    • Joseph Tucek, Amazon
    • Carl Waldspurger, Carl Waldspurger Consulting
    • Andrew Warfield, Amazon
    • Hakim Weatherspoon, Cornell University
    • Brent Welch, Google
    • Ric Wheeler, Facebook
    • Youjip Won, Korea Advanced Institute of Science and Technology (KAIST)
    • Gala Yadgar, Technion—Israel Institute of Technology
    • Yiying Zhang, Purdue University
    • Work-in-Progress/Posters Co-Chairs
    • Bill Jannen, Williams College
    • Vasily Tarasov, IBM Research
  • Test of Time Awards Committee
    • Jiri Schindler, Tranquil Data
    • Eno Thereska, Amazon
    • Erez Zadok, Stony Brook University
    • Tutorial Coordinators
    • John Strunk, Red Hat
    • Eno Thereska, Amazon
    • Steering Committee
    • Nitin Agrawal, Samsung Research
    • Remzi Arpaci-Dusseau, University of Wisconsin—Madison
    • Angela Demke Brown, University of Toronto
    • Greg Ganger, Carnegie Mellon University
    • Casey Henderson, USENIX Association
    • Kimberly Keeton, HP Labs
    • Geoff Kuenning, Harvey Mudd College
    • Florentina Popovici, Google
    • Raju Rangaswami, Florida International University
    • Erik Riedel
    • Jiri Schindler, Tranquil Data
    • Bianca Schroeder, University of Toronto
    • Keith A. Smith, NetApp
    • Eno Thereska, Amazon
    • Carl Waldspurger, Carl Waldspurger Consulting
    • Ric Wheeler, Facebook
    • Erez Zadok, Stony Brook University
Cookies help us deliver our services. By using our services, you agree to our use of cookies.