Fast concurrent access to parallel disks

DOI10.1007/S00453-002-0987-0zbMath1026.68013OpenAlexW3138170197MaRDI QIDQ1566373

Peter Sanders, Sebastian Egner, Jan H. M. 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

schedulingrandomized algorithmload balancingexternal memory

Mathematics Subject Classification ID

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

Related Items (6)

SSE and SSD: page-efficient searchable symmetric encryption ⋮ Balanced allocation and dictionaries with tightly packed constant size bins ⋮ Long-term balanced allocation via thinning ⋮ Orientability Thresholds for Random Hypergraphs ⋮ Load balancing under \(d\)-thinning ⋮ A new approach to the orientation of random hypergraphs

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