ClusterFetch: A Lightweight Prefetcher for Intensive Disk Reads.
Saved in:
| Title: | ClusterFetch: A Lightweight Prefetcher for Intensive Disk Reads. |
|---|---|
| Authors: | Ryu, Junhee1, Lee, Dongeun2, Shin, Kang G.3, Kang, Kyungtae1 |
| Source: | IEEE Transactions on Computers. Feb2018, Vol. 67 Issue 2, p284-290. 7p. |
| Subjects: | Disk access (Computer science), Computer memory management, Computer storage devices, Algorithms, Linux operating systems |
| Abstract: | By overlapping disk accesses with computation-intensive operations, prefetching can reduce delays in launching an application and in loading significant amounts of data while the application is running. The key to effective prefetching is making the tradeoff between the mining accuracy of selecting relevant blocks, and the time to decide those blocks. To address this problem, we propose a new prefetcher called ClusterFetch. In its learning mode, ClusterFetch detects periods of intensive disk accesses by monitoring the speed at which read requests are queued; it re-organizes these reads and locates the file opened by the application just before each such period. During subsequent runs of the same application, ClusterFetch prefetches the data associated with the opening of a “trigger” file. Our experimental results show that ClusterFetch implemented in Linux can reduce the application launch time by up to 41.3 percent and the loading time by up to 38.2 percent, while taking up less than 200 KB of main memory. [ABSTRACT FROM AUTHOR] |
| Copyright of IEEE Transactions on Computers is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 127333222 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: ClusterFetch: A Lightweight Prefetcher for Intensive Disk Reads. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Ryu%2C+Junhee%22">Ryu, Junhee</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Lee%2C+Dongeun%22">Lee, Dongeun</searchLink><relatesTo>2</relatesTo><br /><searchLink fieldCode="AR" term="%22Shin%2C+Kang+G%2E%22">Shin, Kang G.</searchLink><relatesTo>3</relatesTo><br /><searchLink fieldCode="AR" term="%22Kang%2C+Kyungtae%22">Kang, Kyungtae</searchLink><relatesTo>1</relatesTo> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22IEEE+Transactions+on+Computers%22">IEEE Transactions on Computers</searchLink>. Feb2018, Vol. 67 Issue 2, p284-290. 7p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Disk+access+%28Computer+science%29%22">Disk access (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+memory+management%22">Computer memory management</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+storage+devices%22">Computer storage devices</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Linux+operating+systems%22">Linux operating systems</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: By overlapping disk accesses with computation-intensive operations, prefetching can reduce delays in launching an application and in loading significant amounts of data while the application is running. The key to effective prefetching is making the tradeoff between the mining accuracy of selecting relevant blocks, and the time to decide those blocks. To address this problem, we propose a new prefetcher called ClusterFetch. In its learning mode, ClusterFetch detects periods of intensive disk accesses by monitoring the speed at which read requests are queued; it re-organizes these reads and locates the file opened by the application just before each such period. During subsequent runs of the same application, ClusterFetch prefetches the data associated with the opening of a “trigger” file. Our experimental results show that ClusterFetch implemented in Linux can reduce the application launch time by up to 41.3 percent and the loading time by up to 38.2 percent, while taking up less than 200 KB of main memory. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of IEEE Transactions on Computers is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=127333222 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1109/TC.2017.2748939 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 7 StartPage: 284 Subjects: – SubjectFull: Disk access (Computer science) Type: general – SubjectFull: Computer memory management Type: general – SubjectFull: Computer storage devices Type: general – SubjectFull: Algorithms Type: general – SubjectFull: Linux operating systems Type: general Titles: – TitleFull: ClusterFetch: A Lightweight Prefetcher for Intensive Disk Reads. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Ryu, Junhee – PersonEntity: Name: NameFull: Lee, Dongeun – PersonEntity: Name: NameFull: Shin, Kang G. – PersonEntity: Name: NameFull: Kang, Kyungtae IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 02 Text: Feb2018 Type: published Y: 2018 Identifiers: – Type: issn-print Value: 00189340 Numbering: – Type: volume Value: 67 – Type: issue Value: 2 Titles: – TitleFull: IEEE Transactions on Computers Type: main |
| ResultId | 1 |