Рус Eng During last 365 days Approved articles: 2108,   Articles in work: 272 Declined articles: 911 
Library
Articles and journals | Tariffs | Payments | Your profile

Back to contents

The algorithm development for the accelerated information suppression in large data storages.
Sibiryakov Maksim Andreevich

PhD in Technical Science

The head of the computer support group of GTRK Mari El

424033, Russia, respublika Marii El, g. Ioshkar-Ola, ul. Eshkinina, 2

maxover777@bk.ru
Другие публикации этого автора
 

 
Abstract. This article concerns the issue of improving performance when processing large amounts of information in data warehouses (storages). The main purpose is to increase the speed of the process of wiping out information in the cache of data warehouses, and, consequently to improve the processing speed of the cached data. The subject of research involves the algorithms of data extortion LRU1 and LRU2, as well as and structural organization of the control table. The article proposes the implementation of algorithms for wiping out information in the data warehouse cache on the basis of an associative data array. The results of a comparative analysis of the basic algorithms of information displacement used in the operational memory of computer systems (LRU, LFU, FIFO, Random) are presented in this article. The results of the development of algorithms for accelerated information extrusion in the cache of data warehouses are also presented. The author construes the systems of canonical equations for these algorithms are. The  mathematical model, which is used by the author,  is an executable formalized specification allowing for a direct transition from the DCS (the system of canonical equations) to the further hardware or software implementation of the proposed algorithms.
Keywords: systems of canonical equations, storages, caching, data wiping algorithms, LRU algorithm, MRU algorithm, ARC algorithm, data processing, automatic models, data storage
DOI: 10.25136/2306-4196.2017.4.23799
Article was received: 11-08-2017

Review date: 09-08-2017

Publish date: 17-09-2017

This article written in Russian. You can find full text of article in Russian here.

References
1.
Huawei OceanStor 6800-V3 SPC-1 executive summary [Electronic resource]. – URL: http://www.storageperformance.org/benchmark_results files/SPC-1/Huawei/A00149_Huawei_OceanStor-6800-V3/a00149_Huawei OceanStor_6800-V3_SPC-1_executive-summary.pdf (data obrashcheniya 19.04.2017).
2.
White paper: Storage is Still Not a Commodity: an Updated Comparison of High End Storage Subsystems of 9 August 2009 by Josh Krischer // Bensheim: Josh Krischer & Associates GmbH.-24p.
3.
Paltashev, T.T. Ierarkhiya pamyati v sovremennykh mikroprotsessorakh / T.T. Paltashev, M.V. Matveev.-Sankt-Peterburg: NIU ITMO, 2012.-133 s.
4.
Meddigo, N. Outperforming LRU with an AdaptiveReplacement Cache Algorithm [Electronic resource] / N. MEddigo, S. Modha // Research feature.IEEE Computer Society. – 2004. – URL: http://www.cs.cmu.edu/~15-440/READINGS/megiddo-computer2004.pdf (data obrashcheniya 19.02.2017).
5.
Chenessy John, L. Computer Architecrure Quantitive Approach, fourth edition / L. Chennesy John, A. Patterson David. – Berkeley: Morgan Kaufmann Publishers, 2007. – 676 p.
6.
Intel® 64 and IA-32 Architectures Software Developer’s Manual [Electronic resource]. – URL: http://www.intel.com/content/dam/www/public/us/en/documents/manuals/64-ia-32-architectures-software-developer-instruction-set-reference-manual-325383.pdf (data obrashcheniya 01.02.2017).
7.
Qureshi, M.K. Utility-Based Cache Partitioning: A Low-Overhead, High-Performance, Runtime Mechanism to Partition SharedCaches / M.K. Qureshi, Y.N. Patt // Proc. of the 39th Annual IEEE/ ACM Intern. Symp. on Microarchitecture (MICRO 39). Washington, DC, USA:IEEE Comp. Soci., 2006. – R. 423-432.
8.
CacheCOW: QoS for storage system caches / P. Goyal, D. Jadav, D.S. Modha, R. Tewari // Proc. of the 11th Intern. Conf. on Quality of Service (IWQoS'03). – Berlin: Springer-Verlag, 2003. – R. 498-515.
9.
Sibiryakov, M.A. Modifikatsiya i modelirovanie algoritmov obrabotki dannykh v kesh-pamyati sistem khraneniya dannykh / M.A. Sibiryakov, E.S. Vasyaeva // Kibernetika i programmirovanie: elektronnyi zhurnal. – M: NOTA BENE, 2016. – № 4. – S. 44-57.
10.
Vashkevich N.P. Vyrazitel'nye vozmozhnosti i effektivnost' formal'nogo yazyka, postroennogo na osnove ispol'zovaniya modelei nedeterminirovannykh avtomatov // Izvestiya vysshikh uchebnykh zavedenii. Povolzhskii region. Tekhnicheskie nauki.-2006.-№ 6.-S. 67-77.
11.
Vashkevich N.P., Zubkov V.A. Algoritm sinteza tsifrovykh avtomatov Mura s ispol'zovaniem yazyka ischisleniya predikatov // Vychislitel'naya tekhnika: Uchebnye zapiski. – Vyp. 3. Penza: Penz. politekhn. in-t, 1969 – S. 25–36.
12.
Vashkevich, N.P. Formal'nye avtomatnye modeli algoritmov obrabotki keshiruemoi informatsii / N. P. Vashkevich, M.A. Sibiryakov // Sovremennye naukoemkie tekhnologii. – M.: Akademiya Estestvoznaniya, 2016. – № 8. – Ch. 2. – S. 205-213.