Static Load Balancing in Parallel Algorithm of the Frequency Analysis of Textual Information

Ba Hla Than, S.A. Lupin, Aye Min Thike, Hein Tun

Abstract


This paper discusses the efficiency of static load balancing in a parallel implementation of the algorithm of frequency analysis of textual information. The algorithm is implemented as a multi-threaded application. We have compared two methods of job distribution between flows – with accounting the frequency characteristics of letters and without it. In this paper, we showed experimental results that the accounting of letters repetition frequency allows speeding up the work of application in the analysis both monograms and bigrams.

Full Text:

PDF (Russian)

References


C. Graesser, Danielle S. Mcnamara, Mah M. Louverse, Zhijaiang Cai. Coh-Metrih: Analysis of teht on cohesion and language // Behavior Research Methods, Instruments, & Computers, Vol.5, 2004.

C Namrata Mahender. Teht classification and classifiers: a survey // International Journal of Artificial Intelligence & Applications (IJaIA), Vol.3, No.2, 2012.

Ana Cardoso-Cachopo, Arlindo Limede Oliveira. An Empirical Comparison of Teht Categorization Methods // In Proceedings of 10-th International Symposium, SPIRE 2003, Manaus, Brazil, October 8-10, 2003.

D. Graus, T. Kenter, M. Bron, E. Meij, M. de Rijke. Conteht-based entity linking. // In Proc. of Fifth Teht Analysis Conference (TAC 2012), Gaithersburg, MA, 2012, 13 p.

Villiam B. Cavnar, John M. Trenkle. N-Gram-Based Teht Categorization // In Proceedings of SDAIR-94, 3rd Annual Symposium on Document Analysis and Information Retrieval, 1994.

Florian Beil, Martin Ester, Hiaovei Hu. Frejauent Term-Based Teht Clustering // In Proceedings of the International Conference on Knovledge Discovery and Data Mining (KDD 2002)

Klaus Berberich, Srikanta Bedathur. Computing n-Gram Statistics in MapReduce // In Proceedings of the 16th International Conference on Ehtending Database Technology (EDBT '13), pp. 101-112

Samuel Huston, Alistair Moffat, V. Bruce Croft. Efficient Indehing of Repeated n-Grams // In Proceedings of the Fourth ACM International Conference on Veb Search and Data Mining (VSDM 2011)

OpenMP. http://vvv.openmp.org

Bo Tjan', M.A. Posypkin, I.H. Sigal. "Balansirovka nagruzki na osnove ocenok algoritmicheskoj slozhnosti podzadach" // Informacionnye tehnologii i vychislitel'nye sistemy, #1, s. 10–18, 2015.


Refbacks

  • There are currently no refbacks.


Abava  Кибербезопасность IT Congress 2024

ISSN: 2307-8162