Pregled bibliografske jedinice broj: 216243
Algorithm for Equal Distribution of Identical Elements on One Dimensional Field
Algorithm for Equal Distribution of Identical Elements on One Dimensional Field // Conference Proceedings of 16th International Conference on Information and Intelligent Systems / Aurer, Boris ; Bača, Miroslav (ur.).
Varaždin: Fakultet organizacije i informatike Sveučilišta u Zagrebu, 2005. str. 447-454 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 216243 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Algorithm for Equal Distribution of Identical Elements on One Dimensional Field
Autori
Boban, Mate ; Lovrenčić, Alen ; Kreutzer, Michael
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
Conference Proceedings of 16th International Conference on Information and Intelligent Systems
/ Aurer, Boris ; Bača, Miroslav - Varaždin : Fakultet organizacije i informatike Sveučilišta u Zagrebu, 2005, 447-454
Skup
16th International Conference on Information and INtelligent Systems
Mjesto i datum
Varaždin, Hrvatska, 21.09.2005. - 23.09.2005
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
one-dimensional field; algortihmic solution
Sažetak
This paper describes an algorithm for an equal distribution for m identical elements on one-dimensional field of size n with m<n. During the development of the discrete event simulation of MANET (Mobile Ad-Hoc Network), the need for equal distribution of special node roles (e.g. servers, clients or directories) on the nodes had occured. The solution using some of existing random number generators was out of the question because we wanted to know to hich node had the role been assigned to so we needed an algorithmic solution in order to predict on which node which types of roles will be placed, if any. In the proposed algorithm, two specific cases are regarded: trivial case with distribution (n mod m)=0, where every (n div m) element of n is selected, and (n mod m) <> 0, when we implement our algorithm. We show that using the proposed algorithm the m elements are equally distributed over size n one-dimensional field. The algorithm is given in pseudo-code and thorougly commented.
Izvorni jezik
Engleski
Znanstvena područja
Informacijske i komunikacijske znanosti
POVEZANOST RADA
Ustanove:
Fakultet organizacije i informatike, Varaždin