Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.