Fast concurrent access to parallel disks

DOI10.1007/S00453-002-0987-0MaRDI QIDQ1566373zbMATH OpenOpenAlexFDO

Authors Peter Sanders, Sebastian Egner, J. Korst

Publication date 2 June 2003

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11858/00-001M-0000-0014-6F94-0

zbMATH Keywords

randomized algorithmschedulingload balancingexternal memory

Mathematics Subject Classification ID

Randomized algorithms (68W20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Parallel algorithms in computer science (68W10)

Recommendations

• Publication:4952709
• Reconciling simplicity and realism in parallel disk models
• scientific article; zbMATH DE number 1424311
• Distribution sort with randomized cycling
• Distribution sort with randomized cycling

Cited in

(13)

• Long-term balanced allocation via thinning
• scientific article; zbMATH DE number 1775431 (Why is no real title available?)
• Application of principal component analysis to multi-disk concurrent accessing
• An efficient programming model for memory-intensive recursive algorithms using parallel disks
• Distribution sort with randomized cycling
• Reconciling simplicity and realism in parallel disk models
• SSE and SSD: page-efficient searchable symmetric encryption
• Balanced allocation and dictionaries with tightly packed constant size bins
• scientific article; zbMATH DE number 1445386 (Why is no real title available?)
• Quality of security adaptation in parallel disk systems
• Load balancing under \(d\)-thinning
• Orientability Thresholds for Random Hypergraphs
• A new approach to the orientation of random hypergraphs

This page was built for publication: Fast concurrent access to parallel disks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1566373)