Click to open the HelpDesk interface
AECE - Front page banner



JCR Impact Factor: 0.699
JCR 5-Year IF: 0.674
Issues per year: 4
Current issue: Nov 2018
Next issue: Feb 2019
Avg review time: 83 days


Stefan cel Mare
University of Suceava
Faculty of Electrical Engineering and
Computer Science
13, Universitatii Street
Suceava - 720229

Print ISSN: 1582-7445
Online ISSN: 1844-7600
WorldCat: 643243560
doi: 10.4316/AECE


2,162,054 unique visits
Since November 1, 2009

No robots online now


SCImago Journal & Country Rank

SEARCH ENGINES - Google Pagerank


Anycast DNS Hosting

 Volume 18 (2018)
     »   Issue 4 / 2018
     »   Issue 3 / 2018
     »   Issue 2 / 2018
     »   Issue 1 / 2018
 Volume 17 (2017)
     »   Issue 4 / 2017
     »   Issue 3 / 2017
     »   Issue 2 / 2017
     »   Issue 1 / 2017
 Volume 16 (2016)
     »   Issue 4 / 2016
     »   Issue 3 / 2016
     »   Issue 2 / 2016
     »   Issue 1 / 2016
 Volume 15 (2015)
     »   Issue 4 / 2015
     »   Issue 3 / 2015
     »   Issue 2 / 2015
     »   Issue 1 / 2015
  View all issues  


Clarivate Analytics published the InCites Journal Citations Report for 2017. The JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.699, and the JCR 5-Year Impact Factor is 0.674.

Thomson Reuters published the Journal Citations Report for 2016. The JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.595, and the JCR 5-Year Impact Factor is 0.661.

With new technologies, such as mobile communications, internet of things, and wide applications of social media, organizations generate a huge volume of data, much faster than several years ago. Big data, characterized by high volume, diversity and velocity, increasingly drives decision making and is changing the landscape of business intelligence, from governments to private organizations, from communities to individuals. Big data analytics that discover insights from evidences has a high demand for computing efficiency, knowledge discovery, problem solving, and event prediction. We dedicate a special section of Issue 4/2017 to Big Data. Prospective authors are asked to make the submissions for this section no later than the 31st of May 2017, placing "BigData - " before the paper title in OpenConf.

Read More »


  4/2011 - 7

An Optimal Initial Partitioning of Large Data Model in Utility Management Systems

CAPKO, D. See more information about CAPKO, D. on SCOPUS See more information about CAPKO, D. on IEEExplore See more information about CAPKO, D. on Web of Science, ERDELJAN, A. See more information about  ERDELJAN, A. on SCOPUS See more information about  ERDELJAN, A. on SCOPUS See more information about ERDELJAN, A. on Web of Science, POPOVIC, M. See more information about  POPOVIC, M. on SCOPUS See more information about  POPOVIC, M. on SCOPUS See more information about POPOVIC, M. on Web of Science, SVENDA, G. See more information about SVENDA, G. on SCOPUS See more information about SVENDA, G. on SCOPUS See more information about SVENDA, G. on Web of Science
Click to see author's profile in See more information about the author on SCOPUS SCOPUS, See more information about the author on IEEE Xplore IEEE Xplore, See more information about the author on Web of Science Web of Science

Download PDF pdficon (608 KB) | Citation | Downloads: 1,027 | Views: 3,035

Author keywords
partitioning algorithms, SCADA systems, power system management, load flow, parallel processing

References keywords
partitioning(10), parallel(8), computing(6), graph(5), systems(4), power(4), multilevel(4), ipdps(4), graphs(4), distributed(4)
Blue keywords are present in both the references section and the paper title.

About this article
Date of Publication: 2011-11-30
Volume 11, Issue 4, Year 2011, On page(s): 41 - 46
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2011.04007
Web of Science Accession Number: 000297764500007
SCOPUS ID: 84856622601

Quick view
Full text preview
Modern Utility Management Systems which utilize multiprocessor systems for efficient processing of large data model are considered in this paper. The necessary preconditions for the efficient calculation are optimal load balancing of processors and data model partitioning among processors. The novel multilevel Super-Roots (SR) algorithm was developed to improve existing algorithms (e. i. METIS) for initial partitioning of data model. The proposed algorithms are applied on data model describing large electricity power distribution network. Experiments show that SR algorithm achieves better results than METIS multilevel algorithm in many cases.

References | Cited By  «-- Click to see who has cited this paper

[1] Utility Management Systems (UMS) Data Access Facility DAF, OMG Specification, Version 2.0.1, 2005.

[2] M. Craus, C. Bulancea, "Using Agent Technology Combined with ACO Metaheuristics on Load Balancing Algorithms", Advances in Electrical and Computer Engineering, vol. 4, no. 2, pp. 55-59, 2004.

[3] K. Schloegel, G. Karypis, V. Kumar, "Graph Partitioning for High Performance Scientific Simulations", Technical Report, University of Minesota, 2000.

[4] B. Henderson, T. G. Kolda, "Graph partitioning models for parallel computing", Parallel Computing, vol. 26, no. 12, pp. 1519-1534, 2000.
[CrossRef] [Web of Science Times Cited 168]

[5] M. R. Garey, D. S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness", W.H.Freeman, San Francisco, 1979.

[6] B. W. Kernighan, S. Lin, "An efficient heuristic procedure for partitioning graphs", The Bell System Technical Journal, vol. 49, no. 2, pp. 291-307, 1970.

