Jerzy Balicki

Prof. Jerzy Balicki

Faculty of Mathematics and Computer Science, Warsaw University of Technology, Warsaw, Poland
orcid

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 December 2021 in Entropy
Verified
Journal Article
Open access
PDF file
Jerzy BalickiJerzy Balicki
Jerzy Balicki
Particle swarm optimization algorithm (PSO) is an effective metaheuristic that can determine Pareto-optimal solutions. We propose an extended PSO by introducing quantum gates in order to ensure the diversity of particle populations that are looking for efficient alternatives. The quality of solutions was verified in the issue of assignment of resources in the computing cloud to improve the live migration of virtual machines. We consider the multi-criteria optimization problem of deep learning-based models embedded into virtual machines. Computing clouds with deep learning agents can support several areas of education, smart city or economy. Because deep learning agents require lots of computer resources, seven criteria are studied such as electric power of hosts, reliability of cloud, CPU workload of the bottleneck host, communication capacity of the critical node, a free RAM capacity of the most loaded memory, a free disc memory capacity of the most busy storage, and overall computer costs. Quantum gates modify an accepted position for the current location of a particle. To verify the above concept, various simulations have been carried out on the laboratory cloud based on the OpenStack platform. Numerical experiments have confirmed that multi-objective quantum-inspired particle swarm optimization algorithm provides better solutions than the other metaheuristics.

27 November 2002
Verified
Conference Paper
Closed access
Jerzy BalickiJerzy Balicki
Jerzy Balicki
ZKZ. Kitowski
Z. Kitowski
Andrzej StatecznyAndrzej Stateczny
Andrzej Stateczny

1 January 2014
Verified
Book Chapter
Closed access
PDF file
Jerzy BalickiJerzy Balicki
Jerzy Balicki
WKWaldemar Korłub
Waldemar Korłub
JSjulian szymanski
julian szymanski
MZMarcin Zakidalski
Marcin Zakidalski

6 July 2001 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
Jerzy BalickiJerzy Balicki
Jerzy Balicki
ZKZygmunt Kitowski
Zygmunt Kitowski


1 June 2013
Verified
Conference Paper
Closed access
Jerzy BalickiJerzy Balicki
Jerzy Balicki
WKWaldemar Korlub
Waldemar Korlub
HKHenryk Krawczyk
Henryk Krawczyk
JPJacek Paluszak
Jacek Paluszak
Volunteer computing systems like BOINC or Comcute are strongly supported by a great number of volunteers who contribute resources of their computers via the Web. So, the high efficiency of such grid system is required, and that is why we have formulated a multi-criterion optimization problem for a volunteer grid system design. In that dilemma, both the cost of the host system and workload of a bottleneck host are minimized. On the other hand, a reliability of this grid structure is maximized. Moreover, genetic programming has been applied to determine the Pareto solutions. Finally, a negative selection procedure to handle constraints has been discussed.