{"title":"SCALABLE COMPLEX EVENT PROCESSING USING RULE DISTRIBUTION","authors":"M. Sharifi, Mohammad Ali Fardbastani","doi":"10.32010/26166127.2018.1.2.133.139","DOIUrl":"https://doi.org/10.32010/26166127.2018.1.2.133.139","url":null,"abstract":"*Correspondence: Mohsen Sharifi, Distributed Systems Research Lab, School of Computer Engineering, Iran University of Science and Technology, Tehran, Iran, msharifi@iust.ac.ir Abstract Complex event processing (CEP) systems are currently widely used in large-scale enterprises for the processing of high and dynamically changing rates of input events using large number of complex rules. Given the hardware limitations of vertically scaled CEP solutions, horizontal scalability has become an essential requirement for modern CEP systems. In this paper, we propose an adaptive load-balancing technique via rule distribution (called ARD) for a cluster of CEP engines that provides horizontal scalability for CEP systems. Our experiments show our proposed technique provides higher scalability and yields higher throughput in comparison with two previously proposed non-adaptive load-balancing techniques, namely VISIRI and SCTXPF, when the system faces with variable workload. In addition, ARD keeps the system balanced more often.","PeriodicalId":275688,"journal":{"name":"Azerbaijan Journal of High Performance Computing","volume":"40 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":"124236929","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}
Ehsan Mousavi Khaneghah, A. Aliev, Ulphat Bakhishoff, Elham Adibi
{"title":"The Influence of Exascale on Resource Discovery and Defining an Indicator","authors":"Ehsan Mousavi Khaneghah, A. Aliev, Ulphat Bakhishoff, Elham Adibi","doi":"10.32010/26166127.2018.1.1.3.19","DOIUrl":"https://doi.org/10.32010/26166127.2018.1.1.3.19","url":null,"abstract":"","PeriodicalId":275688,"journal":{"name":"Azerbaijan Journal of High Performance Computing","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115043882","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}
{"title":"Data Migration for Large Scientific Datasets in Clouds","authors":"Á. Hajnal, E. Nagy, P. Kacsuk, I. Márton","doi":"10.32010/26166127.2018.1.1.66.86","DOIUrl":"https://doi.org/10.32010/26166127.2018.1.1.66.86","url":null,"abstract":"1Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary, akos.hajnal@sztaki.mta.hu, eniko.nagy@sztaki.mta.hu, peter.kacsuk@sztaki.mta.hu *Correspondence: Peter Kacsuk, nstitute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary, peter.kacsuk@ sztaki.mta.hu Abstract Transferring large data files between various storages including cloud storages is an important task both for academic and commercial users. This should be done in an efficient and secure way. The paper describes Data Avenue that fulfills all these conditions. Data Avenue can efficiently transfer large files even in the range of TerraBytes among storages having very different access protocols (Amazon S3, OpenStack Swift, SFTP, SRM, iRODS, etc.). It can be used in personal, organizational and public deployment with all the security mechanisms required for these usage configurations. Data Avenue can be used by a GUI as well as by a REST API. The papers describes in detail all these features and usage modes of Data Avenue and also provides performance measurement results proving the efficiency of the tool that can be accessed and used via several public web pages.","PeriodicalId":275688,"journal":{"name":"Azerbaijan Journal of High Performance Computing","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127894880","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}
K. Z. Zamli, Abdulrahman A. Alsewari, Bestoun S. Ahmed
{"title":"Multi-Start Jaya Algorithm for Software Module Clustering Problem","authors":"K. Z. Zamli, Abdulrahman A. Alsewari, Bestoun S. Ahmed","doi":"10.32010/26166127.2018.1.1.87.112","DOIUrl":"https://doi.org/10.32010/26166127.2018.1.1.87.112","url":null,"abstract":"1 IBM Centre of Excellence, Faculty of Computer Systems and Software Engineering, Universiti Malaysia Pahang, Pahang, Malaysia, kamalz@ump.edu.my 2 Faculty of Computer Systems and Software Engineering,Universiti Malaysia Pahang, Pahang, Malaysia, alsewari@ump.edu.my 3 Department of Computer Science, Faculty of Electrical Engineering, Czech Technical University, Prague, Czech Republic, albeybes@fel.cvut.cz *Correspondence: Kamal Z. Zamli, IBM Centre of Excellence, Faculty of Computer Systems and Software Engineering, Universiti Malaysia Pahang, Pahang, Malaysia, kamalz@ump. edu.my Abstract Jaya algorithm has gained considerable attention lately due to its simplicity and requiring no control parameters (i.e. parameter free). Despite its potential, Jaya algorithm is inherently designed for single objective problems. Additionally, Jaya is limited by the intense conflict between exploration (i.e. roams the random search space at the global scale) and exploitation (i.e. neighborhood search by exploiting the current good solution). Thus, Jaya requires better control for exploitation and exploration in order to prevent premature convergence and avoid being trapped in local optima. Addressing these issues, this paper proposes a new multi-objective Jaya variant with a multi-start adaptive capability and Cuckoo search like elitism scheme, called MS-Jaya, to enhance its exploitation and exploration allowing good convergence while permitting more diverse solutions. To assess its performances, we adopt MSJaya for the software module clustering problem. Experimental results reveal that MS-Jaya exhibits competitive performances against the original Jaya and state-of-the-art parameter free meta-heuristic counterparts consisting of Teaching Learning based Optimization (TLBO), Global Neighborhood Algorithm (GNA), Symbiotic Optimization Search (SOS), and Sine Cosine Algorithm (SCA).","PeriodicalId":275688,"journal":{"name":"Azerbaijan Journal of High Performance Computing","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122638870","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}
Ehsan Mousavi Khaneghah, Amirhosein Reyhani ShowkatAbad, Nosratollah Shadnoush, N. Ismayilova, Reyhaneh Noorabad Ghahroodi, E. Ismayilov, Mohammad Saeed Nabati Saravani, F. Sarraf, Ali Soveizi
{"title":"ExaMig Matrix: Process Migration based on Matrix Definition of Selecting Destination in Distributed Exascale Environments","authors":"Ehsan Mousavi Khaneghah, Amirhosein Reyhani ShowkatAbad, Nosratollah Shadnoush, N. Ismayilova, Reyhaneh Noorabad Ghahroodi, E. Ismayilov, Mohammad Saeed Nabati Saravani, F. Sarraf, Ali Soveizi","doi":"10.32010/26166127.2018.1.1.20.41","DOIUrl":"https://doi.org/10.32010/26166127.2018.1.1.20.41","url":null,"abstract":"In traditional computing system, load balancer, interim selecting the process, determine the destination computing node based on describing Indicators process status. In distributed Exascale computing system, due to the possibility of occurrence of a dynamic and interactive nature in execution time, it is possible. That the chosen destination computing node affected with dynamic and interactive nature so cannot be considered as a destination in process migration. This paper, by changing management approach in process migration. Consider process as an abstract element on the target computing node and calculates the impact of the factors the parameters affecting the process. Considering the above factors make process migration manager able to create sets of computational node that can be considered as destination computing node. In the event of a dynamic and interactive nature, in each element of the set, the process migration management, consider the effects of the factors affecting the activity of the process management and then re-weighs the computing element which make the above set. Using this mechanism allow the process migration management in case of dynamic and interactive nature occurrence in destination able to decide about changing on global activity execution so it is not necessary to recall load balancer manager in order to choose destination computing node. These subject louds to decrease execution time of process migration activity in distributed Exascale computing system.","PeriodicalId":275688,"journal":{"name":"Azerbaijan Journal of High Performance Computing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128045435","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}
Mayank Tiwary, Bangalore India Sap Lab, Pritish Mishra, M. Obaidat, Deepak Puthal
{"title":"ISE: An Intelligent and Efficient Steganalysis Engine for Image Database in Big Data Systems","authors":"Mayank Tiwary, Bangalore India Sap Lab, Pritish Mishra, M. Obaidat, Deepak Puthal","doi":"10.32010/26166127.2018.1.1.42.50","DOIUrl":"https://doi.org/10.32010/26166127.2018.1.1.42.50","url":null,"abstract":"1 SAP Lab, Bangalore, India, {mayank.tiwary, pritishmishra}@sap.com, 2 Department of ECE, Nazarbayev University, Astana, Kazakhstan;] King Abdullah II School of Information Technology, The University of Jordan, Jordan, Ministry of Education Overseas Distinguished Professor at University of Science and Technology Beijing, China, msobaidat@gmail.com 3 University of Technology Sydney, Australia, deepak.puthal@uts.edu.au *Correspondence: Mohammad S. Obaidat, The University of Jordan, Jordan, Ministry of Education Overseas Distinguished Professor at University of Science and Technology Beijing, msobaidat@gmail.com Abstract The aim of this work is to design a faster and artificially intelligent steganalysis engine, which is able to secure the image databases from any infected image in big data environment. The proposed Intelligent Steganalysis Engine (ISE) for image database in big data makes use of three steps, which are image estimation, feature generation and classification. In the first step, five new images are estimated from the original image, for computing 438 features and then these data images are passed through a classifier for final prediction of a stego image. The engine is designed based on Map-Reduce programming approach to cope with big data. The actual experiments were performed on the Big Data Hadoop by taking standard image data set. In the first two steps, the images are processed in both spatial and DCT domain. During these steps the implementations of image estimation and feature extraction algorithms become very much computationally intensive and seek a huge amount of time. The results obtained are compared with previously reported six similar works and an inference has been drawn for appropriate use of feature set and classifier pair.","PeriodicalId":275688,"journal":{"name":"Azerbaijan Journal of High Performance Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128443357","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}
{"title":"The “CPU+GPU+MIC” Hybrid Supercomputer π","authors":"James Lin, Minhua Wen","doi":"10.32010/26166127.2018.1.1.126.128","DOIUrl":"https://doi.org/10.32010/26166127.2018.1.1.126.128","url":null,"abstract":"*Correspondence: James Lin, Center for HPC, Shanghai Jiao Tong University, Shanghai, China, james@sjtu.edu.cn Abstract The supercomputer π at Center for HPC (CHPC) of Shanghai Jiao Tong University (SJTU) was the fastest supercomputer among all the universities in China during 2013 to 2015. With a highly hybrid architecture, it is the first “CPU+GPU+MIC” supercomputer in China. It was also the largest Kepler GPU cluster in China when deployed in 2013. In addition, it firstly utilized the “FDR+DDN” combination in China. In this paper, we will introduce the design of supercomputer π.","PeriodicalId":275688,"journal":{"name":"Azerbaijan Journal of High Performance Computing","volume":"916 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123278253","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}
Bandar Aldawsari, T. Baker, M. Asim, Z. Maamar, D. Al-Jumeily, M. Al-khafajiy
{"title":"A Survey of Resource Management Challenges in Multi-cloud Environment: Taxonomy and Empirical Analysis","authors":"Bandar Aldawsari, T. Baker, M. Asim, Z. Maamar, D. Al-Jumeily, M. Al-khafajiy","doi":"10.32010/26166127.2018.1.1.51.65","DOIUrl":"https://doi.org/10.32010/26166127.2018.1.1.51.65","url":null,"abstract":"Cloud computing has seen a great deal of interest by researchers and industrial firms since its first coined. Different perspectives and research problems, such as energy efficiency, security and threats, to name but a few, have been dealt with and addressed from cloud computing perspective. However, cloud computing environment still encounters a major challenge of how to allocate and manage computational resources efficiently. Furthermore, due to the different architectures and cloud computing networks and models used (i.e., federated clouds, VM migrations, cloud brokerage), the complexity of resource management in the cloud has been increased dramatically. Cloud providers and service consumers have the cloud brokers working as the intermediaries between them, and the confusion among the cloud computing parties (consumers, brokers, data centres and service providers) on who is responsible for managing the request of cloud resources is a key issue. In a traditional scenario, upon renting the various cloud resources from the providers, the cloud brokers engage in subletting and managing these resources to the service consumers. However, providers’ usually deal with many brokers, and vice versa, and any dispute of any kind between the providers and the brokers will lead to service unavailability, in which the consumer is the only victim. Therefore, managing cloud resources and services still needs a lot of attention and effort. This paper expresses the survey on the systems of the cloud brokerage resource management issues in multi-cloud environments.","PeriodicalId":275688,"journal":{"name":"Azerbaijan Journal of High Performance Computing","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116639779","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}