[7] C. M. Fiduccia, R. M. Mattheyses, "A linear time heuristic for improving network partitions", In: Proc. 19th IEEE Design Automation Conference, pp. 175-181, 1982.
[CrossRef] [SCOPUS Times Cited 1224]

[8] G. Karypis, V. Kumar, "A fast and high quality multilevel scheme for partitioning irregular graphs", SIAM Journal of Scientific Computing, vol. 20, no. 1, pp. 359-392, 1998.
[CrossRef] [Web of Science Times Cited 1775] [SCOPUS Times Cited 2505]

[9] Henderson, B., Leland, R., "A Multilevel Algorithm for Partitioning Graphs", Proceedings of ACM/IEEE conference on Supercomputing, San Diego, 1995.

[10] C. Walshaw, M. Cross, "JOSTLE: Parallel Multilevel Graph-Partitioning Software - An Overview". In F. Magoules, editor, Mesh Partitioning Techniques and Domain Decomposition Techniques, pp. 27-58, Civil-Comp Ltd, 2007.

[11] F. Pellegrini, J. Roman, "SCOTCH: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs", HPCN-Europe, Springer LNCS 1067, pp. 493-498, 1996.

[12] H. Meyerhenke, B. Monien, S. Schamberger, "Accelerating shape optimizing load balancing for parallel FEM simulations by algebraic multigrid", In Proc.20th Intl. Parallel and Distributed Processing Symposium (IPDPS'06). IEEE, 2006.
[CrossRef] [SCOPUS Times Cited 20]

[13] Cybenko, G., "Dynamic load balancing for distributed memory multiprocessors", Journal of Parallel and Distributed Computing., vol. 7, no. 2, pp. 279-301, 1989.
[CrossRef] [Web of Science Times Cited 479] [SCOPUS Times Cited 625]

[14] H. Meyerhenke, B Monien, T. Sauerwald, "A new diffusion-based multilevel algorithm for computing graph partitions of very high quality", In: Proceedings of the 22nd International Parallel and Distributed Processing Symposium (IPDPS'08), IEEE Computer Society, pp. 1-13, 2008.
[CrossRef] [SCOPUS Times Cited 26]

[15] IEC 61970 Energy management system application program interface (EMS-API) - Part 301: Common Information Model (CIM) Base, IEC, Edition 2.0, 2007.

[16] D. Capko, A. Erdeljan, M. Popovic, G. Svenda, "An Optimal Relationship-Based Partitioning of Large Datasets", 14th East-European Conference on Advances in Databases and Information Systems, Novi Sad, Serbia, 2010.

[17] C. Godsil, G. Royle, Algebraic Graph Theory, Springer Verlag, 2001.

[18] A. Grama, A. Gupta, G. Karypis, V. Kumar, Introduction to Parallel Computing, Second Edition, Addison Wesley, 2003.

[19] R. E. Korf, "A Complete Anytime Algorithm for Number Partitioning", Artificial Intelligence, vol.106, no. 2, pp.181-203, 1998.
[CrossRef] [Web of Science Times Cited 57] [SCOPUS Times Cited 80]

[20] R. E. Korf, "Multi-Way Number Partitioning", International Joint Conference on Artificial Intelligence, Pasadena, California, US, 2009.

[21] M. Popovic, I. Basicevic, V. Vrtunski, "A Task Tree Executor: New Runtime for Parallelized Legacy Software", 16th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems, ECBS 2009, San Francisco, USA, 2009.
[CrossRef] [Web of Science Times Cited 2] [SCOPUS Times Cited 13]

[22] D. Shirmohammadi, H. W. Hong, A. Semlyen, G. X. Luo, "A Compensation-Based Power Flow Method For Weakly Meshed Distribution And Transmission Networks", IEEE Transactions on Power Systems, vol. 3, no. 2, pp. 753-762, 1988.
[CrossRef] [Web of Science Times Cited 532] [SCOPUS Times Cited 744]

[23] B. Allaoua, A. Laoufi, "Optimal Power Flow Solution Using Ant Manners for Electrical Network", Advances in Electrical and Computer Engineering, vol. 9, no. 2, pp. 34-40, 2009.
[CrossRef] [Full Text] [Web of Science Times Cited 19] [SCOPUS Times Cited 24]

[24] G. Grigoras, G. Cartina, E. C. Bobric, "Strategies for Power/Energy Saving in Distribution Networks", Advances in Electrical and Computer Engineering, vol. 9, no.1, pp. 61-64, 2010.
[CrossRef] [Full Text] [Web of Science Times Cited 6] [SCOPUS Times Cited 8]

References Weight

Web of Science® Citations for all references: 3,038 TCR
SCOPUS® Citations for all references: 5,269 TCR

Web of Science® Average Citations per reference: 127 ACR
SCOPUS® Average Citations per reference: 220 ACR

TCR = Total Citations for References / ACR = Average Citations per Reference

We introduced in 2010 - for the first time in scientific publishing, the term "References Weight", as a quantitative indication of the quality ... Read more

Citations for references updated on 2019-02-14 10:19 in 98 seconds.

Note1: Web of Science® is a registered trademark of Clarivate Analytics.
Note2: SCOPUS® is a registered trademark of Elsevier B.V.
Disclaimer: All queries to the respective databases were made by using the DOI record of every reference (where available). Due to technical problems beyond our control, the information is not always accurate. Please use the CrossRef link to visit the respective publisher site.

Copyright ©2001-2019
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania

All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.

Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.

Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.

Website loading speed and performance optimization powered by: