Abstract
Application prefetchers improve application launch performance through either I/O reordering or I/O interleaving. However, there has been no proposal to combine the two techniques together, missing the opportunity for further optimization. We present a new application prefetching technique to take advantage of both the approaches. We evaluated our method with a set of applications to demonstrate that it reduces cold start application launch time by 50%, which is an improvement of 22% from the I/O reordering technique.
- Sedat Akyürek and Kenneth Salem. 1995. Adaptive block rearrangement. ACM Trans. Comput. Syst. 13, 2 (1995), 89--121. Google Scholar
Digital Library
- Medha Bhadkamkar, Jorge Guerra, Luis Useche, Sam Burnett, Jason Liptak, Raju Rangaswami, and Vagelis Hristidis. 2009. BORG: Block-reORGanization for self-optimizing storage systems. In Proceedings of the USENIX Conference on File and Storage Technologies (FAST’09). 183--196. Google Scholar
Digital Library
- Blktrace(8). 2006. Linux Man Page. Retrieved from http://linux.die.net/man/8/blktrace.Google Scholar
- John S. Bucy and Gregory R. Ganger. 2003. The DiskSim Simulation Environment Version 3.0 Reference Manual. Technical Report CMU--CS--03--102. Department of Computer Science, Carnegie-Mellon University.Google Scholar
- Xiaoning Ding, Song Jiang, Feng Chen, Kei Davis, and Xiaodong Zhang. 2007. DiskSeen: Exploiting disk layout and access history to enhance I/O prefetch. In Proceedings of the USENIX Annual Technical Conference (USENIX ATC’07). 261--274. Google Scholar
Digital Library
- Hai Huang, Wanda Hung, and Kang G. Shin. 2005. FS2: Dynamic data replication in free disk space for improving disk performance and energy consumption. In Proceedings of the ACM Symposium on Operating Systems Principles (SOSP’05). 263--276. Google Scholar
Digital Library
- Yongsoo Joo, Junhee Ryu, Sangsoo Park, and Kang G. Shin. 2011. FAST: Quick application launch on solid-state drives. In Proceedings of the USENIX Conference on File and Storage Technologies (FAST’11). 259--272. Google Scholar
Digital Library
- Zhenmin Li, Zhifeng Chen, Sudarshan M. Srinivasan, and Yuanyuan Zhou. 2004. C-Miner: Mining block correlations in storage systems. In Proceedings of the USENIX Conference on File and Storage Technologies (FAST’04). 173--186. Google Scholar
Digital Library
- Ketil Lund and Vera Goebel. 2003. Adaptive disk scheduling in a multimedia DBMS. In Proceedings of the 11th ACM International Conference on Multimedia (MULTIMEDIA’03). 65--74. Google Scholar
Digital Library
- Anna Povzner, Tim Kaldewey, Scott Brandt, Richard Golding, Theodore M. Wong, and Carlos Maltzahn. 2008. Efficient guaranteed disk request scheduling with fahrrad. In Proceedings of the 3rd ACM SIGOPS/EuroSys European Conference on Computer Systems 2008 (EUROSYS’08). 13--25. Google Scholar
Digital Library
- A. L. N. Reddy, Jim Wyllie, and K. B. R. Wijayaratne. 2005. Disk scheduling in a multimedia I/O system. ACM Trans. Multimedia Comput. Commun. Appl. 1, 1 (Feb. 2005), 37--59. Google Scholar
Digital Library
- Mark E. Russinovich and David Solomon. 2004. Microsoft Windows Internals (4th ed.). Microsoft Press, 458--462.Google Scholar
- Jiri Schindler, Sandip Shete, and Keith A. Smith. 2011. Improving throughput for small disk requests with proximal I/O. In Proceedings of the USENIX Conference on File and Storage Technologies (FAST’11). 133--147. Google Scholar
Digital Library
- Bruce L. Worthington, Gregory R. Ganger, and Yale N. Patt. 1994. Scheduling algorithms for modern disk drives. In Proceedings of the ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems (SIGMETRICS’94). 241--251. Google Scholar
Digital Library
- Xuechen Zhang, Kei Davis, and Song Jiang. 2011. QoS support for end users of I/O-intensive applications using shared storage systems. In Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC’11). Article 18, 12 pages. Google Scholar
Digital Library
Index Terms
Exploiting I/O Reordering and I/O Interleaving to Improve Application Launch Performance
Recommendations
Increasing hardware data prefetching performance using the second-level cache
Techniques to reduce or tolerate large memory latencies are critical for achieving high processor performance. Hardware data prefetching is one of the most heavily studied solutions, but it is essentially applied to first-level caches where it can ...
A Performance Study of Instruction Cache Prefetching Methods
Prefetching methods for instruction caches are studied via trace-driven simulation. The two primary methods are "fall-through" prefetch (sometimes referred to as "one block lookahead") and "target" prefetch. Fall-through prefetches are for sequential ...
Inter-core cooperative TLB for chip multiprocessors
ASPLOS '10Translation Lookaside Buffers (TLBs) are commonly employed in modern processor designs and have considerable impact on overall system performance. A number of past works have studied TLB designs to lower access times and miss rates, specifically for ...






Comments