A. Qawasmeh, Salah Taamneh, A. Aljammal, Nabhan Hamadneh, Mustafa Banikhalaf, M. Kharabsheh
Different high performance techniques, such as profiling, tracing, and instrumentation, have been used to tune and enhance the performance of parallel applications. However, these techniques do not show how to explore the potential of parallelism in a given application. Animating and visualizing the execution process of a sequential algorithm provide a thorough understanding of its usage and functionality. In this work, an interactive web-based educational animation tool was developed to assist users in analyzing sequential algorithms to detect parallel regions regardless of the used parallel programming model. The tool simplifies algorithms’ learning, and helps students to analyze programs efficiently. Our statistical t-test study on a sample of students showed a significant improvement in their perception of the mechanism and parallelism of applications and an increase in their willingness to learn algorithms and parallel programming.
{"title":"Parallelism exploration in sequential algorithms via animation tool","authors":"A. Qawasmeh, Salah Taamneh, A. Aljammal, Nabhan Hamadneh, Mustafa Banikhalaf, M. Kharabsheh","doi":"10.3233/mgs-210347","DOIUrl":"https://doi.org/10.3233/mgs-210347","url":null,"abstract":"Different high performance techniques, such as profiling, tracing, and instrumentation, have been used to tune and enhance the performance of parallel applications. However, these techniques do not show how to explore the potential of parallelism in a given application. Animating and visualizing the execution process of a sequential algorithm provide a thorough understanding of its usage and functionality. In this work, an interactive web-based educational animation tool was developed to assist users in analyzing sequential algorithms to detect parallel regions regardless of the used parallel programming model. The tool simplifies algorithms’ learning, and helps students to analyze programs efficiently. Our statistical t-test study on a sample of students showed a significant improvement in their perception of the mechanism and parallelism of applications and an increase in their willingness to learn algorithms and parallel programming.","PeriodicalId":43659,"journal":{"name":"Multiagent and Grid Systems","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78532983","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 data and IT technology, cloud computing is gaining more and more attention, and many users are attracted to this paradigm because of the reduction in cost and the dynamic allocation of resources. Load balancing is one of the main challenges in cloud computing system. It redistributes workloads across computing nodes within cloud to minimize computation time, and to improve the use of resources. This paper proposes an enhanced ‘Active VM load balancing algorithm’ based on fuzzy logic and k-means clustering to reduce the data center transfer cost, the total virtual machine cost, the data center processing time and the response time. The proposed method is realized using Java and CloudAnalyst Simulator. Besides, we have compared the proposed algorithm with other task scheduling approaches such as Round Robin algorithm, Throttled algorithm, Equally Spread Current Execution Load algorithm, Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO). As a result, the proposed algorithm performs better in terms of service rate and response time.
{"title":"Enhanced active VM load balancing algorithm using fuzzy logic and K-means clustering","authors":"Mostefa Hamdani, Youcef Aklouf","doi":"10.3233/MGS-210343","DOIUrl":"https://doi.org/10.3233/MGS-210343","url":null,"abstract":"With the rapid development of data and IT technology, cloud computing is gaining more and more attention, and many users are attracted to this paradigm because of the reduction in cost and the dynamic allocation of resources. Load balancing is one of the main challenges in cloud computing system. It redistributes workloads across computing nodes within cloud to minimize computation time, and to improve the use of resources. This paper proposes an enhanced ‘Active VM load balancing algorithm’ based on fuzzy logic and k-means clustering to reduce the data center transfer cost, the total virtual machine cost, the data center processing time and the response time. The proposed method is realized using Java and CloudAnalyst Simulator. Besides, we have compared the proposed algorithm with other task scheduling approaches such as Round Robin algorithm, Throttled algorithm, Equally Spread Current Execution Load algorithm, Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO). As a result, the proposed algorithm performs better in terms of service rate and response time.","PeriodicalId":43659,"journal":{"name":"Multiagent and Grid Systems","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84509466","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}
Data-intensive cloud computing systems are growing year by year due to the increasing volume of data. In this context, data replication technique is frequently used to ensure a Quality of service, e.g., performance. However, most of the existing data replication strategies just reproduce the same number of replicas on some nodes, which is certainly not enough for more accurate results. To solve these problems, we propose a new data Replication and Placement strategy based on popularity of User Requests Group (RPURG). It aims to reduce the tenant response time and maximize benefit for the cloud provider while satisfying the Service Level Agreement (SLA). We demonstrate the validity of our strategy in a performance evaluation study. The result of experimentation shown robustness of RPURG.
{"title":"A new popularity-based data replication strategy in cloud systems","authors":"Abdenour Lazeb, R. Mokadem, Ghalem Belalem","doi":"10.3233/mgs-210348","DOIUrl":"https://doi.org/10.3233/mgs-210348","url":null,"abstract":"Data-intensive cloud computing systems are growing year by year due to the increasing volume of data. In this context, data replication technique is frequently used to ensure a Quality of service, e.g., performance. However, most of the existing data replication strategies just reproduce the same number of replicas on some nodes, which is certainly not enough for more accurate results. To solve these problems, we propose a new data Replication and Placement strategy based on popularity of User Requests Group (RPURG). It aims to reduce the tenant response time and maximize benefit for the cloud provider while satisfying the Service Level Agreement (SLA). We demonstrate the validity of our strategy in a performance evaluation study. The result of experimentation shown robustness of RPURG.","PeriodicalId":43659,"journal":{"name":"Multiagent and Grid Systems","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88782019","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}
Privacy preserved outsourced data access control is a hard task under the control of thirdâparty storage server. To overcome obstacles in the third party based scenario, Attribute-based signcryption system with bilinear pairing tool is one of the most suitable methods in cloud. It maintains the basic features of security like, authenticity, confidentiality, public verifiability, owner privacy, etc. Although, this method has some challenges like a centralized authority used for user secret key generation for de-signcryption operation, and lack in competent attribute revocation. To overcome the issues, we have proposed a scheme of attribute revocable privacy preserved outsourced based data access control mechanism using Attribute-based signcryption. The proposed method allows multi-authorities for assigning both attribute and secret keys for users along with trusted certified authority, which provides security parameters. The analysis of the proposed method shows less computation cost in decryption and authentication verification. The almost same performance and efficiency is found while comparing with the existing schemes after adding new features.
{"title":"Privacy preserved secured outsourced cloud data access control scheme with efficient multi-authority attribute based signcryption","authors":"Somen Debnath, B. Bhuyan, A. Saha","doi":"10.3233/mgs-200338","DOIUrl":"https://doi.org/10.3233/mgs-200338","url":null,"abstract":"Privacy preserved outsourced data access control is a hard task under the control of thirdâparty storage server. To overcome obstacles in the third party based scenario, Attribute-based signcryption system with bilinear pairing tool is one of the most suitable methods in cloud. It maintains the basic features of security like, authenticity, confidentiality, public verifiability, owner privacy, etc. Although, this method has some challenges like a centralized authority used for user secret key generation for de-signcryption operation, and lack in competent attribute revocation. To overcome the issues, we have proposed a scheme of attribute revocable privacy preserved outsourced based data access control mechanism using Attribute-based signcryption. The proposed method allows multi-authorities for assigning both attribute and secret keys for users along with trusted certified authority, which provides security parameters. The analysis of the proposed method shows less computation cost in decryption and authentication verification. The almost same performance and efficiency is found while comparing with the existing schemes after adding new features.","PeriodicalId":43659,"journal":{"name":"Multiagent and Grid Systems","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2020-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85652213","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}
Micro differential evolution (mDE) refers to algorithms that evolve with a small population to search for good solutions. Although mDEs are very useful for resource-constrained optimization tasks, the research on mDEs is still limited. In this paper, we propose a new mDE, i.e., vectorized bimodal distribution based mDE (called VB-mDE). The main idea is to employ a vectorized bimodal distribution parameter adjustment mechanism in mDE for performance enhancement. Specifically, in the VB-mDE, two important control parameters, i.e., scale factor F and crossover rate CR, are adjusted by bimodal Cauchy distribution. At the same time, to increase the population diversity, the scale factor F is vectorized. The proposed VB-mDE is evaluated on the CEC2014 benchmark functions and compared with the state-of-the-art mDEs and normal DEs. The results show that the proposed VB-mDE has advantages in terms of solution accuracy and convergence speed.
{"title":"A vectorized bimodal distribution based micro differential evolution algorithm (VB-mDE)","authors":"Xu Chen, Xueliang Miao, Hugo Tianfield","doi":"10.3233/MGS-200331","DOIUrl":"https://doi.org/10.3233/MGS-200331","url":null,"abstract":"Micro differential evolution (mDE) refers to algorithms that evolve with a small population to search for good solutions. Although mDEs are very useful for resource-constrained optimization tasks, the research on mDEs is still limited. In this paper, we propose a new mDE, i.e., vectorized bimodal distribution based mDE (called VB-mDE). The main idea is to employ a vectorized bimodal distribution parameter adjustment mechanism in mDE for performance enhancement. Specifically, in the VB-mDE, two important control parameters, i.e., scale factor F and crossover rate CR, are adjusted by bimodal Cauchy distribution. At the same time, to increase the population diversity, the scale factor F is vectorized. The proposed VB-mDE is evaluated on the CEC2014 benchmark functions and compared with the state-of-the-art mDEs and normal DEs. The results show that the proposed VB-mDE has advantages in terms of solution accuracy and convergence speed.","PeriodicalId":43659,"journal":{"name":"Multiagent and Grid Systems","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2020-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78965667","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":"A multiagent reinforcement learning algorithm to solve the maximum independent set problem","authors":"Mir Mohammad Alipour, M. Abdolhosseinzadeh","doi":"10.3233/mgs-200323","DOIUrl":"https://doi.org/10.3233/mgs-200323","url":null,"abstract":"","PeriodicalId":43659,"journal":{"name":"Multiagent and Grid Systems","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2020-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.3233/mgs-200323","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72531622","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}
In light of recent trends toward introducing Artificial Intelligence (AI) to enhance the Human Machine Interface (HMI), companies need to identify the key issues of the communication between operator and production machines. Despite the fact that the industrial company starts to introduce chatbots to assist the communication between humans and machines, the virtual assistant (or digital assistant) by using human natural language is still widely required in the manufacturing domain. In this paper, we introduce an AI-based virtual assistant, Bot-X, for the manufacturing industry to handle a variety of complex services, e.g., order processing, production execution. This work expands the idea in three directions. Firstly, we introduce the design motivation of Bot-X, e.g., knowledge boundary in the manufacturing context. Secondly, the design principle of Bot-X is presented, including the framework, system architecture, model architecture, and the core algorithm. Then, three scenarios are presented to test the Bot-X usability and flexibility regarding the manufacturing environment.
{"title":"Bot-X: An AI-based virtual assistant for intelligent manufacturing","authors":"Chen Li, Hongji Yang","doi":"10.3233/MGS-210340","DOIUrl":"https://doi.org/10.3233/MGS-210340","url":null,"abstract":"In light of recent trends toward introducing Artificial Intelligence (AI) to enhance the Human Machine Interface (HMI), companies need to identify the key issues of the communication between operator and production machines. Despite the fact that the industrial company starts to introduce chatbots to assist the communication between humans and machines, the virtual assistant (or digital assistant) by using human natural language is still widely required in the manufacturing domain. In this paper, we introduce an AI-based virtual assistant, Bot-X, for the manufacturing industry to handle a variety of complex services, e.g., order processing, production execution. This work expands the idea in three directions. Firstly, we introduce the design motivation of Bot-X, e.g., knowledge boundary in the manufacturing context. Secondly, the design principle of Bot-X is presented, including the framework, system architecture, model architecture, and the core algorithm. Then, three scenarios are presented to test the Bot-X usability and flexibility regarding the manufacturing environment.","PeriodicalId":43659,"journal":{"name":"Multiagent and Grid Systems","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2020-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75438090","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}
Ningkui Wang, Hayfa Zgaya-Biau, P. Mathieu, S. Hammadi
Multiagent Resource Allocation (MARA) is a field to find out solutions that distribute a set of resources among agents. Heretofore, lots of utility-and reputation-based approaches have been proposed. In this paper, we develop a preference-based resource reservation approach for resource allocation in a system that consists of entirely selfless agents. Preference, defined as the satisfaction of required resources, has a crucial impact on resource allocation. The importance degree is also adopted to represent the extent to which a particular attribute is needed. In the system, agents communicate with semi-local friends to exchange information as well as reserving resources. Finally, a confirmation or cancelation message is sent to obtain or release the reserved resources. Numerical examples are given to show the rationality and effectiveness of the proposed method.
{"title":"Preference-based resource reservation method for resource allocation in full distributed systems","authors":"Ningkui Wang, Hayfa Zgaya-Biau, P. Mathieu, S. Hammadi","doi":"10.3233/mgs-190317","DOIUrl":"https://doi.org/10.3233/mgs-190317","url":null,"abstract":"Multiagent Resource Allocation (MARA) is a field to find out solutions that distribute a set of resources among agents. Heretofore, lots of utility-and reputation-based approaches have been proposed. In this paper, we develop a preference-based resource reservation approach for resource allocation in a system that consists of entirely selfless agents. Preference, defined as the satisfaction of required resources, has a crucial impact on resource allocation. The importance degree is also adopted to represent the extent to which a particular attribute is needed. In the system, agents communicate with semi-local friends to exchange information as well as reserving resources. Finally, a confirmation or cancelation message is sent to obtain or release the reserved resources. Numerical examples are given to show the rationality and effectiveness of the proposed method.","PeriodicalId":43659,"journal":{"name":"Multiagent and Grid Systems","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2020-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86037127","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":"A graph transformation based approach for multi-agent systems reorganization","authors":"Fayçal Guerrouf, A. Chaoui","doi":"10.3233/mgs-190318","DOIUrl":"https://doi.org/10.3233/mgs-190318","url":null,"abstract":"","PeriodicalId":43659,"journal":{"name":"Multiagent and Grid Systems","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2020-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88315743","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
扫码关注我们
求助内容：
应助结果提醒方式：