Abstract
Modern adaptive applications utilize multiprocessor systems for efficient processing of large datasets where initial and dynamic partitioning of large datasets is necessary to obtain an optimal load balancing among processors. We applied evolutionary algorithms (Genetic Algorithm and Particle Swarm Optimization) for initial partitioning, and diffusion (DR) and cut-and-paste (CP) algorithms for dynamic partitioning. Modified versions of DR and CP algorithms are developed to improve dynamic partitioning running in NUMA multiprocessor systems. The proposed algorithms were applied on datasets describing large electricity power distribution systems and experimental results prove reductions of processor load imbalance and performance improvements.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bui, T.N., Moon, B.R.: Genetic Algorithm and Graph Partitioning. IEEE Transaction of Computers 45(7), 841–855 (1996)
Laskari, E., Parsopoulos, K., Vrahatis, M.: Particle swarm optimization for integer programming. In: Proceedings of the IEEE Congress on Evolutionary Computation, Honolulu, Hawaii USA, vol. 2, pp. 1582–1587 (2002)
Schloegel, K., Karypis, G., Kumar, V.: Multilevel diffusion schemes for repartitioning of adaptive meshes. Journal of Parallel and Distributed Computing 47(2), 109–124 (1997)
Schloegel, K., Karypis, G., Kumar, V.: Wavefront diffusion and LMSR: Algorithms for dynamic repartitioning of adaptive meshes, Technical Report TR 98-034, Dept. of Computer Science and Engineering, University of Minnesota (1998)
IEC 61970 Energy management system application program interface (EMS-API) - Part 301: Common Information Model (CIM) Base”, IEC, Edition 2.0 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Capko, D., Erdeljan, A., Popovic, M., Svenda, G. (2010). An Optimal Relationship-Based Partitioning of Large Datasets. In: Catania, B., Ivanović, M., Thalheim, B. (eds) Advances in Databases and Information Systems. ADBIS 2010. Lecture Notes in Computer Science, vol 6295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15576-5_42
Download citation
DOI: https://doi.org/10.1007/978-3-642-15576-5_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15575-8
Online ISBN: 978-3-642-15576-5
eBook Packages: Computer ScienceComputer Science (R0)