{"title":"并行分层记忆组织的架构、结构和功能特点","authors":"Leonid Timchenko, Natalia Kokriatska, Volodymyr Tverdomed, Iryna Yepifanova, Yurii Didenko, Dmytro Zhuk, Maksym Kozyr, Iryna Shakhina","doi":"10.35784/iapgos.5615","DOIUrl":null,"url":null,"abstract":"Parallel hierarchical memory (PI memory) is a new type of memory that is designed to improve the performance of parallel computing systems. PI memory is composed of two blocks: a mask RAM and a tail element RAM. The mask RAM stores the masks that are used to encode the information, while the tail element RAM stores the actual information. The address block of the PI memory is responsible for generating the physical addresses of the cells where the tail elements and their masks are stored. The address block also stores the field of addresses where the array was written and associates this field of addresses with the corresponding external address used to write the array. The proposed address block structure is able to efficiently generate the physical addresses of the cells where the tail elements and their masks are stored. The address block is also able to store the field of addresses where the array was written and associate this field of addresses with the corresponding external address used to write the array. The proposed address block structure has been implemented in a prototype PI memory. The prototype PI memory has been shown to be able to achieve significant performance improvements over traditional memory architectures. The paper will present a detailed description of the PI transformation algorithm, a description of the different modes of addressing organization that can be used in PI memory, an analysis of the efficiency of parallel-hierarchical memory structures, and a discussion of the challenges and future research directions in the field of PI memory.","PeriodicalId":504633,"journal":{"name":"Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska","volume":"10 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"ARCHITEKTONICZNE, STRUKTURALNE I FUNKCJONALNE CECHY RÓWNOLEGŁO-HIERARCHICZNEJ ORGANIZACJI PAMIĘCI\",\"authors\":\"Leonid Timchenko, Natalia Kokriatska, Volodymyr Tverdomed, Iryna Yepifanova, Yurii Didenko, Dmytro Zhuk, Maksym Kozyr, Iryna Shakhina\",\"doi\":\"10.35784/iapgos.5615\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Parallel hierarchical memory (PI memory) is a new type of memory that is designed to improve the performance of parallel computing systems. PI memory is composed of two blocks: a mask RAM and a tail element RAM. The mask RAM stores the masks that are used to encode the information, while the tail element RAM stores the actual information. The address block of the PI memory is responsible for generating the physical addresses of the cells where the tail elements and their masks are stored. The address block also stores the field of addresses where the array was written and associates this field of addresses with the corresponding external address used to write the array. The proposed address block structure is able to efficiently generate the physical addresses of the cells where the tail elements and their masks are stored. The address block is also able to store the field of addresses where the array was written and associate this field of addresses with the corresponding external address used to write the array. The proposed address block structure has been implemented in a prototype PI memory. The prototype PI memory has been shown to be able to achieve significant performance improvements over traditional memory architectures. The paper will present a detailed description of the PI transformation algorithm, a description of the different modes of addressing organization that can be used in PI memory, an analysis of the efficiency of parallel-hierarchical memory structures, and a discussion of the challenges and future research directions in the field of PI memory.\",\"PeriodicalId\":504633,\"journal\":{\"name\":\"Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska\",\"volume\":\"10 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-03-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.35784/iapgos.5615\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.35784/iapgos.5615","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
并行分层内存(PI 内存)是一种新型内存,旨在提高并行计算系统的性能。PI 内存由两个区块组成:掩码 RAM 和尾部元素 RAM。掩码 RAM 存储用于编码信息的掩码,而尾部元素 RAM 存储实际信息。PI 存储器的地址块负责生成存储尾部元素及其掩码的单元的物理地址。地址块还存储写入阵列的地址字段,并将该地址字段与用于写入阵列的相应外部地址相关联。建议的地址块结构能够有效地生成存储尾元素及其掩码的单元的物理地址。地址块还能存储写入数组的地址字段,并将该地址字段与用于写入数组的相应外部地址相关联。拟议的地址块结构已在 PI 存储器原型中实现。事实证明,原型 PI 存储器的性能比传统存储器架构有显著提高。本文将详细介绍 PI 变换算法,描述 PI 存储器中可使用的不同寻址组织模式,分析并行分层存储器结构的效率,并讨论 PI 存储器领域的挑战和未来研究方向。
ARCHITEKTONICZNE, STRUKTURALNE I FUNKCJONALNE CECHY RÓWNOLEGŁO-HIERARCHICZNEJ ORGANIZACJI PAMIĘCI
Parallel hierarchical memory (PI memory) is a new type of memory that is designed to improve the performance of parallel computing systems. PI memory is composed of two blocks: a mask RAM and a tail element RAM. The mask RAM stores the masks that are used to encode the information, while the tail element RAM stores the actual information. The address block of the PI memory is responsible for generating the physical addresses of the cells where the tail elements and their masks are stored. The address block also stores the field of addresses where the array was written and associates this field of addresses with the corresponding external address used to write the array. The proposed address block structure is able to efficiently generate the physical addresses of the cells where the tail elements and their masks are stored. The address block is also able to store the field of addresses where the array was written and associate this field of addresses with the corresponding external address used to write the array. The proposed address block structure has been implemented in a prototype PI memory. The prototype PI memory has been shown to be able to achieve significant performance improvements over traditional memory architectures. The paper will present a detailed description of the PI transformation algorithm, a description of the different modes of addressing organization that can be used in PI memory, an analysis of the efficiency of parallel-hierarchical memory structures, and a discussion of the challenges and future research directions in the field of PI memory.