Pub Date : 2020-11-25DOI: 10.1109/EnT50437.2020.9431311
Aleksei Shahsin, A. Belogaev, A. Krasilov, E. Khorov
Ultra-Reliable Low-Latency Communications (URLLC) is a novel feature of 5G cellular systems. To satisfy strict URLLC requirements for uplink data transmission, the specifications of 5G systems introduce the grant-free channel access method. According to this method, a User Equipment (UE) performs packet transmission without requesting channel resources from a base station (gNB). With the grant-free channel access, the gNB configures the uplink transmission parameters in a long-term time scale. Since the channel quality can significantly change in time and frequency domains, the gNB should select robust transmission parameters to satisfy the URLLC requirements. Many existing studies consider fixed robust uplink transmission parameter selection that allows satisfying the requirements even for UEs with poor channel conditions. However, the more robust transmission parameters are selected, the lower is the network capacity. In this paper, we propose an adaptive algorithm that selects the transmission parameters depending on the channel quality based on the signal-to-noise ratio statistics analysis at the gNB. Simulation results obtained with NS-3 show that the algorithm allows meeting the URLLC latency and reliability requirements while reducing the channel resource consumption more than twice in comparison with the fixed transmission parameters selection.
{"title":"Adaptive Transmission Parameters Selection Algorithm for URLLC Traffic in Uplink","authors":"Aleksei Shahsin, A. Belogaev, A. Krasilov, E. Khorov","doi":"10.1109/EnT50437.2020.9431311","DOIUrl":"https://doi.org/10.1109/EnT50437.2020.9431311","url":null,"abstract":"Ultra-Reliable Low-Latency Communications (URLLC) is a novel feature of 5G cellular systems. To satisfy strict URLLC requirements for uplink data transmission, the specifications of 5G systems introduce the grant-free channel access method. According to this method, a User Equipment (UE) performs packet transmission without requesting channel resources from a base station (gNB). With the grant-free channel access, the gNB configures the uplink transmission parameters in a long-term time scale. Since the channel quality can significantly change in time and frequency domains, the gNB should select robust transmission parameters to satisfy the URLLC requirements. Many existing studies consider fixed robust uplink transmission parameter selection that allows satisfying the requirements even for UEs with poor channel conditions. However, the more robust transmission parameters are selected, the lower is the network capacity. In this paper, we propose an adaptive algorithm that selects the transmission parameters depending on the channel quality based on the signal-to-noise ratio statistics analysis at the gNB. Simulation results obtained with NS-3 show that the algorithm allows meeting the URLLC latency and reliability requirements while reducing the channel resource consumption more than twice in comparison with the fixed transmission parameters selection.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131446688","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-11-25DOI: 10.1109/EnT50437.2020.9431307
V. Tran, Van-Kien Vu, Tang-Cuong Nguyen, Trung-Hieu Dang
Partial Transmit Sequence (PTS) technique is one of effective techniques for peak-to-average power ratio (PAPR) reduction in orthogonal frequency division multiplexing (OFDM) systems. In the conventional PTS (C-PTS) approaches, a large number of big size inverse fast Fourier transform (IFFT) blocks are required, which results in a high complexity and difficulties in the hardware implementation. In this paper, an optimization scheme of PTS technique without transmitting the side information and the phase factor recovery algorithms are introduced. In the proposed PTS scheme, only a single IFFT block is used and a binary phase sequence is applied. Theoretical analysis and simulation results on Matlab environment show that, compared with C-PTS, the proposed PTS scheme can obtain a similar PAPR reduction performance with lower complexity. Experimental results in DVB-T2 context indicate that the PAPR can be reduced about 5 dB in the carrier mode 1K and combining 32 subblocks.
{"title":"Optimization of Partial Transmit Sequences Scheme for PAPR Reduction of OFDM Signals","authors":"V. Tran, Van-Kien Vu, Tang-Cuong Nguyen, Trung-Hieu Dang","doi":"10.1109/EnT50437.2020.9431307","DOIUrl":"https://doi.org/10.1109/EnT50437.2020.9431307","url":null,"abstract":"Partial Transmit Sequence (PTS) technique is one of effective techniques for peak-to-average power ratio (PAPR) reduction in orthogonal frequency division multiplexing (OFDM) systems. In the conventional PTS (C-PTS) approaches, a large number of big size inverse fast Fourier transform (IFFT) blocks are required, which results in a high complexity and difficulties in the hardware implementation. In this paper, an optimization scheme of PTS technique without transmitting the side information and the phase factor recovery algorithms are introduced. In the proposed PTS scheme, only a single IFFT block is used and a binary phase sequence is applied. Theoretical analysis and simulation results on Matlab environment show that, compared with C-PTS, the proposed PTS scheme can obtain a similar PAPR reduction performance with lower complexity. Experimental results in DVB-T2 context indicate that the PAPR can be reduced about 5 dB in the carrier mode 1K and combining 32 subblocks.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124477003","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-11-25DOI: 10.1109/EnT50437.2020.9431314
N. Berenkov, A. Kolessa, A. Tartakovsky
We consider a problem of reliable detection of dynamic anomalies in observed data. The problem is of importance for many applications, e.g., for signal and image processing where dynamic anomalies (corresponding to changes in distributions of observed processes) take place when signals appear and disappear at unknown points in time or space. We assume that the duration of the change may be finite and unknown and focus on Bayesian and maximin optimality criteria of maximizing the probability of detection in a prespecified time interval under constraints imposed on the rate of false positives. Using optimal stopping theory we find optimal Bayesian and maximin detection procedures. We then compare operating characteristics of the optimal procedures with the popular Finite Moving Average (FMA) rule, using Monte Carlo simulations, which show that typically the FMA procedure has almost the same performance as the optimal ones. The FMA rule is applied to the extraction of faint streaks of satellites from digital frames captured with telescopes.
{"title":"Reliable Detection of Dynamic Anomalies with Application to Extracting Faint Space Object Streaks from Digital Frames","authors":"N. Berenkov, A. Kolessa, A. Tartakovsky","doi":"10.1109/EnT50437.2020.9431314","DOIUrl":"https://doi.org/10.1109/EnT50437.2020.9431314","url":null,"abstract":"We consider a problem of reliable detection of dynamic anomalies in observed data. The problem is of importance for many applications, e.g., for signal and image processing where dynamic anomalies (corresponding to changes in distributions of observed processes) take place when signals appear and disappear at unknown points in time or space. We assume that the duration of the change may be finite and unknown and focus on Bayesian and maximin optimality criteria of maximizing the probability of detection in a prespecified time interval under constraints imposed on the rate of false positives. Using optimal stopping theory we find optimal Bayesian and maximin detection procedures. We then compare operating characteristics of the optimal procedures with the popular Finite Moving Average (FMA) rule, using Monte Carlo simulations, which show that typically the FMA procedure has almost the same performance as the optimal ones. The FMA rule is applied to the extraction of faint streaks of satellites from digital frames captured with telescopes.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124740508","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-11-25DOI: 10.1109/ent50437.2020.9431270
R. Kolesnikov, M. Uhm, Y. Korchemkin, S. Yun
A multilayer printed radiator for a phased antenna array of a user terminal for Ka-band satellite communications is considered. The design of the radiator is described and the results of calculations of the radiator model are presented. The radiator operates on circular polarization in the frequency range of 29–30 GHz and has a scanning area in the form of a cone with a solid angle of ±65 degrees. To reduce the level of cross-polarization, groups of four radiators with sequential rotation of 90 degrees are used. The results of calculations for such a group of radiators in the Floquet channel condition are presented.
{"title":"Circularly Polarized Multilayer Printed Radiator for Wide-Angle Scanning Ka-band Phased Array","authors":"R. Kolesnikov, M. Uhm, Y. Korchemkin, S. Yun","doi":"10.1109/ent50437.2020.9431270","DOIUrl":"https://doi.org/10.1109/ent50437.2020.9431270","url":null,"abstract":"A multilayer printed radiator for a phased antenna array of a user terminal for Ka-band satellite communications is considered. The design of the radiator is described and the results of calculations of the radiator model are presented. The radiator operates on circular polarization in the frequency range of 29–30 GHz and has a scanning area in the form of a cone with a solid angle of ±65 degrees. To reduce the level of cross-polarization, groups of four radiators with sequential rotation of 90 degrees are used. The results of calculations for such a group of radiators in the Floquet channel condition are presented.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"93 22","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114046402","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-11-25DOI: 10.1109/EnT50437.2020.9431250
S. Ojha, Himanshu Rai, Alexey Nazarov
Cloud Computing is an emerging paradigm of computing which facilitates computing as a service. It enables to use the computing facilities “on-demand”, for example, Software as a Service (SaaS), Platform as a Service (PaaS), Infrastructure as a Service (IaaS) etc. This model is best suitable for modern application deployment in which the software /service is required to be deployed in a fast, efficient and cost effective manner. The underlying technology behind cloud computing is virtualization, which enables sharing of the computing resources across multiple users across the globe, connected with each other through internet. Service offering is provided by Cloud Service Provider Companies, some of which are big market players like Amazon (Amazon Web Services; AWS), Google (Google App Engine; GAE) and Microsoft (Microsoft Azure). Load Balancing in Cloud Environment is a central issue of research. This is critical as it leads to efficient utilization of cloud resources, thereby resulting into low cost per user through optimal utilization of resources. The contribution of this paper is two-fold. It extends the approach of using Osmotic Bio inspired algorithm at all the three level of task scheduling, viz, Physical Machine, Virtual Machine and at Task Level. Also, this paper enhances the Osmotic Algorithm with Firefly algorithm which has already been proved significant in load balancing in distributed environments. Also, in this paper, benchmark techniques of load balancing are discussed at depth, both for their effectiveness and limitations. Moreover, techniques are presented for load balancing among virtual machines using Opportunistic Load Balancing (OLB) and LBMM (Load Balance Min-min) scheduling approaches. The Simulation is performed over CloudSim and the results derived are compared to those of the analytical model to prove the validity of the approach.
{"title":"Optimal Load Balancing In Three Level Cloud Computing Using Osmotic Hybrid And Firefly Algorithm","authors":"S. Ojha, Himanshu Rai, Alexey Nazarov","doi":"10.1109/EnT50437.2020.9431250","DOIUrl":"https://doi.org/10.1109/EnT50437.2020.9431250","url":null,"abstract":"Cloud Computing is an emerging paradigm of computing which facilitates computing as a service. It enables to use the computing facilities “on-demand”, for example, Software as a Service (SaaS), Platform as a Service (PaaS), Infrastructure as a Service (IaaS) etc. This model is best suitable for modern application deployment in which the software /service is required to be deployed in a fast, efficient and cost effective manner. The underlying technology behind cloud computing is virtualization, which enables sharing of the computing resources across multiple users across the globe, connected with each other through internet. Service offering is provided by Cloud Service Provider Companies, some of which are big market players like Amazon (Amazon Web Services; AWS), Google (Google App Engine; GAE) and Microsoft (Microsoft Azure). Load Balancing in Cloud Environment is a central issue of research. This is critical as it leads to efficient utilization of cloud resources, thereby resulting into low cost per user through optimal utilization of resources. The contribution of this paper is two-fold. It extends the approach of using Osmotic Bio inspired algorithm at all the three level of task scheduling, viz, Physical Machine, Virtual Machine and at Task Level. Also, this paper enhances the Osmotic Algorithm with Firefly algorithm which has already been proved significant in load balancing in distributed environments. Also, in this paper, benchmark techniques of load balancing are discussed at depth, both for their effectiveness and limitations. Moreover, techniques are presented for load balancing among virtual machines using Opportunistic Load Balancing (OLB) and LBMM (Load Balance Min-min) scheduling approaches. The Simulation is performed over CloudSim and the results derived are compared to those of the analytical model to prove the validity of the approach.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117318550","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
With the rapid development of wireless local area network (WLAN), the available spectrum resources are gradually decreasing. Visible light communication has received more and more attention. The paper introduces indoor visible light communication (VLC) channel estimation on the experimental platform. We have developed a point-to-point visible light communication platform with red laser diodes in the laboratory, and improved the power utilization by adjusting the sub-carrier bit power allocation. At the communication distance of 0.7 meters and with the bit error rate of 3.2x10−3, the data transmission rate reaches 1.53Gbps. Clear constellation diagrams from 8QAM to 256QAM are received.
{"title":"High-Speed Indoor Visible Light Communication System using Red Laser Diodes","authors":"Shuzhou Chai, Hongming Zhang, Jian Song, Jinghui Zhu","doi":"10.1109/EnT50437.2020.9431278","DOIUrl":"https://doi.org/10.1109/EnT50437.2020.9431278","url":null,"abstract":"With the rapid development of wireless local area network (WLAN), the available spectrum resources are gradually decreasing. Visible light communication has received more and more attention. The paper introduces indoor visible light communication (VLC) channel estimation on the experimental platform. We have developed a point-to-point visible light communication platform with red laser diodes in the laboratory, and improved the power utilization by adjusting the sub-carrier bit power allocation. At the communication distance of 0.7 meters and with the bit error rate of 3.2x10−3, the data transmission rate reaches 1.53Gbps. Clear constellation diagrams from 8QAM to 256QAM are received.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121127438","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-11-25DOI: 10.1109/EnT50437.2020.9431308
E. Ovchinnikova, V. Skripachev, Nguen Dinh To, S. Kondrat'eva, P. Shmachilin, E. Gadzhiev
On-board antenna-feeder devices constitute an integral part of spacecrafts both according to the type used and according to the target-oriented task. There is a target-oriented data radio transmission line besides other on-board systems such as telemetry, navigation, intersatellite communications, etc., comprising receiving or transmitting antennas. In this paper presents the construction of on-booard data radio transmission line antenna system of information transmission for big-size spacecrafts “Meteor” series and small-size spacecrafts designed on space-based platform “Canopus-B”. VHF -band, UHF -band, S-band and X-band antennas are used as part of the target-oriented data transmission radio line. The drawbacks of the approach being used for the vehicle-borne radio line construction are shown. Thus, the research work shows the status of the vehicle-borne antenna-feeder devices of the space vehicle target-oriented data radio transmitting line through the example of spacecrafts “Meteor” series and space-based platform “Canopus-B”. The future trends in the further development of the radio line on-board antennas are as well revealed and presented.
{"title":"Application of Horn Antennas for Perspective Vehicle-Board Systems and Complexes","authors":"E. Ovchinnikova, V. Skripachev, Nguen Dinh To, S. Kondrat'eva, P. Shmachilin, E. Gadzhiev","doi":"10.1109/EnT50437.2020.9431308","DOIUrl":"https://doi.org/10.1109/EnT50437.2020.9431308","url":null,"abstract":"On-board antenna-feeder devices constitute an integral part of spacecrafts both according to the type used and according to the target-oriented task. There is a target-oriented data radio transmission line besides other on-board systems such as telemetry, navigation, intersatellite communications, etc., comprising receiving or transmitting antennas. In this paper presents the construction of on-booard data radio transmission line antenna system of information transmission for big-size spacecrafts “Meteor” series and small-size spacecrafts designed on space-based platform “Canopus-B”. VHF -band, UHF -band, S-band and X-band antennas are used as part of the target-oriented data transmission radio line. The drawbacks of the approach being used for the vehicle-borne radio line construction are shown. Thus, the research work shows the status of the vehicle-borne antenna-feeder devices of the space vehicle target-oriented data radio transmitting line through the example of spacecrafts “Meteor” series and space-based platform “Canopus-B”. The future trends in the further development of the radio line on-board antennas are as well revealed and presented.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126889347","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-11-25DOI: 10.1109/EnT50437.2020.9431267
Ivan Kolchinsky, M. Khachumov, V. Khachumov
The urgent tasks of building mobile flying communication networks based on unmanned aerial vehicles (UAV) are considered and systematized. An essential part of the study is the task of “securing” reliable communications between terrestrial users. Coverage is built, taking into account the terrain map with the inclusion of impassable and hazardous areas. The urgent tasks are providing mobile networks, depending on the number of available aerial vehicles (AV). The task of the optimal trajectory movement of AV should be solved on terrain maps using accurate and heuristic algorithms. Under conditions of random wind loads, problems arise in maintaining the stability of the network configuration. The solution involves tracking safe distances, stabilizing, and correcting AV locations. Modelling is a necessary stage of research. Simulation modelling can be performed, taking into account mathematical models and using queuing theory. The practical significance of the work lies in the possibility of building intelligent technology and software to increase the autonomy of UAVs as part of groupings to ensure reliable communication in hard-to-reach areas under external threats and instability of the surrounding air environment.
{"title":"Tasks of Building and Supporting the Functioning of the Communication Networks Based on Unmanned Aerial Vehicles","authors":"Ivan Kolchinsky, M. Khachumov, V. Khachumov","doi":"10.1109/EnT50437.2020.9431267","DOIUrl":"https://doi.org/10.1109/EnT50437.2020.9431267","url":null,"abstract":"The urgent tasks of building mobile flying communication networks based on unmanned aerial vehicles (UAV) are considered and systematized. An essential part of the study is the task of “securing” reliable communications between terrestrial users. Coverage is built, taking into account the terrain map with the inclusion of impassable and hazardous areas. The urgent tasks are providing mobile networks, depending on the number of available aerial vehicles (AV). The task of the optimal trajectory movement of AV should be solved on terrain maps using accurate and heuristic algorithms. Under conditions of random wind loads, problems arise in maintaining the stability of the network configuration. The solution involves tracking safe distances, stabilizing, and correcting AV locations. Modelling is a necessary stage of research. Simulation modelling can be performed, taking into account mathematical models and using queuing theory. The practical significance of the work lies in the possibility of building intelligent technology and software to increase the autonomy of UAVs as part of groupings to ensure reliable communication in hard-to-reach areas under external threats and instability of the surrounding air environment.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130696090","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-11-25DOI: 10.1109/EnT50437.2020.9431291
Aleksey S. Kozhin, A. V. Surchenko
Higher capacity of cache memory increases Hit Rate at the cost of power consumption and die area. Hardware data compression in cache allows increasing its effective capacity without significant negative effects on these characteristics. This work discusses the realization of data compression in L3 cache memory of modern processors with “Elbrus” architecture. One of the most efficient and at the same time fast compression algorithms is BDI (Base-Delta-Immediate) algorithm. Its modification, called BDI*-HL (Base-Delta-Immediate Modified, Half-Line), is selected for implementation. To achieve an increase in effective capacity, the principles of joint placement of compressed cache lines are introduced and implemented. L3 cache memory is modified to correctly work with compressed lines. A testing bench is developed to evaluate the effectiveness of the designed mechanism. The developed solution does not require any significant changes in the structure of cache memory, does not affect the principles of eviction policy and the coherency protocol and does not change values of working frequency and cache die area.
{"title":"Design of Data Compression Mechanism in Cache Memory of Elbrus Processors","authors":"Aleksey S. Kozhin, A. V. Surchenko","doi":"10.1109/EnT50437.2020.9431291","DOIUrl":"https://doi.org/10.1109/EnT50437.2020.9431291","url":null,"abstract":"Higher capacity of cache memory increases Hit Rate at the cost of power consumption and die area. Hardware data compression in cache allows increasing its effective capacity without significant negative effects on these characteristics. This work discusses the realization of data compression in L3 cache memory of modern processors with “Elbrus” architecture. One of the most efficient and at the same time fast compression algorithms is BDI (Base-Delta-Immediate) algorithm. Its modification, called BDI*-HL (Base-Delta-Immediate Modified, Half-Line), is selected for implementation. To achieve an increase in effective capacity, the principles of joint placement of compressed cache lines are introduced and implemented. L3 cache memory is modified to correctly work with compressed lines. A testing bench is developed to evaluate the effectiveness of the designed mechanism. The developed solution does not require any significant changes in the structure of cache memory, does not affect the principles of eviction policy and the coherency protocol and does not change values of working frequency and cache die area.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128992524","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-11-25DOI: 10.1109/EnT50437.2020.9431292
M. Chernoskutov
Big graphs processing is a complex task that requires computational power as well as special purpose software. This happens due to the irregular structure of the graphs because it is not known in advance the way how the graph will be stored in memory. Also, since the size of graphs simulating real-world objects can achieve millions of nodes and edges (and even more), its efficient processing can be complicated by long search operations for navigating in the graph. Another obstacle to efficient development of graph algorithms is the non-deterministic structure of many such algorithms. With all of the above, this paper is devoted to a high-level description of a system that allows to develop graph algorithms efficiently and increase productivity of software developer. This system can also be used to build efficient data structures for storing graphs, since it allows to separate the development of algorithms for processing graphs from the issues of their storage on a computing system. The developed system is intended for use in research areas related to the processing of large graphs with complex algorithms, for example, in network science.
{"title":"Graph Processing System for Network Science","authors":"M. Chernoskutov","doi":"10.1109/EnT50437.2020.9431292","DOIUrl":"https://doi.org/10.1109/EnT50437.2020.9431292","url":null,"abstract":"Big graphs processing is a complex task that requires computational power as well as special purpose software. This happens due to the irregular structure of the graphs because it is not known in advance the way how the graph will be stored in memory. Also, since the size of graphs simulating real-world objects can achieve millions of nodes and edges (and even more), its efficient processing can be complicated by long search operations for navigating in the graph. Another obstacle to efficient development of graph algorithms is the non-deterministic structure of many such algorithms. With all of the above, this paper is devoted to a high-level description of a system that allows to develop graph algorithms efficiently and increase productivity of software developer. This system can also be used to build efficient data structures for storing graphs, since it allows to separate the development of algorithms for processing graphs from the issues of their storage on a computing system. The developed system is intended for use in research areas related to the processing of large graphs with complex algorithms, for example, in network science.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132863162","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：