Pub Date : 2014-05-15DOI: 10.1109/ICADIWT.2014.6814671
A. Anasuya Threse Innocent, K. Sangeeta
Introduced by Yao in early 1980s, secure computation is being one among the major area of research interest among cryptologists. In three decades of its growth, secure computation which can be called as two-party computation, or multiparty computation depending on the number of parties involved has experienced vast diversities. Research has been carried out by exploiting specific properties of functionalities and generic approach to achieve efficient practical secure computation protocols. This paper compares the above two approaches for secure two-party computation of AES-128.
{"title":"Secure two-party computation with AES-128: Generic approach and exploiting specific properties of functions approach","authors":"A. Anasuya Threse Innocent, K. Sangeeta","doi":"10.1109/ICADIWT.2014.6814671","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814671","url":null,"abstract":"Introduced by Yao in early 1980s, secure computation is being one among the major area of research interest among cryptologists. In three decades of its growth, secure computation which can be called as two-party computation, or multiparty computation depending on the number of parties involved has experienced vast diversities. Research has been carried out by exploiting specific properties of functionalities and generic approach to achieve efficient practical secure computation protocols. This paper compares the above two approaches for secure two-party computation of AES-128.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125385275","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 : 2014-05-15DOI: 10.1109/ICADIWT.2014.6814696
V. K. Sree, P. S. Rao
Automated fundus image analysis plays an important role in the computer aided diagnosis of ophthalmologic disorders. A lot of eye disorders, as well as cardiovascular disorders, are known to be related with retinal vasculature changes. Many important eye diseases as well as systemic diseases manifest themselves in the retina. While a number of other anatomical structures contribute to the process of vision, this paper focuses on retinal image analysis and their clinical implications. The most prevalent causes of blindness in the industrialized world are age-related macular degeneration, diabetic retinopathy, and glaucoma. Retinal exudates are among the preliminary signs of diabetic retinopathy, a major cause of vision loss in diabetic patients. Correct and efficient screening of exudates is very expensive in professional time and may cause human error. Nowadays, the digital retinal image is frequently used to follow-up and diagnoses eye diseases. Therefore, the retinal image is crucial and essential for experts to detect exudates. In age related Macular degeneration, the macula is responsible for the sharp central vision needed for detailed activities such as reading, writing, driving, face recognition and ability to see colors. Age related macular degeneration is degeneration of the macula area and the delicate cells of the macula become inactive and stop working. Unfortunately, age-related macular degeneration cannot be completely cured, but if diagnosed at an early stage degeneration laser treatment can help some people to prevent further deterioration of macula. The algorithm locates disease affected pixels on macula and displays their location. After pre-processing particle analysis tool is applied to locate the effected parts on the fundus image.
{"title":"Diagnosis of ophthalmologic disordersin retinal fundus images","authors":"V. K. Sree, P. S. Rao","doi":"10.1109/ICADIWT.2014.6814696","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814696","url":null,"abstract":"Automated fundus image analysis plays an important role in the computer aided diagnosis of ophthalmologic disorders. A lot of eye disorders, as well as cardiovascular disorders, are known to be related with retinal vasculature changes. Many important eye diseases as well as systemic diseases manifest themselves in the retina. While a number of other anatomical structures contribute to the process of vision, this paper focuses on retinal image analysis and their clinical implications. The most prevalent causes of blindness in the industrialized world are age-related macular degeneration, diabetic retinopathy, and glaucoma. Retinal exudates are among the preliminary signs of diabetic retinopathy, a major cause of vision loss in diabetic patients. Correct and efficient screening of exudates is very expensive in professional time and may cause human error. Nowadays, the digital retinal image is frequently used to follow-up and diagnoses eye diseases. Therefore, the retinal image is crucial and essential for experts to detect exudates. In age related Macular degeneration, the macula is responsible for the sharp central vision needed for detailed activities such as reading, writing, driving, face recognition and ability to see colors. Age related macular degeneration is degeneration of the macula area and the delicate cells of the macula become inactive and stop working. Unfortunately, age-related macular degeneration cannot be completely cured, but if diagnosed at an early stage degeneration laser treatment can help some people to prevent further deterioration of macula. The algorithm locates disease affected pixels on macula and displays their location. After pre-processing particle analysis tool is applied to locate the effected parts on the fundus image.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122896800","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 : 2014-05-15DOI: 10.1109/ICADIWT.2014.6814662
Mingming Sun, Xuehai Zhou, Feng Yang, Kun Lu, Dong Dai
The recent next-generation sequencing machines generate sequences at an unprecedented rate, and a sequence is not short any more called read. The reference sequences which are aligned reads against are also increasingly large. Efficiently mapping large number of long sequences with big reference sequences poses a new challenge to sequence alignment. Sequence alignment algorithms become to match on two big data. To address the above problem, we propose a new parallel sequence alignment algorithm called Bwasw-Cloud, optimized for aligning long reads against a large sequence data (e.g. the human genome). It is modeled after the widely used BWA-SW algorithm and uses the open-source Hadoop implementation of MapReduce. The results show that Bwasw-Cloud can effectively and quickly match two big data in common cluster.
{"title":"Bwasw-Cloud: Efficient sequence alignment algorithm for two big data with MapReduce","authors":"Mingming Sun, Xuehai Zhou, Feng Yang, Kun Lu, Dong Dai","doi":"10.1109/ICADIWT.2014.6814662","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814662","url":null,"abstract":"The recent next-generation sequencing machines generate sequences at an unprecedented rate, and a sequence is not short any more called read. The reference sequences which are aligned reads against are also increasingly large. Efficiently mapping large number of long sequences with big reference sequences poses a new challenge to sequence alignment. Sequence alignment algorithms become to match on two big data. To address the above problem, we propose a new parallel sequence alignment algorithm called Bwasw-Cloud, optimized for aligning long reads against a large sequence data (e.g. the human genome). It is modeled after the widely used BWA-SW algorithm and uses the open-source Hadoop implementation of MapReduce. The results show that Bwasw-Cloud can effectively and quickly match two big data in common cluster.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128634102","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 : 2014-05-15DOI: 10.1109/ICADIWT.2014.6814669
V. Rao, M. Tahiliani, Udaya Kumar K. Shenoy
The availability of cheaper and high capacity Random Access Memory (RAM) has resulted in the growth of buffer size in all the computing devices. This aberrant increase of buffer capacity in network devices has resulted into high latency, leading to reduced throughput; thus decreasing the tendency of absorbing spontaneous burst of traffic. The requirement for Active Queue Management (AQM) has been evident for decades. These solutions require various parameter configuration and are dependent on a particular network condition to work efficiently. Hence an algorithm which is simple, efficient, does not require setting of parameters and works seamlessly irrespective of the network condition is required. Even though Controlled Delay (CoDel) is parameterless and adapts to dynamically changing link rates with no negative impact on utilization, it deviates from its primary purpose of reducing congestion when there is an increase in RTT and when congestion level varies abruptly. As a consequence, a variant of CoDel called Stochastic Fair Queue CoDel (sfqCoDel) is simulated and compared. The Stochastic Fair Queue CoDel proactively drops packets which occupy reasonably larger bandwidth as compared to CoDel, which proactively drops packet irrespective of the bandwidth consumption by packets. This paper aims to perform a comprehensive analysis of Stochastic Fair Queue CoDel for Active Queue Management. A comparison is also carried out between sfqCoDel with CoDel. The sfqCoDel appears to be much better than CoDel in certain areas where CoDel fails to perform well.
{"title":"Analysis of sfqCoDel for Active Queue Management","authors":"V. Rao, M. Tahiliani, Udaya Kumar K. Shenoy","doi":"10.1109/ICADIWT.2014.6814669","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814669","url":null,"abstract":"The availability of cheaper and high capacity Random Access Memory (RAM) has resulted in the growth of buffer size in all the computing devices. This aberrant increase of buffer capacity in network devices has resulted into high latency, leading to reduced throughput; thus decreasing the tendency of absorbing spontaneous burst of traffic. The requirement for Active Queue Management (AQM) has been evident for decades. These solutions require various parameter configuration and are dependent on a particular network condition to work efficiently. Hence an algorithm which is simple, efficient, does not require setting of parameters and works seamlessly irrespective of the network condition is required. Even though Controlled Delay (CoDel) is parameterless and adapts to dynamically changing link rates with no negative impact on utilization, it deviates from its primary purpose of reducing congestion when there is an increase in RTT and when congestion level varies abruptly. As a consequence, a variant of CoDel called Stochastic Fair Queue CoDel (sfqCoDel) is simulated and compared. The Stochastic Fair Queue CoDel proactively drops packets which occupy reasonably larger bandwidth as compared to CoDel, which proactively drops packet irrespective of the bandwidth consumption by packets. This paper aims to perform a comprehensive analysis of Stochastic Fair Queue CoDel for Active Queue Management. A comparison is also carried out between sfqCoDel with CoDel. The sfqCoDel appears to be much better than CoDel in certain areas where CoDel fails to perform well.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117123631","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 : 2014-05-15DOI: 10.1109/ICADIWT.2014.6814690
Ricardo Contreras Arriagada, K. Mahbub
Existing approaches for monitoring Service-based Systems assume monitor rules are pre-defined and known in advance. Furthermore, in most of the cases, monitor rules are associated to a set of actions, triggered by the deviations from the expected behaviour, to compensate for an unexpected conduct. Such a reactive strategy, based on pre-defined rules, is not really suitable in dynamic systems where the time require to perform a modification is critical. In this work, we present MORPED, a framework for run-time monitoring and adaptation of Service-based Systems that supports i) the automatic generation of user context-based monitor rules, capable of predicting forthcoming deviations in the system with respect to the user context and ii) the adaptation of the system, based on a proactive service discovery, to compensate the foreseen deviations.
{"title":"MORPED: Monitor rules for proactive error detection based on run-time and historical data","authors":"Ricardo Contreras Arriagada, K. Mahbub","doi":"10.1109/ICADIWT.2014.6814690","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814690","url":null,"abstract":"Existing approaches for monitoring Service-based Systems assume monitor rules are pre-defined and known in advance. Furthermore, in most of the cases, monitor rules are associated to a set of actions, triggered by the deviations from the expected behaviour, to compensate for an unexpected conduct. Such a reactive strategy, based on pre-defined rules, is not really suitable in dynamic systems where the time require to perform a modification is critical. In this work, we present MORPED, a framework for run-time monitoring and adaptation of Service-based Systems that supports i) the automatic generation of user context-based monitor rules, capable of predicting forthcoming deviations in the system with respect to the user context and ii) the adaptation of the system, based on a proactive service discovery, to compensate the foreseen deviations.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134325676","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 : 2014-05-15DOI: 10.1109/ICADIWT.2014.6814674
S. Varma, M. Sreeraj
Detection of Objects in Video is a highly demanding area of research. The Background Subtraction Algorithms can yield better results in Foreground Object Detection. This work presents a Hybrid CodeBook based Background Subtraction to extract the foreground ROI from the background. Codebooks are used to store compressed information by demanding lesser memory usage and high speedy processing. This Hybrid method which uses Block-Based and Pixel-Based Codebooks provide efficient detection results; the high speed processing capability of block based background subtraction as well as high Precision Rate of pixel based background subtraction are exploited to yield an efficient Background Subtraction System. The Block stage produces a coarse foreground area, which is then refined by the Pixel stage. The system's performance is evaluated with different block sizes and with different block descriptors like 2D-DCT, FFT etc. The Experimental analysis based on statistical measurements yields precision, recall, similarity and F measure of the hybrid system as 88.74%, 91.09%, 81.66% and 89.90% respectively, and thus proves the efficiency of the novel system.
{"title":"Hybrid Background Subtraction in video using Bi-level CodeBook model","authors":"S. Varma, M. Sreeraj","doi":"10.1109/ICADIWT.2014.6814674","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814674","url":null,"abstract":"Detection of Objects in Video is a highly demanding area of research. The Background Subtraction Algorithms can yield better results in Foreground Object Detection. This work presents a Hybrid CodeBook based Background Subtraction to extract the foreground ROI from the background. Codebooks are used to store compressed information by demanding lesser memory usage and high speedy processing. This Hybrid method which uses Block-Based and Pixel-Based Codebooks provide efficient detection results; the high speed processing capability of block based background subtraction as well as high Precision Rate of pixel based background subtraction are exploited to yield an efficient Background Subtraction System. The Block stage produces a coarse foreground area, which is then refined by the Pixel stage. The system's performance is evaluated with different block sizes and with different block descriptors like 2D-DCT, FFT etc. The Experimental analysis based on statistical measurements yields precision, recall, similarity and F measure of the hybrid system as 88.74%, 91.09%, 81.66% and 89.90% respectively, and thus proves the efficiency of the novel system.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":" 15","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132095888","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 : 2014-05-15DOI: 10.1109/ICADIWT.2014.6814681
K. Parthiban, A. Wahi, S. Sundaramurthy, C. Palanisamy
In present days, Authentication by means of biometrics systems is used for personal verifications. In spite of having existing technology in biometrics such as recognizing the fingerprints, voice/face recognition etc., the vein patterns can be used for the personal identification. Finger vein is a promising biometric pattern for personal identification and authentication in terms of its security and convenience. Finger vein has gained much attention among researchers to combine accuracy, universality and cost efficiency. We propose a method of personal identification based on finger-vein patterns. An image of a finger captured under infrared light contains not only the vein pattern but also irregular shading produced by the various thicknesses of the finger bones and muscles. The proposed method extracts the finger-vein pattern from the unclear image by using gradient feature extraction algorithm and the template matching by Euclidean distance algorithm. The better vein pattern algorithm has to be introduced to achieve the better Equal Error Rate (EER) of 0.05% comparing to the existing vein pattern recognition algorithms.
{"title":"Finger vein extraction and authentication based on gradient feature selection algorithm","authors":"K. Parthiban, A. Wahi, S. Sundaramurthy, C. Palanisamy","doi":"10.1109/ICADIWT.2014.6814681","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814681","url":null,"abstract":"In present days, Authentication by means of biometrics systems is used for personal verifications. In spite of having existing technology in biometrics such as recognizing the fingerprints, voice/face recognition etc., the vein patterns can be used for the personal identification. Finger vein is a promising biometric pattern for personal identification and authentication in terms of its security and convenience. Finger vein has gained much attention among researchers to combine accuracy, universality and cost efficiency. We propose a method of personal identification based on finger-vein patterns. An image of a finger captured under infrared light contains not only the vein pattern but also irregular shading produced by the various thicknesses of the finger bones and muscles. The proposed method extracts the finger-vein pattern from the unclear image by using gradient feature extraction algorithm and the template matching by Euclidean distance algorithm. The better vein pattern algorithm has to be introduced to achieve the better Equal Error Rate (EER) of 0.05% comparing to the existing vein pattern recognition algorithms.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129600662","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 : 2014-05-15DOI: 10.1109/ICADIWT.2014.6814682
Chayadevi M L, Raju G T
Medical image analysis is very challenging due to idiosyncrasies of medical profession. Object recognition with data mining techniques has helped doctors in case of medical emergencies for the image analysis, pattern identification and treatment. Over 180 million people died and more than one third of the population is carrier of Mycobacterium Tuberculosis (TB) bacteria as per the WHO statistics [1-5]. Segmentation of TB from the stained background is very challenging due to noise and debris in the image. In this paper, an automated segmentation of tuberculosis bacterium using image processing techniques is presented. Colour segmentation with region growing watershed algorithm is proposed for the bacterial identification.
{"title":"Automated colour segmentation of Tuberculosis bacteria thru region growing: A novel approach","authors":"Chayadevi M L, Raju G T","doi":"10.1109/ICADIWT.2014.6814682","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814682","url":null,"abstract":"Medical image analysis is very challenging due to idiosyncrasies of medical profession. Object recognition with data mining techniques has helped doctors in case of medical emergencies for the image analysis, pattern identification and treatment. Over 180 million people died and more than one third of the population is carrier of Mycobacterium Tuberculosis (TB) bacteria as per the WHO statistics [1-5]. Segmentation of TB from the stained background is very challenging due to noise and debris in the image. In this paper, an automated segmentation of tuberculosis bacterium using image processing techniques is presented. Colour segmentation with region growing watershed algorithm is proposed for the bacterial identification.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115280173","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 : 2014-05-15DOI: 10.1109/ICADIWT.2014.6814701
Zongwei Zhu, Beilei Sun, Xi Li, Xuehai Zhou
Modern multi-core processors propose new cache management challenges (more cache conflicts and misses) due to the subtle interactions of simultaneously executing processes sharing on-chip resources. To address this issue, thread group scheduling scheme that cluster threads with high sharing cache as one group to schedule has been proposed. It has led to numerous academic and industrial attentions. However, by analyzing the programming model of Android which account for a large and increasing fraction of operating system of multi-core smart phones, we find it may be unacceptable for numerous interactive applications since previous scheduling works may cause the terrible response time and directly bring an awful user experience. In order to reduce cache competitions while improving application's response time, we present an application-aware group scheduler (AGS) whose key idea is to adopt a thread group scheduling scheme to partition current running application's threads into one group and give each thread a fair chance to occupy CPU time. We implement AGS on practical hardware running a real Android operating system. The results show that our proposed scheduler can improve performance from different parameters while keeping system fairness, which reduces 3.2% in cache miss rate, 5.5% in response time, 5.3% in data cache (D-Cache) misses and 2.5% in instruction cache (I-Cache) misses to the maximum extent.
{"title":"Application-aware group scheduler for Android","authors":"Zongwei Zhu, Beilei Sun, Xi Li, Xuehai Zhou","doi":"10.1109/ICADIWT.2014.6814701","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814701","url":null,"abstract":"Modern multi-core processors propose new cache management challenges (more cache conflicts and misses) due to the subtle interactions of simultaneously executing processes sharing on-chip resources. To address this issue, thread group scheduling scheme that cluster threads with high sharing cache as one group to schedule has been proposed. It has led to numerous academic and industrial attentions. However, by analyzing the programming model of Android which account for a large and increasing fraction of operating system of multi-core smart phones, we find it may be unacceptable for numerous interactive applications since previous scheduling works may cause the terrible response time and directly bring an awful user experience. In order to reduce cache competitions while improving application's response time, we present an application-aware group scheduler (AGS) whose key idea is to adopt a thread group scheduling scheme to partition current running application's threads into one group and give each thread a fair chance to occupy CPU time. We implement AGS on practical hardware running a real Android operating system. The results show that our proposed scheduler can improve performance from different parameters while keeping system fairness, which reduces 3.2% in cache miss rate, 5.5% in response time, 5.3% in data cache (D-Cache) misses and 2.5% in instruction cache (I-Cache) misses to the maximum extent.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":"25 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125676823","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 : 2014-05-15DOI: 10.1109/ICADIWT.2014.6814667
K. Srinivasa, S. Srinidhi, K. Kumar, Vignesh Shenvi, U. S. Kaushik, Kushagra Mishra
Considering the proliferation in the number of cloud users on an everyday basis, the task of resource provisioning in order to support all these users becomes a challenging problem. When resource allocation is non-optimal, users may face high costs or performance issues. So, in order to maximize profit and resource utilization while satisfying all client requests, it is essential for Cloud Service Providers to come up with ways to allocate resources adaptively for diverse conditions. This is a constrained optimization problem. Each client that submits a request to the cloud has its own best interests in mind. But each of these clients competes with other clients in the quest to obtain required quantum of resources. Hence, every client is a participant in this competition. So, a preliminary analysis of the problem reveals that it can be modelled as a game between clients. A game theoretic modelling of this problem provides us an ability to find an optimal resource allocation by employing game theoretic concepts. Resource allocation problems are NP-Hard, involving VM allocation and migration within and possibly, among data centres. Owing to the dynamic nature and number of requests, static methods fail to surmount race conditions. Using a Min-Max Game approach, we propose an algorithm that can overcome the problems mentioned. We propose to employ a utility maximization approach to solve the resource provisioning and allocation problem. We implement a new factor into the game called the utility factor which considers the time and budget constraints of every user. Resources are provisioned for tasks having the highest utility for the corresponding resource.
{"title":"Game theoretic resource allocation in cloud computing","authors":"K. Srinivasa, S. Srinidhi, K. Kumar, Vignesh Shenvi, U. S. Kaushik, Kushagra Mishra","doi":"10.1109/ICADIWT.2014.6814667","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814667","url":null,"abstract":"Considering the proliferation in the number of cloud users on an everyday basis, the task of resource provisioning in order to support all these users becomes a challenging problem. When resource allocation is non-optimal, users may face high costs or performance issues. So, in order to maximize profit and resource utilization while satisfying all client requests, it is essential for Cloud Service Providers to come up with ways to allocate resources adaptively for diverse conditions. This is a constrained optimization problem. Each client that submits a request to the cloud has its own best interests in mind. But each of these clients competes with other clients in the quest to obtain required quantum of resources. Hence, every client is a participant in this competition. So, a preliminary analysis of the problem reveals that it can be modelled as a game between clients. A game theoretic modelling of this problem provides us an ability to find an optimal resource allocation by employing game theoretic concepts. Resource allocation problems are NP-Hard, involving VM allocation and migration within and possibly, among data centres. Owing to the dynamic nature and number of requests, static methods fail to surmount race conditions. Using a Min-Max Game approach, we propose an algorithm that can overcome the problems mentioned. We propose to employ a utility maximization approach to solve the resource provisioning and allocation problem. We implement a new factor into the game called the utility factor which considers the time and budget constraints of every user. Resources are provisioned for tasks having the highest utility for the corresponding resource.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":"158 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113998744","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
扫码关注我们
求助内容：
应助结果提醒方式：