Declustering signature files based on a dynamic measure

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 939
  • Download : 28
For processing a signature in parallel, a declustering algorithm that must avoid data skew and execution skew is needed. In this paper we propose a new signature file declustering method, called MIN-entropy, that achieves balanced distribution for effective parallel processing. The MIN-entropy declusters a signature file based on a new dynamic measure of execution load, called signature-entropy, that is derived from the previously declustered signature. Since the MIN-entropy effectively declusters a signature file by using the dynamic measure, it can provide high performance for a variety of workloads and configurations. We show through the simulation experiments that the MIN-entropy improves performance under various data workloads. (C) 2000 Elsevier Science B.V. All rights reserved.
Publisher
ELSEVIER SCIENCE BV
Issue Date
2000-06
Language
English
Article Type
Article
Citation

INFORMATION PROCESSING LETTERS, v.74, no.5-6, pp.235 - 241

ISSN
0020-0190
URI
http://hdl.handle.net/10203/1999
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0