Open AccessExploiting Internal Parallelism of SSD for Hash Join
Author(s) -
Yang Lianghuai,
Zhang Ting,
Fan Yulei,
Gong Weihua,
Yu Jian
Publication year - 2019
Publication title -
chinese journal of electronics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.267
H-Index - 25
eISSN - 2075-5597
pISSN - 1022-4653
DOI - 10.1049/cje.2019.06.009
Subject(s) - computer science , hash function , granularity , parallel computing , parallelism (grammar) , queue , join (topology) , throughput , set (abstract data type) , equivalence (formal languages) , scheme (mathematics) , computer network , operating system , mathematics , programming language , discrete mathematics , mathematical analysis , wireless , combinatorics
By regarding a Solid‐state drive(SSD) as a black box and observing its external behavior instead of peeping into its internal details, we investigate how the factors of I/O granularity and I/O queue depth influence the throughput of an SSD through a series of experiments and relate to the internal parallelism of an SSD, and then propose the concept of Combination equivalence class (CEC) as the set of combination pairs of these two factors. A novel buffer allocation scheme for hash join over SSDs is invented by taking both factors into account. Extensive experiments demonstrate the effectiveness of our scheme.