Pub Date : 2016-06-23DOI: 10.18495/COMENGAPP.V5I2.172
F. Ebadifard, Zeinab Borhanifard
The issue of scheduling is one of the most important ones to be considered by providers of the cloud computing in the data center. Using a suitable solution lets the providers of cloud computing use the available resources more. Additionally, the satisfaction of clients is met through provision of service quality parameters. Most of the solutions for this problem aim at one of the service quality factors and in order to achieve this goal, variety of methods are used. Using the algorithm of modified black hole in this paper, a proper solution is presented to tackle the problem of scheduling the affairs in cloud environment. The proposed method reduces makespan, increases degree of load balancing, and improves the resource`s utilization by considering the capability of each virtual machine. We have compared the proposed algorithm with existing task scheduling algorithms. Simulation results indicate that the proposed algorithm makes a good improvement regarding the makespan and amount of resource utilization compared to schedulers based on Random assignment and particle swarm optimization Algorithms.
{"title":"A Modified Black Hole-Based Task Scheduling Technique for Cloud Computing Environment","authors":"F. Ebadifard, Zeinab Borhanifard","doi":"10.18495/COMENGAPP.V5I2.172","DOIUrl":"https://doi.org/10.18495/COMENGAPP.V5I2.172","url":null,"abstract":"The issue of scheduling is one of the most important ones to be considered by providers of the cloud computing in the data center. Using a suitable solution lets the providers of cloud computing use the available resources more. Additionally, the satisfaction of clients is met through provision of service quality parameters. Most of the solutions for this problem aim at one of the service quality factors and in order to achieve this goal, variety of methods are used. Using the algorithm of modified black hole in this paper, a proper solution is presented to tackle the problem of scheduling the affairs in cloud environment. The proposed method reduces makespan, increases degree of load balancing, and improves the resource`s utilization by considering the capability of each virtual machine. We have compared the proposed algorithm with existing task scheduling algorithms. Simulation results indicate that the proposed algorithm makes a good improvement regarding the makespan and amount of resource utilization compared to schedulers based on Random assignment and particle swarm optimization Algorithms.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131283476","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 : 2016-06-22DOI: 10.18495/COMENGAPP.V5I2.170
Mohamed Osman Imam, A. Yousif, M. Bashir
Cloud computing is a general term for anything that involves delivering hosted services over the Internet. It is a construct that allows you to access applications that actually reside at locations other than your computer or other Internet-connected devices. Software as a Service (SaaS) is a software delivery model in which software resources are accessed remotely by users over the internet. Enterprises prefer using SaaS because of its low cost. SaaS requires sharing of application servers among multiple tenants for low operational costs. Several SaaS Toolkits are available and used to develop cloud SaaS applications. However, most of these Toolkits are very complex. This paper aims to build a new simple and easy SaaS Toolkit to develop SaaS applications and to avoid the difficulties and complexity in the current cloud SaaS Toolkits. The proposed Toolkit is based on java virtual machine and the popular web programming languages HTML and PHP. To evaluate the proposed Toolkit an empirical study has been conducted. The result of the empirical study revealed that the proposed Toolkit outperforms the current Toolkits in terms of complexity, understandability and learnability.
{"title":"A Proposed Software as a Service (SaaS) Toolkit for Cloud Multi- Tenancy","authors":"Mohamed Osman Imam, A. Yousif, M. Bashir","doi":"10.18495/COMENGAPP.V5I2.170","DOIUrl":"https://doi.org/10.18495/COMENGAPP.V5I2.170","url":null,"abstract":"Cloud computing is a general term for anything that involves delivering hosted services over the Internet. It is a construct that allows you to access applications that actually reside at locations other than your computer or other Internet-connected devices. Software as a Service (SaaS) is a software delivery model in which software resources are accessed remotely by users over the internet. Enterprises prefer using SaaS because of its low cost. SaaS requires sharing of application servers among multiple tenants for low operational costs. Several SaaS Toolkits are available and used to develop cloud SaaS applications. However, most of these Toolkits are very complex. This paper aims to build a new simple and easy SaaS Toolkit to develop SaaS applications and to avoid the difficulties and complexity in the current cloud SaaS Toolkits. The proposed Toolkit is based on java virtual machine and the popular web programming languages HTML and PHP. To evaluate the proposed Toolkit an empirical study has been conducted. The result of the empirical study revealed that the proposed Toolkit outperforms the current Toolkits in terms of complexity, understandability and learnability.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133902033","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 : 2016-03-02DOI: 10.18495/comengapp.v5i1.46
Sujata Swain, Chidananda Pratihary, P. Ray
It is well known that, a recursive relation for the sequence is an equation that relates to certain of its preceding terms . Initial conditions for the sequence are explicitly given values for a finite number of the terms of the sequence. The recurrence relation is useful in certain counting problems like Fibonacci numbers, Lucas numbers, balancing numbers, Lucas-balancing numbers etc. In this study, we use the recurrence relations for both balancing and Lucas-balancing numbers and examine their application to cryptography.
{"title":"Balancing and Lucas-Balancing Numbers and their Application to Cryptography","authors":"Sujata Swain, Chidananda Pratihary, P. Ray","doi":"10.18495/comengapp.v5i1.46","DOIUrl":"https://doi.org/10.18495/comengapp.v5i1.46","url":null,"abstract":"It is well known that, a recursive relation for the sequence is an equation that relates to certain of its preceding terms . Initial conditions for the sequence are explicitly given values for a finite number of the terms of the sequence. The recurrence relation is useful in certain counting problems like Fibonacci numbers, Lucas numbers, balancing numbers, Lucas-balancing numbers etc. In this study, we use the recurrence relations for both balancing and Lucas-balancing numbers and examine their application to cryptography.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131487431","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 : 2016-01-31DOI: 10.18495/COMENGAPP.V5I1.165
Ibrahim A. Alghamdi, D. A. Alshehri, A. Alghamdi, B. Kerim, R. Budiarto
The need of effective and efficient method to retrieving non-Web-enabled and Web-enabled information entities is essential, due to the fact of inaccuracy of the existing search engines that still use traditional term-based indexing for text documents and annotation text for images, audio and video files. Previous works showed that incorporating the knowledge in the form of concepts into an information retrieval system may increase the effectiveness of the retrieving method. Unfortunately, most of the works that implemented the concept-based information retrieval system still focused on one information format. This paper proposes a multi-format (text, image, video and, audio) concept-based information retrieval method for Cloud environment. The proposed method is implemented in a laboratory-scale heterogeneous cloud environment using Eucalyptus middleware. 755 multi-format information is experimented and the performance of the proposed method is measured.
{"title":"Cloud-Based Retrieval Information System Using Concept for Multi-Format Data","authors":"Ibrahim A. Alghamdi, D. A. Alshehri, A. Alghamdi, B. Kerim, R. Budiarto","doi":"10.18495/COMENGAPP.V5I1.165","DOIUrl":"https://doi.org/10.18495/COMENGAPP.V5I1.165","url":null,"abstract":"The need of effective and efficient method to retrieving non-Web-enabled and Web-enabled information entities is essential, due to the fact of inaccuracy of the existing search engines that still use traditional term-based indexing for text documents and annotation text for images, audio and video files. Previous works showed that incorporating the knowledge in the form of concepts into an information retrieval system may increase the effectiveness of the retrieving method. Unfortunately, most of the works that implemented the concept-based information retrieval system still focused on one information format. This paper proposes a multi-format (text, image, video and, audio) concept-based information retrieval method for Cloud environment. The proposed method is implemented in a laboratory-scale heterogeneous cloud environment using Eucalyptus middleware. 755 multi-format information is experimented and the performance of the proposed method is measured.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116347335","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 : 2016-01-31DOI: 10.18495/COMENGAPP.V5I1.160
L. Zahrotun
Text Mining is the excavations carried out by the computer to get something new that comes from information extracted automatically from data sources of different text. Clustering technique itself is a grouping technique that is widely used in data mining. The aim of this study was to find the most optimum value similarity. Jaccard similarity method used similarity, cosine similarity and a combination of Jaccard similarity and cosine similarity. By combining the two similarity is expected to increase the value of the similarity of the two titles. While the document is used only in the form of a title document of practical work in the Department of Informatics Engineering University of Ahmad Dahlan. All these articles have been through the process of preprocessing beforehand. And the method used is the method of document clustering with Shared Nearest Neighbor (SNN). Results from this study is the cosine similarity method gives the best value of proximity or similarity compared to Jaccard similarity and a combination of both
{"title":"Comparison Jaccard similarity, Cosine Similarity and Combined Both of the Data Clustering With Shared Nearest Neighbor Method","authors":"L. Zahrotun","doi":"10.18495/COMENGAPP.V5I1.160","DOIUrl":"https://doi.org/10.18495/COMENGAPP.V5I1.160","url":null,"abstract":"Text Mining is the excavations carried out by the computer to get something new that comes from information extracted automatically from data sources of different text. Clustering technique itself is a grouping technique that is widely used in data mining. The aim of this study was to find the most optimum value similarity. Jaccard similarity method used similarity, cosine similarity and a combination of Jaccard similarity and cosine similarity. By combining the two similarity is expected to increase the value of the similarity of the two titles. While the document is used only in the form of a title document of practical work in the Department of Informatics Engineering University of Ahmad Dahlan. All these articles have been through the process of preprocessing beforehand. And the method used is the method of document clustering with Shared Nearest Neighbor (SNN). Results from this study is the cosine similarity method gives the best value of proximity or similarity compared to Jaccard similarity and a combination of both","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125952969","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 : 2016-01-31DOI: 10.18495/COMENGAPP.V5I1.161
I. Riadi, Eddy Irawan Aristianto
The development of computer security technology is very rapidly. Web security is one of the areas that require particular attention related to the abundance of digital crimes conducted over the web. Unrestricted file upload image is a condition in the process of uploading pictures is not restricted. This can be used to make the attacker retrieve the information that is contained in a system. This research developed with several stages, such as, data collection, analysis of the current conditions, designing improvements to the program code, testing and implementation of the results of patch. Security testing is performed to find out the difference between before and after conditions applied patch unrestricted image file upload. Based on the results of testing done by the method of penetration testing results obtained before the application of patch unrestricted image file upload results respondents said 15% strongly disagree, 85% did not agree. Testing after applying patch unrestricted image file upload results respondents said 7.5% strongly agree, 92.5% agree, so it can be concluded that the development of the patch that has been done has been running smoothly as expected.
{"title":"An Analysis of Vulnerability Web Against Attack Unrestricted Image File Upload","authors":"I. Riadi, Eddy Irawan Aristianto","doi":"10.18495/COMENGAPP.V5I1.161","DOIUrl":"https://doi.org/10.18495/COMENGAPP.V5I1.161","url":null,"abstract":"The development of computer security technology is very rapidly. Web security is one of the areas that require particular attention related to the abundance of digital crimes conducted over the web. Unrestricted file upload image is a condition in the process of uploading pictures is not restricted. This can be used to make the attacker retrieve the information that is contained in a system. This research developed with several stages, such as, data collection, analysis of the current conditions, designing improvements to the program code, testing and implementation of the results of patch. Security testing is performed to find out the difference between before and after conditions applied patch unrestricted image file upload. Based on the results of testing done by the method of penetration testing results obtained before the application of patch unrestricted image file upload results respondents said 15% strongly disagree, 85% did not agree. Testing after applying patch unrestricted image file upload results respondents said 7.5% strongly agree, 92.5% agree, so it can be concluded that the development of the patch that has been done has been running smoothly as expected.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130715745","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 : 2016-01-31DOI: 10.18495/COMENGAPP.V5I1.162
Haodudin Nurkifli, M. Jajuli, Muhamad Miftah
The weakness of vigenere cipher lies in the short key and repeated periodically, allowing the key repeatedly with the same letter in the encryption process, it is used by cryptanalysis using kasiski method to guess the key length, after the length key is known guessing done plaintext by exhaustive key search so ciphertext of this algorithm can be solved. Modifications vigenere cipher is a solution to strengthen the ciphertext. Modifications made that useing looping random keys on algoritam vigenere cipher. The methodology used by quantitative method with a descriptive approach with nonparametric statistical test through a test mark. Testing was performed using six plaintext, three plaintext using Indonesian and English. The key for that used consists of five key in English and five keys in Indonesian. The test results showed that the method kasiski can not guess the key length of the algorithm viginere modified. At vigenere unmodified algorithm shows the difference in strength of the ciphertext, so the key length can be guessed by kasiski method. The test results showed signs sig is 0.00 and if Sig <0.05 or 0.00 <0.05, significant difference in the presence vigenere modification.
{"title":"Improving the reliability of Ciphertext on Vigenere Cipher Algorithm Using Recurrence Random Key","authors":"Haodudin Nurkifli, M. Jajuli, Muhamad Miftah","doi":"10.18495/COMENGAPP.V5I1.162","DOIUrl":"https://doi.org/10.18495/COMENGAPP.V5I1.162","url":null,"abstract":"The weakness of vigenere cipher lies in the short key and repeated periodically, allowing the key repeatedly with the same letter in the encryption process, it is used by cryptanalysis using kasiski method to guess the key length, after the length key is known guessing done plaintext by exhaustive key search so ciphertext of this algorithm can be solved. Modifications vigenere cipher is a solution to strengthen the ciphertext. Modifications made that useing looping random keys on algoritam vigenere cipher. The methodology used by quantitative method with a descriptive approach with nonparametric statistical test through a test mark. Testing was performed using six plaintext, three plaintext using Indonesian and English. The key for that used consists of five key in English and five keys in Indonesian. The test results showed that the method kasiski can not guess the key length of the algorithm viginere modified. At vigenere unmodified algorithm shows the difference in strength of the ciphertext, so the key length can be guessed by kasiski method. The test results showed signs sig is 0.00 and if Sig <0.05 or 0.00 <0.05, significant difference in the presence vigenere modification.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126897520","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 : 2015-11-20DOI: 10.18495/COMENGAPP.V4I3.145
Sarbast M. Rasheed
An interactive software package for analyzing and decomposing electromyographic (EMG) signals is designed, constructed, and implemented using the MATLAB high-level programming language and its interactive environment. EMG signal analysis in the form of signal decomposition into their constituent motor unit potential trains (MUPTs) is considered as a classification task. Matched template filter methods have been employed for the classification of motor unit potentials (MUPs) in which the assignment criterion used for MUPs is based on a combination of MUP shapes and motor unit firing pattern information. The developed software package consists of several graphical user interfaces used to detect individual MUP waveforms from raw EMG signals, extract relevant features, and classify MUPs into MUPTs using matched template filter classifiers. The proposed software package is useful for enhancing the analysis quality and providing a systematic approach to the EMG signal decomposition process. It also worked as a very helpful environment for testing and evaluating algorithms developed for EMG signal decomposition research.
{"title":"A MATLAB-Based Interactive Environment for EMG Signal Decomposition Utilizing Matched Template Filters","authors":"Sarbast M. Rasheed","doi":"10.18495/COMENGAPP.V4I3.145","DOIUrl":"https://doi.org/10.18495/COMENGAPP.V4I3.145","url":null,"abstract":"An interactive software package for analyzing and decomposing electromyographic (EMG) signals is designed, constructed, and implemented using the MATLAB high-level programming language and its interactive environment. EMG signal analysis in the form of signal decomposition into their constituent motor unit potential trains (MUPTs) is considered as a classification task. Matched template filter methods have been employed for the classification of motor unit potentials (MUPs) in which the assignment criterion used for MUPs is based on a combination of MUP shapes and motor unit firing pattern information. The developed software package consists of several graphical user interfaces used to detect individual MUP waveforms from raw EMG signals, extract relevant features, and classify MUPs into MUPTs using matched template filter classifiers. The proposed software package is useful for enhancing the analysis quality and providing a systematic approach to the EMG signal decomposition process. It also worked as a very helpful environment for testing and evaluating algorithms developed for EMG signal decomposition research.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129956561","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 : 2015-09-20DOI: 10.18495/COMENGAPP.V4I3.152
M. Khurram
A beneficial product of Smart Irrigation for Agricultural Area of Pakistan has been presented in this paper. Pakistan stands in need of a participatory solution that is efficiently workable, sustainable, and profitable, to develop the way for the agricultural sector by improving crop productivity with minimum water loss. The goal of this project is to introduce Cloud support to the Smart Irrigation System for Agricultural Area of Pakistan. To achieve this objective Wireless Sensor Network (WSN) is used to determine how much water to apply and when to irrigate. The system is divided into four main modules, i.e. Sensor node, Coordinator node, Server Module and Web Application. On the basis of acquired parameters from the WSN, the software application is programmed to take intelligent decisions increase the efficiency of the agricultural system.
{"title":"Cloud based Smart Irrigation for Agricultural Area of Pakistan","authors":"M. Khurram","doi":"10.18495/COMENGAPP.V4I3.152","DOIUrl":"https://doi.org/10.18495/COMENGAPP.V4I3.152","url":null,"abstract":"A beneficial product of Smart Irrigation for Agricultural Area of Pakistan has been presented in this paper. Pakistan stands in need of a participatory solution that is efficiently workable, sustainable, and profitable, to develop the way for the agricultural sector by improving crop productivity with minimum water loss. The goal of this project is to introduce Cloud support to the Smart Irrigation System for Agricultural Area of Pakistan. To achieve this objective Wireless Sensor Network (WSN) is used to determine how much water to apply and when to irrigate. The system is divided into four main modules, i.e. Sensor node, Coordinator node, Server Module and Web Application. On the basis of acquired parameters from the WSN, the software application is programmed to take intelligent decisions increase the efficiency of the agricultural system.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124206753","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 : 2015-09-20DOI: 10.18495/COMENGAPP.V4I3.150
Sajad Homayoun, Ahmad Jalili, M. Keshtgari
Server virtualization is considered as one of the most significant changes in IT operations in the past decade, making it possible to manage groups of servers with a greater degree of reliability at a lower cost. It is driven by the goal of reducing the total number of physical servers in an organization by consolidating multiple applications on shared servers. In this paper we construct several x86_64 servers based on VMware vSphere, and then analyze their performances using open source analyzing tools Pylot and Curl-loader. The results show that despite the enormous potential benefits of virtualization techniques, the efficiency decreased by increasing the number of virtual machines. So, a trade-off is needed between number of virtual machines and expected efficiency of servers.
{"title":"Performance Analysis of Multiple Virtualized Servers","authors":"Sajad Homayoun, Ahmad Jalili, M. Keshtgari","doi":"10.18495/COMENGAPP.V4I3.150","DOIUrl":"https://doi.org/10.18495/COMENGAPP.V4I3.150","url":null,"abstract":"Server virtualization is considered as one of the most significant changes in IT operations in the past decade, making it possible to manage groups of servers with a greater degree of reliability at a lower cost. It is driven by the goal of reducing the total number of physical servers in an organization by consolidating multiple applications on shared servers. In this paper we construct several x86_64 servers based on VMware vSphere, and then analyze their performances using open source analyzing tools Pylot and Curl-loader. The results show that despite the enormous potential benefits of virtualization techniques, the efficiency decreased by increasing the number of virtual machines. So, a trade-off is needed between number of virtual machines and expected efficiency of servers.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"153 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120989691","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
扫码关注我们
求助内容：
应助结果提醒方式：