Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 2013

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: linear Diophantine constraints

Sortuj według:

Ogranicz wyniki do:

Reconfiguration of logical communication channels

Bolanowski M., Paszkiewicz A.

Journal of Theoretical and Applied Computer Science

2013

Vol. 7, nr 3

21--28

In this paper a new reconfiguration of interconnection networks algorithm was proposed for the computational systems and the logical network connection. The proposed solution is based on the presentation of the network and base requirements in the form of linear Diophantine constraints solution in area {0,1}. A set of topologies that meet initial assumptions is obtained as the solution of the system of constrains. In the next step, the final topology is selected, which can be used to reconfigure the interconnection network. It is done using the proposed method of selecting the optimal solution from the set of acceptable solutions, taking into account a certain level of indeterminacy.

A set of connection network synthesis based on the linear Diophantine constraints solution in area {0,1}

Bolanowski M., Paszkiewicz A.

Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica

2013

Vol. 13, no. 1

11--21

In the paper we present a method for synthesis of a set of connection networks, which fulfill the designer’s assumption. In order to do that, the designed network is presented as a system of Diophantine constraints in a special form. A method to resolve those systems is proposed, which is characterized by lower computational complexity, especially in the case of rare topologies design.