TY - JOUR
T1 - Layouts for improved hierarchical parallel computations
AU - Hirsch, Michael
AU - Klein, Shmuel T.
AU - Toaff, Yair
PY - 2014/9
Y1 - 2014/9
N2 - New layouts for the assignment of a set of n parallel processors to perform certain tasks in several hierarchically connected layers are suggested, leading, after some initialization phase, to the full exploitation of all of the processing power all of the time. This framework is useful for a variety of string theoretic problems, ranging from modular arithmetic used, among others, in Karp-Rabin type rolling hashes, as well as in cryptographic applications, and up to data compression and error-correcting codes.
AB - New layouts for the assignment of a set of n parallel processors to perform certain tasks in several hierarchically connected layers are suggested, leading, after some initialization phase, to the full exploitation of all of the processing power all of the time. This framework is useful for a variety of string theoretic problems, ranging from modular arithmetic used, among others, in Karp-Rabin type rolling hashes, as well as in cryptographic applications, and up to data compression and error-correcting codes.
KW - Data compression
KW - Modular arithmetic
KW - Parallel processors
UR - http://www.scopus.com/inward/record.url?scp=84907600144&partnerID=8YFLogxK
U2 - 10.1016/j.jda.2014.06.002
DO - 10.1016/j.jda.2014.06.002
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84907600144
SN - 1570-8667
VL - 28
SP - 23
EP - 30
JO - Journal of Discrete Algorithms
JF - Journal of Discrete Algorithms
ER -