IN-MEMORY INTELLIGENT COMPUTING

被引:0
|
作者
Hahanov, V., I [1 ]
Abdullayev, V. H. [2 ]
Chumachenko, S., V [1 ]
Lytvynova, E., I [1 ]
Hahanova, I., V [1 ]
机构
[1] Kharkiv Natl Univ Radio Elect, Design Automat Dept, Kharkiv, Ukraine
[2] Azerbaijan State Oil & Ind Univ, Comp Engn Dept, Baku, Azerbaijan
关键词
Intelligent Computing; Cloud; fog; and edge computing; Big data computing; In-memory computing; Cyber social competing; Hadoop Map-Reduce technique; big data as addresses; truth table; logical vector; similarities-differences; equivalence data; universe of primitives; patterns as a binary vector;
D O I
10.15588/1607-3274-2024-1-15
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Context. Processed big data has social significance for the development of society and industry. Intelligent processing of big data is a condition for creating a collective mind of a social group, company, state and the planet as a whole. At the same time, the economy of big data (Data Economy) takes first place in the evaluation of processing mechanisms, since two parameters are very important: speed of data processing and energy consumption. Therefore, mechanisms focused on parallel processing of large data within the data storage center will always be in demand on the IT market. Objective. The goal of the investigation is to increase the economy of big data (Data Economy) thanks to the analysis of data as truth table addresses for the identification of patterns of production functionalities based on the similarity -difference metric. Method. Intelligent computing architectures are proposed for managing cyber-social processes based on monitoring and analysis of big data. It is proposed to process big data as truth table addresses to solve the problems of identification, clustering, and classification of patterns of social and production processes. A family of automata is offered for the analysis of big data, such as addresses. The truth table is considered as a reasonable form of explicit data structures that have a useful constant - a standard address routing order. The goal of processing big data is to make it structured using a truth table for further identification before making actuator decisions. The truth table is considered as a mechanism for parallel structuring and packing of large data in its column to determine their similarity -difference and to equate data at the same addresses. Representation of data as addresses is associated with unitary encoding of patterns by binary vectors on the found universe of primitive data. The mechanism is focused on processorless data processing based on read-write transactions using in -memory computing technology with significant time and energy savings. The metric of truth table big data processing is parallelism, technological simplicity, and linear computational complexity. The price for such advantages is the exponential memory costs of storing explicit structured data. Results. Parallel algorithms of in -memory computing are proposed for economic mechanisms of transformation of large unstructured data, such as addresses, into useful structured data. An in -memory computing architecture with global feedback and an algorithm for matrix parallel processing of large data such as addresses are proposed. It includes a framework for matrix analysis of big data to determine the similarity between vectors that are input to the matrix sequencer. Vector data analysis is transformed into matrix computing for big data processing. The speed of the parallel algorithm for the analysis of big data on the MDV matrix of deductive vectors is linearly dependent on the number of bits of the input vectors or the power of the universe of primitives. A method of identifying patterns using key words has been developed. It is characterized by the use of unitary coded data components for the synthesis of the truth table of the business process. This allows you to use read-write transactions for parallel processing of large data such as addresses. Conclusions. The scientific novelty consists in the development of the following innovative solutions: 1) a new vector -matrix technology for parallel processing of large data, such as addresses, is proposed, characterized by the use of read-write transactions on matrix memory without the use of processor logic; 2) an in -memory computing architecture with global feedback and an algorithm for matrix parallel processing of large data such as addresses are proposed; 3) a method of identifying patterns using keywords is proposed, which is characterized by the use of unitary coded data components for the synthesis of the truth table of the business process, which makes it possible to use the read-write transaction for parallel processing of large data such as addresses. The practical significance of the study is that any task of artificial intelligence (similarity -difference, classification -clustering and recognition, pattern identification) can be solved technologically simply and efficiently with the help of a truth table (or its derivatives) and unitarily coded big data . Research prospects are related to the implementation of this digital modeling technology devices on the EDA market.
引用
收藏
页码:161 / 174
页数:14
相关论文
共 50 条
  • [41] In-Memory Computing of Akers Logic Array
    Yaakobi, Eitan
    Jiang, Anxiao
    Bruck, Jehoshua
    [J]. 2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 2369 - +
  • [42] Device and Circuit Architectures for In-Memory Computing
    Ielmini, Daniele
    Pedretti, Giacomo
    [J]. ADVANCED INTELLIGENT SYSTEMS, 2020, 2 (07)
  • [43] "In-memory Computing": Accelerating AI Applications
    Eleftheriou, Evangelos
    [J]. 2018 48TH EUROPEAN SOLID-STATE DEVICE RESEARCH CONFERENCE (ESSDERC), 2018, : 4 - 5
  • [44] Mixed-precision in-memory computing
    Manuel Le Gallo
    Abu Sebastian
    Roland Mathis
    Matteo Manica
    Heiner Giefers
    Tomas Tuma
    Costas Bekas
    Alessandro Curioni
    Evangelos Eleftheriou
    [J]. Nature Electronics, 2018, 1 : 246 - 253
  • [45] Editorial for the Special Issue on In-Memory Computing
    Shen, Xipeng
    Lovas, Robert
    Liao, Xiaofei
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2018, 120 : 322 - 322
  • [46] Editorial: Focus issue on in-memory computing
    Lu, Wei D.
    Payvand, Melika
    Yang, Yuchao
    [J]. NEUROMORPHIC COMPUTING AND ENGINEERING, 2024, 4 (03):
  • [47] Acceleration of HadoopMapReduce using in-memory Computing
    Seelam, Siva Kumar
    Pattabiraman, V
    [J]. PROCEEDINGS OF THE 2018 INTERNATIONAL CONFERENCE ON RECENT TRENDS IN ADVANCED COMPUTING (ICRTAC-CPS 2018), 2018, : 91 - 96
  • [48] Logic Synthesis for Digital In-Memory Computing
    Rashed, Muhammad Rashedul Haq
    Jha, Sumit Kumar
    Ewetz, Rickard
    [J]. 2022 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN, ICCAD, 2022,
  • [49] In-memory computing with resistive switching devices
    Daniele Ielmini
    H.-S. Philip Wong
    [J]. Nature Electronics, 2018, 1 : 333 - 343
  • [50] Approximate in-Memory Computing on ReRAM Crossbars
    Ul Hassen, Amad
    Khokhar, Salman Anwar
    [J]. 2019 IEEE 62ND INTERNATIONAL MIDWEST SYMPOSIUM ON CIRCUITS AND SYSTEMS (MWSCAS), 2019, : 1183 - 1186