Open AccessMODELING AND OPTIMIZATION OF PARALLEL INFORMATION SEARCHING IN FILES
Author(s) -
Volodymyr Lisovets,
Hryhoriy Tsehelyk
Publication year - 2014
Publication title -
computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.184
H-Index - 11
eISSN - 2312-5381
pISSN - 1727-6209
DOI - 10.47839/ijc.8.2.663
Subject(s) - computer science , multiprocessing , field (mathematics) , block (permutation group theory) , probability distribution , algorithm , theoretical computer science , parallel computing , mathematics , statistics , geometry , pure mathematics
In this article the m-parallel method of sequential field searching and two variants of m-parallel block field searching method are offered. These methods are oriented to be used in multiprocessing system for information searching in files of database. We research the effectiveness of these methods for different probability distribution law of field access. The mathematical expectation of number of parallel comparisons necessary for field searching in files is taken as a criterion of effectiveness. The effectiveness of the methods is compared and analyzed. The best of offered methods is founded for every considered probability distribution. Optimal strategies of field searching in sequenced files stored in external memory of multiprocessing system are made. In this case the mathematical expectation of total time needed for field searching in files is taken as a criterion of effectiveness.