Azerbaijan Journal of High Performance Computing最新文献_第7页

ANTENNA ARRAY FAILURE CORRECTION USING IMPROVED PARTICLE SWARM OPTIMIZATION WITH WAVELET MUTATION 基于小波突变的改进粒子群优化天线阵列故障校正

Azerbaijan Journal of High Performance Computing Pub Date : 2019-06-30 DOI: 10.32010/26166127.2019.2.1.64.74

Pallavi Mitra, D. Mandal, R. Kar, P. Chakravorty

{"title":"ANTENNA ARRAY FAILURE CORRECTION USING IMPROVED PARTICLE SWARM OPTIMIZATION WITH WAVELET MUTATION","authors":"Pallavi Mitra, D. Mandal, R. Kar, P. Chakravorty","doi":"10.32010/26166127.2019.2.1.64.74","DOIUrl":"https://doi.org/10.32010/26166127.2019.2.1.64.74","url":null,"abstract":"The advent of complex engineering systems has made computation intensive design processes inevitable. Unfortunately, such processes require larger resources, i.e., larger memory, parallel processing, etc., and time than usual. As a result, the high performance issues like managing these processes to run within limited resource pools has become ever more challenging. This paper reports an application of intelligent computing in the specific area of antenna arrays and implicitly shows how a computationally intensive process can improve its performance within a limited available resource by judiciously combining different algorithms. Failures in radiating elements in an antenna array usually increase the undesired side lobe radiation, thereby distorting the original radiation pattern. Here, restoration of the original pattern has been attempted by restricting the side lobe levels (SLLs) to the desired threshold using a meta-heuristic optimization technique named Improved Particle Swarm Optimization with Wavelet Mutation (IPSOWM). Also, as a reference, the performance of this algorithm has been compared with Improved Particle Swarm Optimization (IPSO) technique. Results show that IPSOWM yields a better solution to the existing problem as compared to IPSO.","PeriodicalId":275688,"journal":{"name":"Azerbaijan Journal of High Performance Computing","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115871104","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}

引用次数: 1

SEDRES: SECURED DATA RETRIEVAL SERVICE Sedres:安全数据检索服务

Azerbaijan Journal of High Performance Computing Pub Date : 2019-06-30 DOI: 10.32010/26166127.2019.2.1.82.92

T. Bhattasali

{"title":"SEDRES: SECURED DATA RETRIEVAL SERVICE","authors":"T. Bhattasali","doi":"10.32010/26166127.2019.2.1.82.92","DOIUrl":"https://doi.org/10.32010/26166127.2019.2.1.82.92","url":null,"abstract":"*Correspondence: Tapalina Bhattasali, St. Xavier’s College (Autonomous), Kolkata, India, tapalina@sxccal.edu Abstract Cloud service model can provide flexible storage place to store electronic data cost-effectively. However, storage of sensitive data in the third party cloud domain may violate the privacy of data. For this reason, encryption logic needs to be applied before uploading it to cloud storage. Use of encryption logic may violate the availability of data. It is now becoming a big concern to retrieve data securely from the cloud storage. This paper considers a remote application environment, where cloud data retrieval service must be secured to preserve the privacy of sensitive data. Here multiple items are searched in a single query to make the procedure faster, and the only specific number of relevant records can be retrieved at a time to save bandwidth cost. Encryption logic is proposed in such a way that encrypted cloud data could be processed without decryption. A secured retrieval service is proposed here to ensure data availability at any time. Hybrid encryption logic is designed based on AES cipher and homomorphism properties. Limitations of fully Homomorphic encryption are avoided in proposed logic. Analytical study of AES cipher shows its efficiency to encrypt electronic data and reply vectors. Theoretical analysis of homomorphism shows its efficiency to secure searchable index, items, and query vectors required in cloud data retrieval service.","PeriodicalId":275688,"journal":{"name":"Azerbaijan Journal of High Performance Computing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116223842","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}

引用次数: 0

PARALLEL NUMERICAL METHOD OF AN INVERSE PROBLEM OF DOUBLE-PHASED FILTRATION 双相过滤反问题的并行数值方法

Azerbaijan Journal of High Performance Computing Pub Date : 2019-06-30 DOI: 10.32010/26166127.2019.2.1.75.81

Araz Aliev, Khanlar Hamzaev, N. Ismayilova, Eldar Jahangirbayov, F. Jafarov, R. Mammadov

引用次数: 0

OBRE: OFFER-BORROW-REFORM-EVALUATE INITIATIVES FOR GREEN DBMSS 为绿色DBMSS提供-借贷-改革-评估方案

Azerbaijan Journal of High Performance Computing Pub Date : 2019-06-30 DOI: 10.32010/26166127.2019.2.1.39.63

Amine Roukh, Ladjel Bellatreche, Nikos Tziritas

{"title":"OBRE: OFFER-BORROW-REFORM-EVALUATE INITIATIVES FOR GREEN DBMSS","authors":"Amine Roukh, Ladjel Bellatreche, Nikos Tziritas","doi":"10.32010/26166127.2019.2.1.39.63","DOIUrl":"https://doi.org/10.32010/26166127.2019.2.1.39.63","url":null,"abstract":"In the last few years, we have been seeing a significant increase in research about the energy efficiency of hardware and software components by both academic and industry. Today, energy efficiency is one of the most challenging issues in the area of information technologies and communication. In data-centric applications, database management systems are one of the major energy consumers, in which, a large amount of data is queried by complex queries running daily. Designing and implementing of an energy-aware DBMS that enables significant energy conservation while processing queries become a necessary need. Traditionally, existing DBMSs focus to high-performance during query optimization phase, while totally ignoring the energy consumption of the queries. In this paper, we propose a methodology, supported by a tool called EcoProD, focusing on query optimizers. To show its effectiveness, we implement it in Post-greSQL DBMS aiming reducing energy consumption without degrading query response time. A mathematical cost model is used to estimate the energy consumption. Its parameters are identified by a machine learning technique. We conduct intensive experiments using our cost models and a measurement tool dedicated to compute energy using dataset of TPC-H benchmark. Based on the obtained results, a probabilistic proof to demonstrate the confidence bounds of our model and results is given.","PeriodicalId":275688,"journal":{"name":"Azerbaijan Journal of High Performance Computing","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114468417","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}

引用次数: 0

CHALLENGES OF RESOURCE DISCOVERY TO SUPPORT DISTRIBUTED EXASCALE COMPUTING ENVIRONMENT 支持分布式百亿亿次计算环境的资源发现挑战

Azerbaijan Journal of High Performance Computing Pub Date : 2018-12-20 DOI: 10.32010/26166127.2018.1.2.168.178

Elham Adibi, Ehsan Mousavi Khaneghah

{"title":"CHALLENGES OF RESOURCE DISCOVERY TO SUPPORT DISTRIBUTED EXASCALE COMPUTING ENVIRONMENT","authors":"Elham Adibi, Ehsan Mousavi Khaneghah","doi":"10.32010/26166127.2018.1.2.168.178","DOIUrl":"https://doi.org/10.32010/26166127.2018.1.2.168.178","url":null,"abstract":"*Correspondence: Elham Adibi, Department of Computer Engineering, Faculty of Engineering, Shahed University, Tehran, Iran, Elham.Adibi@ shahed.ac.ir Abstract The resource discovery management unit (RD) in distributed Exascale systems needs to be able to manage the occurrence of dynamic and interactive events in the requesting process when running activities related to RD. The occurrence of dynamic and interactive events in the requesting process causes some challenges in the execution trend of activities related to RD. The trend of execution activities related to RD will fail if there is no management and control on the occurrence of dynamic and interactive events. This paper first explores and describes the concept of dynamic and interactive nature in distributed Exascale systems. In addition, it attempts to show the influences of occurrence the dynamic and interactive events in the computing elements requesting the resource as well as on RD functionality. In addition, this paper aims at describing the challenges of RD to be used in distributed Exascale systems. To achieve this, changes need to be made in the generating space and RD functionality. Taking into account the solutions presented in this paper, RD has the potential to be used in distributed Exascale systems by remaining compatible with traditional computing systems.","PeriodicalId":275688,"journal":{"name":"Azerbaijan Journal of High Performance Computing","volume":"1 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115747890","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}

引用次数: 8

CLOUD-BASED FLOWBSTER PORTAL TO DESIGN AND DEPLOY SCIENTIFIC WORKFLOWS 基于云的flowbster门户网站，用于设计和部署科学工作流

Azerbaijan Journal of High Performance Computing Pub Date : 2018-12-20 DOI: 10.32010/26166127.2018.1.2.140.157

J. Kovács, Z. Farkas, E. Nagy, B. Gúlyás

引用次数: 1

ENHANCING QOS USING A NOVEL TASK SCHEDULING APPROACH IN CLOUD COMPUTING 在云计算中使用一种新的任务调度方法增强qos

Azerbaijan Journal of High Performance Computing Pub Date : 2018-12-20 DOI: 10.32010/26166127.2018.1.2.185.213

S. Jha

引用次数: 0

LOAD BALANCING IN DISTRIBUTED EXASCALE COMPUTING BASED ON PROCESS REQUIREMENTS 分布式百亿亿级计算中基于进程需求的负载平衡

Azerbaijan Journal of High Performance Computing Pub Date : 2018-12-20 DOI: 10.32010/26166127.2018.1.2.158.167

Shirin Shahrabi, Ehsan Mousavi Khaneghah, Faezeh Mollasalehi, A. Aliev

{"title":"LOAD BALANCING IN DISTRIBUTED EXASCALE COMPUTING BASED ON PROCESS REQUIREMENTS","authors":"Shirin Shahrabi, Ehsan Mousavi Khaneghah, Faezeh Mollasalehi, A. Aliev","doi":"10.32010/26166127.2018.1.2.158.167","DOIUrl":"https://doi.org/10.32010/26166127.2018.1.2.158.167","url":null,"abstract":"Shirin Shahrabi1, Faezeh Mollasalehi1, Araz R Aliev2, Ehsan Mousavi Khaneghah1 1Department of Computer Engineering, Faculty of Engineering, Shahed University, Tehran, Iran; Sh.Shahrabi@Shahed.ac.ir, Faezeh.Mollasalehi@Shahed.ac.ir, EMousavi@Shahed. ac.ir; 2Department of General and Applied Mathematics, HPC Advance Research Center, Azerbaijan State Oil and Industry University, Baku, Azerbaijan; alievaraz@azjhpc.org *Correspondence: Shirin Shahrabi, Department of Computer Engineering, Faculty of Engineering, Shahed University, Tehran, Iran; Sh.Shahrabi@Shahed.ac.ir Abstract In distributed Exascale systems, the occurrence of a dynamic and interactive nature changes the workload of the system’s computing elements. Because of this, the load balancer needs to collect information on the system state. Activating the load balancer increases the runtime of the scientific application. While analyzing the impact of the dynamic and interactive nature on the load balancer functionality, this paper also attempts to provide a mathematical definition for load balancer based on the concept of dynamic and interactive nature. This makes it possible to describe and examine the load balancer functionality by considering the impacts of the dynamic and interactive nature. As a result, decisions can be made on the behavior of the load balancer when a dynamic and interactive nature occurs. According to the mentioned operational function, this paper has analyzed the load balancer’s behavior in processes with a dynamic and interactive nature. The introduced operational function for the load balancer in this paper enables the management element to separate the requests of processes with a dynamic and interactive nature and normal processes that leads to redistribution.","PeriodicalId":275688,"journal":{"name":"Azerbaijan Journal of High Performance Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133325322","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}

引用次数: 2

APPLYING MULTIPLE MULTIDIMENSIONAL KNAPSACK PROBLEM TO DYNAMIC LOAD BALANCING IN DISTRIBUTED EXASCALE COMPUTING ENVIRONMENT 多维背包问题在分布式百亿亿次计算环境下动态负载平衡中的应用

Azerbaijan Journal of High Performance Computing Pub Date : 2018-12-20 DOI: 10.32010/26166127.2018.1.2.214.218

Ulphat Bakhishoff

引用次数: 1

CONVERGENCE OF HPC AND AI: TWO DIRECTIONS OF CONNECTION HPC与ai的融合:两个方向的连接

Azerbaijan Journal of High Performance Computing Pub Date : 2018-12-20 DOI: 10.32010/26166127.2018.1.2.179.184

N. Ismayilova, Azerbaijan State Oil, E. Ismayilov

引用次数: 3