Analysis of simple randomized buffer management for parallel I/O

Simple item page
dc.citation.firstpage47en_US
dc.citation.issueNumber1eng
dc.citation.journalTitleInformation Processing Letterseng
dc.citation.lastpage52en_US
dc.citation.volumeNumber90eng
dc.contributor.authorKallahalla, Mahesh
dc.contributor.authorVarman, Peter J.
dc.contributor.orgElectrical and Computer Engineeringeng
dc.contributor.orgVarman Laboratoryeng
dc.date.accessioned2015-09-15T17:01:43Z
dc.date.available2015-09-15T17:01:43Z
dc.date.issued2004-04
dc.description.abstractBuffer management for a D-disk parallel I/O system is considered in the context of randomized placement of data on the disks. A simple prefetching and caching algorithm PHASE-LRU using bounded lookahead is described and analyzed. It is shown that PHASE-LRU performs an expected number of I/Os that is within a factor (logD/log logD) of the number performed by an optimal off-line algorithm. In contrast, any deterministic buffereng
dc.identifier.citationM. Kallahalla and P. J. Varman, "Analysis of simple randomized buffer management for parallel I/O," <i>Information Processing Letters,</i> vol. 90, no. 1, 2004.
dc.identifier.doihttp://dx.doi.org/10.1016/S0020-0190(04)00053-5en_US
dc.identifier.urihttps://hdl.handle.net/1911/81638
dc.language.isoengeng
dc.publisherElsevier
dc.subject.keywordelectrical and computer engineeringeng
dc.subject.keywordI/Oeng
dc.subject.keywordInformation Storageeng
dc.titleAnalysis of simple randomized buffer management for parallel I/Oeng
dc.typeJournal articleeng
dc.type.dcmiTexteng
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Analysis.pdf
Size:
160.55 KB
Format:
Adobe Portable Document Format
Description:
Download
Collections
ECE Publications