Wyniki wyszukiwania - BazTech

1

Heuristic algorithms for joint optimization of unicast and anycast traffic in elastic optical network-based large-scale computing systems

Markowski M.

International Journal of Applied Mathematics and Computer Science

|

2017

|

Vol. 27, no. 3

605--622

EN

In recent years elastic optical networks have been perceived as a prospective choice for future optical networks due to better adjustment and utilization of optical resources than is the case with traditional wavelength division multiplexing networks. In the paper we investigate the elastic architecture as the communication network for distributed data centers. We address the problems of optimization of routing and spectrum assignment for large-scale computing systems based on an elastic optical architecture; particularly, we concentrate on anycast user to data center traffic optimization. We assume that computational resources of data centers are limited. For this offline problems we formulate the integer linear programming model and propose a few heuristics, including a meta-heuristic algorithm based on a tabu search method. We report computational results, presenting the quality of approximate solutions and efficiency of the proposed heuristics, and we also analyze and compare some data center allocation scenarios.

2

Automatic parametric fault detection in complex analog systems based on a method of minimum node selection

Bilski A., Wojciechowski J.

International Journal of Applied Mathematics and Computer Science

|

2016

|

Vol. 26, no. 3

655--668

EN

The aim of this paper is to introduce a strategy to find a minimal set of test nodes for diagnostics of complex analog systems with single parametric faults using the support vector machine (SVM) classifier as a fault locator. The results of diagnostics of a video amplifier and a low-pass filter using tabu search along with genetic algorithms (GAs) as node selectors in conjunction with the SVM fault classifier are presented. General principles of the diagnostic procedure are first introduced, and then the proposed approach is discussed in detail. Diagnostic results confirm the usefulness of the method and its computational requirements. Conclusions on its wider applicability are provided as well.

3

Metoda tabu search w wielosposobowym problemie gniazdowym

Nowicki E.

Automatyka / Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie

|

1999

|

T. 3, z. 1

251-258

PL

W pracy rozważa się problem minimalizacji terminu zakończenia wykonywania wszystkich zadań w gniazdowym problemie szeregowania, w którym dla każdej operacji określony jest zbiór sposobów jej wykonywania. Przedstawiono pewien szybki algorytm apro-ksymacyjny dla rozwiązania postawionego problemu. Algorytm oparto na technice tabu search, wykorzystując specyficzną definicję sąsiedztwa. Sąsiedztwo to jest określone na bazie bloków operacji. Istota algorytmu polega na wykorzystaniu ich własności eliminacyjnych, w celu przeszukiwania tylko najbardziej obiecujących części sąsiedztwa. Przeprowadzone eksperymenty obliczeniowe (do 300 operacji, 12 sposobów wykonywania dla każdej operacji i 15 maszyn) potwierdziły dobre własności numeryczne algorytmu.

EN

The paper deals with the problem of finding a minimum make-span in a multi-mode job shop. A fast approximation algorithm for this problem is presented. The algorithm is based on a tabu search technique with a specific neighborhood definition. This neighborhood is defined using blocks of operations. The essence of the algorithm consists in using some properties which allow us to search only the most profitable part of the neighborhood. Computational experiments (up to 300 operations, 12 modes for any operation and 15 machines) show good numerical properties of the algorithm.