The Experts below are selected from a list of 26664 Experts worldwide ranked by ideXlab platform
Young Ik Eom - One of the best experts on this subject based on the ideXlab platform.
-
Lightweight Application level crash consistency on transactional flash storage
USENIX Annual Technical Conference, 2015Co-Authors: Changwoo Min, Woonhak Kang, Taesoo Kim, Sangwon Lee, Young Ik EomAbstract:Applications implement their own update protocols to ensure consistency of data on the file system. However, since current file systems provide only a preliminary ordering guarantee, notably fsync, these update protocols become complex, slow, and error-prone. We present a new file system, CFS, that supports a native interface for Applications to maintain crash consistency of their data. Using CFS, Applications can achieve crash consistency of data by declaring code regions that must operate atomically. By utilizing transactional flash storage (SSD/X-FTL), CFS implement a Lightweight mechanism for crash consistency. Without using any heavyweight mechanisms based on redundant writes and ordering, CFS can atomically write multiple data pages and their relevant metadata to storage. We made three technical contributions to develop a crash consistency interface with SSD/X-FTL in CFS: selective atomic propagation of dirty pages, in-memory metadata logging, and delayed deallocation. Our evaluation of five real-world Applications shows that CFS-based Applications significantly outperform ordering versions: 2-5× faster by reducing disk writes 1.9-4.1× and disk cache flushing 1.1-17.6×. Importantly, our porting effort is minimal: CFS requires 317 lines of modifications from 3.5 million lines of ported Applications.
-
USENIX Annual Technical Conference - Lightweight Application-level crash consistency on transactional flash storage
2015Co-Authors: Changwoo Min, Woonhak Kang, Taesoo Kim, Sangwon Lee, Young Ik EomAbstract:Applications implement their own update protocols to ensure consistency of data on the file system. However, since current file systems provide only a preliminary ordering guarantee, notably fsync, these update protocols become complex, slow, and error-prone. We present a new file system, CFS, that supports a native interface for Applications to maintain crash consistency of their data. Using CFS, Applications can achieve crash consistency of data by declaring code regions that must operate atomically. By utilizing transactional flash storage (SSD/X-FTL), CFS implement a Lightweight mechanism for crash consistency. Without using any heavyweight mechanisms based on redundant writes and ordering, CFS can atomically write multiple data pages and their relevant metadata to storage. We made three technical contributions to develop a crash consistency interface with SSD/X-FTL in CFS: selective atomic propagation of dirty pages, in-memory metadata logging, and delayed deallocation. Our evaluation of five real-world Applications shows that CFS-based Applications significantly outperform ordering versions: 2-5× faster by reducing disk writes 1.9-4.1× and disk cache flushing 1.1-17.6×. Importantly, our porting effort is minimal: CFS requires 317 lines of modifications from 3.5 million lines of ported Applications.
Jason Nieh - One of the best experts on this subject based on the ideXlab platform.
-
SIGMETRICS - Transparent, Lightweight Application execution replay on commodity multiprocessor operating systems
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems - SIGMETRICS '10, 2010Co-Authors: Oren Laadan, Nicolas Viennot, Jason NiehAbstract:We present Scribe, the first system to provide transparent, low-overhead Application record-replay and the ability to go live from replayed execution. Scribe introduces new Lightweight operating system mechanisms, rendezvous and sync points, to efficiently record nondeterministic interactions such as related system calls, signals, and shared memory accesses. Rendezvous points make a partial ordering of execution based on system call dependencies sufficient for replay, avoiding the recording overhead of maintaining an exact execution ordering. Sync points convert asynchronous interactions that can occur at arbitrary times into synchronous events that are much easier to record and replay. We have implemented Scribe without changing, relinking, or recompiling Applications, libraries, or operating system kernels, and without any specialized hardware support such as hardware performance counters. It works on commodity Linux operating systems, and commodity multi-core and multiprocessor hardware. Our results show for the first time that an operating system mechanism can correctly and transparently record and replay multi-process and multi-threaded Applications on commodity multiprocessors. Scribe recording overhead is less than 2.5% for server Applications including Apache and MySQL, and less than 15% for desktop Applications including Firefox, Acrobat, OpenOffice, parallel kernel compilation, and movie playback.
-
transparent Lightweight Application execution replay on commodity multiprocessor operating systems
Measurement and Modeling of Computer Systems, 2010Co-Authors: Oren Laadan, Nicolas Viennot, Jason NiehAbstract:We present Scribe, the first system to provide transparent, low-overhead Application record-replay and the ability to go live from replayed execution. Scribe introduces new Lightweight operating system mechanisms, rendezvous and sync points, to efficiently record nondeterministic interactions such as related system calls, signals, and shared memory accesses. Rendezvous points make a partial ordering of execution based on system call dependencies sufficient for replay, avoiding the recording overhead of maintaining an exact execution ordering. Sync points convert asynchronous interactions that can occur at arbitrary times into synchronous events that are much easier to record and replay. We have implemented Scribe without changing, relinking, or recompiling Applications, libraries, or operating system kernels, and without any specialized hardware support such as hardware performance counters. It works on commodity Linux operating systems, and commodity multi-core and multiprocessor hardware. Our results show for the first time that an operating system mechanism can correctly and transparently record and replay multi-process and multi-threaded Applications on commodity multiprocessors. Scribe recording overhead is less than 2.5% for server Applications including Apache and MySQL, and less than 15% for desktop Applications including Firefox, Acrobat, OpenOffice, parallel kernel compilation, and movie playback.
Changwoo Min - One of the best experts on this subject based on the ideXlab platform.
-
Lightweight Application level crash consistency on transactional flash storage
USENIX Annual Technical Conference, 2015Co-Authors: Changwoo Min, Woonhak Kang, Taesoo Kim, Sangwon Lee, Young Ik EomAbstract:Applications implement their own update protocols to ensure consistency of data on the file system. However, since current file systems provide only a preliminary ordering guarantee, notably fsync, these update protocols become complex, slow, and error-prone. We present a new file system, CFS, that supports a native interface for Applications to maintain crash consistency of their data. Using CFS, Applications can achieve crash consistency of data by declaring code regions that must operate atomically. By utilizing transactional flash storage (SSD/X-FTL), CFS implement a Lightweight mechanism for crash consistency. Without using any heavyweight mechanisms based on redundant writes and ordering, CFS can atomically write multiple data pages and their relevant metadata to storage. We made three technical contributions to develop a crash consistency interface with SSD/X-FTL in CFS: selective atomic propagation of dirty pages, in-memory metadata logging, and delayed deallocation. Our evaluation of five real-world Applications shows that CFS-based Applications significantly outperform ordering versions: 2-5× faster by reducing disk writes 1.9-4.1× and disk cache flushing 1.1-17.6×. Importantly, our porting effort is minimal: CFS requires 317 lines of modifications from 3.5 million lines of ported Applications.
-
USENIX Annual Technical Conference - Lightweight Application-level crash consistency on transactional flash storage
2015Co-Authors: Changwoo Min, Woonhak Kang, Taesoo Kim, Sangwon Lee, Young Ik EomAbstract:Applications implement their own update protocols to ensure consistency of data on the file system. However, since current file systems provide only a preliminary ordering guarantee, notably fsync, these update protocols become complex, slow, and error-prone. We present a new file system, CFS, that supports a native interface for Applications to maintain crash consistency of their data. Using CFS, Applications can achieve crash consistency of data by declaring code regions that must operate atomically. By utilizing transactional flash storage (SSD/X-FTL), CFS implement a Lightweight mechanism for crash consistency. Without using any heavyweight mechanisms based on redundant writes and ordering, CFS can atomically write multiple data pages and their relevant metadata to storage. We made three technical contributions to develop a crash consistency interface with SSD/X-FTL in CFS: selective atomic propagation of dirty pages, in-memory metadata logging, and delayed deallocation. Our evaluation of five real-world Applications shows that CFS-based Applications significantly outperform ordering versions: 2-5× faster by reducing disk writes 1.9-4.1× and disk cache flushing 1.1-17.6×. Importantly, our porting effort is minimal: CFS requires 317 lines of modifications from 3.5 million lines of ported Applications.
Woonhak Kang - One of the best experts on this subject based on the ideXlab platform.
-
Lightweight Application level crash consistency on transactional flash storage
USENIX Annual Technical Conference, 2015Co-Authors: Changwoo Min, Woonhak Kang, Taesoo Kim, Sangwon Lee, Young Ik EomAbstract:Applications implement their own update protocols to ensure consistency of data on the file system. However, since current file systems provide only a preliminary ordering guarantee, notably fsync, these update protocols become complex, slow, and error-prone. We present a new file system, CFS, that supports a native interface for Applications to maintain crash consistency of their data. Using CFS, Applications can achieve crash consistency of data by declaring code regions that must operate atomically. By utilizing transactional flash storage (SSD/X-FTL), CFS implement a Lightweight mechanism for crash consistency. Without using any heavyweight mechanisms based on redundant writes and ordering, CFS can atomically write multiple data pages and their relevant metadata to storage. We made three technical contributions to develop a crash consistency interface with SSD/X-FTL in CFS: selective atomic propagation of dirty pages, in-memory metadata logging, and delayed deallocation. Our evaluation of five real-world Applications shows that CFS-based Applications significantly outperform ordering versions: 2-5× faster by reducing disk writes 1.9-4.1× and disk cache flushing 1.1-17.6×. Importantly, our porting effort is minimal: CFS requires 317 lines of modifications from 3.5 million lines of ported Applications.
-
USENIX Annual Technical Conference - Lightweight Application-level crash consistency on transactional flash storage
2015Co-Authors: Changwoo Min, Woonhak Kang, Taesoo Kim, Sangwon Lee, Young Ik EomAbstract:Applications implement their own update protocols to ensure consistency of data on the file system. However, since current file systems provide only a preliminary ordering guarantee, notably fsync, these update protocols become complex, slow, and error-prone. We present a new file system, CFS, that supports a native interface for Applications to maintain crash consistency of their data. Using CFS, Applications can achieve crash consistency of data by declaring code regions that must operate atomically. By utilizing transactional flash storage (SSD/X-FTL), CFS implement a Lightweight mechanism for crash consistency. Without using any heavyweight mechanisms based on redundant writes and ordering, CFS can atomically write multiple data pages and their relevant metadata to storage. We made three technical contributions to develop a crash consistency interface with SSD/X-FTL in CFS: selective atomic propagation of dirty pages, in-memory metadata logging, and delayed deallocation. Our evaluation of five real-world Applications shows that CFS-based Applications significantly outperform ordering versions: 2-5× faster by reducing disk writes 1.9-4.1× and disk cache flushing 1.1-17.6×. Importantly, our porting effort is minimal: CFS requires 317 lines of modifications from 3.5 million lines of ported Applications.
Taesoo Kim - One of the best experts on this subject based on the ideXlab platform.
-
Lightweight Application level crash consistency on transactional flash storage
USENIX Annual Technical Conference, 2015Co-Authors: Changwoo Min, Woonhak Kang, Taesoo Kim, Sangwon Lee, Young Ik EomAbstract:Applications implement their own update protocols to ensure consistency of data on the file system. However, since current file systems provide only a preliminary ordering guarantee, notably fsync, these update protocols become complex, slow, and error-prone. We present a new file system, CFS, that supports a native interface for Applications to maintain crash consistency of their data. Using CFS, Applications can achieve crash consistency of data by declaring code regions that must operate atomically. By utilizing transactional flash storage (SSD/X-FTL), CFS implement a Lightweight mechanism for crash consistency. Without using any heavyweight mechanisms based on redundant writes and ordering, CFS can atomically write multiple data pages and their relevant metadata to storage. We made three technical contributions to develop a crash consistency interface with SSD/X-FTL in CFS: selective atomic propagation of dirty pages, in-memory metadata logging, and delayed deallocation. Our evaluation of five real-world Applications shows that CFS-based Applications significantly outperform ordering versions: 2-5× faster by reducing disk writes 1.9-4.1× and disk cache flushing 1.1-17.6×. Importantly, our porting effort is minimal: CFS requires 317 lines of modifications from 3.5 million lines of ported Applications.
-
USENIX Annual Technical Conference - Lightweight Application-level crash consistency on transactional flash storage
2015Co-Authors: Changwoo Min, Woonhak Kang, Taesoo Kim, Sangwon Lee, Young Ik EomAbstract:Applications implement their own update protocols to ensure consistency of data on the file system. However, since current file systems provide only a preliminary ordering guarantee, notably fsync, these update protocols become complex, slow, and error-prone. We present a new file system, CFS, that supports a native interface for Applications to maintain crash consistency of their data. Using CFS, Applications can achieve crash consistency of data by declaring code regions that must operate atomically. By utilizing transactional flash storage (SSD/X-FTL), CFS implement a Lightweight mechanism for crash consistency. Without using any heavyweight mechanisms based on redundant writes and ordering, CFS can atomically write multiple data pages and their relevant metadata to storage. We made three technical contributions to develop a crash consistency interface with SSD/X-FTL in CFS: selective atomic propagation of dirty pages, in-memory metadata logging, and delayed deallocation. Our evaluation of five real-world Applications shows that CFS-based Applications significantly outperform ordering versions: 2-5× faster by reducing disk writes 1.9-4.1× and disk cache flushing 1.1-17.6×. Importantly, our porting effort is minimal: CFS requires 317 lines of modifications from 3.5 million lines of ported Applications.