Pub Date : 2014-12-01DOI: 10.1109/PDGC.2014.7030782
Behnish Mann, Alex Arvavid
Distributed systems offer many features such as resource sharing, scalability, fault tolerance and reliability. Several distributed algorithms have been proposed in literature to solve fundamental problems such as mutual exclusion and leader election in distributed systems. When more than one algorithm is invented to solve the same problem particularly in asynchronous distributed systems, their performance is compared mostly based on the message complexity. This paper reviews the concept of message complexity and offers more clarity by studying the performance of the two most popular distributed algorithms - Ricart-Agrawala's algorithm and Raymond algorithm designed to solve the mutual exclusion problem. The paper has four main contributions (i) observes how the message complexity is understood and computed in the asynchronous distributed system so far and exposes its elusiveness; (ii) offers a more suitable definition of message complexity; (iii) briefly presents the simulator designed to study the performance of the distributed algorithms using the refined metric; and finally (iv) discusses about the simulation study to illustrate the significance and usefulness of the proposed metric.
{"title":"Message complexity of distributed algorithms revisited","authors":"Behnish Mann, Alex Arvavid","doi":"10.1109/PDGC.2014.7030782","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030782","url":null,"abstract":"Distributed systems offer many features such as resource sharing, scalability, fault tolerance and reliability. Several distributed algorithms have been proposed in literature to solve fundamental problems such as mutual exclusion and leader election in distributed systems. When more than one algorithm is invented to solve the same problem particularly in asynchronous distributed systems, their performance is compared mostly based on the message complexity. This paper reviews the concept of message complexity and offers more clarity by studying the performance of the two most popular distributed algorithms - Ricart-Agrawala's algorithm and Raymond algorithm designed to solve the mutual exclusion problem. The paper has four main contributions (i) observes how the message complexity is understood and computed in the asynchronous distributed system so far and exposes its elusiveness; (ii) offers a more suitable definition of message complexity; (iii) briefly presents the simulator designed to study the performance of the distributed algorithms using the refined metric; and finally (iv) discusses about the simulation study to illustrate the significance and usefulness of the proposed metric.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122874098","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-12-01DOI: 10.1109/PDGC.2014.7030713
Faizul Navi Khan, K. Govil, A. Agarwal
Technology enhancement makes the computing available everywhere and provides access to widely distributed resources which is known as Mobile Computing. Mobile computing enables innovative applications through the sharing of computing resources among mobile devices such as notebook, smart phones and Personal Digital Assistant (PDAs) without any pre-existing infrastructure. Mobile computing includes a number of technologies and devices. The state of the user, static or mobile, does not affect the information management capability of the mobile platform. A user can continue to access and perform data manipulation during the state of mobility by using mobile computing devices. Delivering data packets between pair of processors is a primary responsibility of any mobile computing network. This activity is performed using a routing strategy. Maximize reliability of the data packets always a major concern while transmitting the data from one point to another point. In mobile computing it is the process of determining the data path through the network that data packets will move from the one computing device to another computing device. Routing strategy for data transmission is an important factor for achieving high degree of reliability. Multiple data packets are move within a network from source to destination in order to execute on available processing units with the objective of getting maximum reliability of data packets. This research paper present a routing strategy to achieve maximum data packets transmission reliability in mobile computing network during the data transmission.
{"title":"Reliability based routing strategy for performance optimization in distributed mobile computing through clustering","authors":"Faizul Navi Khan, K. Govil, A. Agarwal","doi":"10.1109/PDGC.2014.7030713","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030713","url":null,"abstract":"Technology enhancement makes the computing available everywhere and provides access to widely distributed resources which is known as Mobile Computing. Mobile computing enables innovative applications through the sharing of computing resources among mobile devices such as notebook, smart phones and Personal Digital Assistant (PDAs) without any pre-existing infrastructure. Mobile computing includes a number of technologies and devices. The state of the user, static or mobile, does not affect the information management capability of the mobile platform. A user can continue to access and perform data manipulation during the state of mobility by using mobile computing devices. Delivering data packets between pair of processors is a primary responsibility of any mobile computing network. This activity is performed using a routing strategy. Maximize reliability of the data packets always a major concern while transmitting the data from one point to another point. In mobile computing it is the process of determining the data path through the network that data packets will move from the one computing device to another computing device. Routing strategy for data transmission is an important factor for achieving high degree of reliability. Multiple data packets are move within a network from source to destination in order to execute on available processing units with the objective of getting maximum reliability of data packets. This research paper present a routing strategy to achieve maximum data packets transmission reliability in mobile computing network during the data transmission.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131506389","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-12-01DOI: 10.1109/PDGC.2014.7030766
Nidhi Thakur, Sanjay Kumar, V. Patle
In the present work, we apply sequential search in serial and parallel domain and compare searching time in both the cases. In parallel domain we make use of two and four cores with two and four threads. Comparison is done on the parameters like speedup, efficiency and performance improvement. We have used OpenMP for implementing multithreading concept on multicore.
{"title":"Comparison of serial and parallel searching in multicore systems","authors":"Nidhi Thakur, Sanjay Kumar, V. Patle","doi":"10.1109/PDGC.2014.7030766","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030766","url":null,"abstract":"In the present work, we apply sequential search in serial and parallel domain and compare searching time in both the cases. In parallel domain we make use of two and four cores with two and four threads. Comparison is done on the parameters like speedup, efficiency and performance improvement. We have used OpenMP for implementing multithreading concept on multicore.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131959161","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-12-01DOI: 10.1109/PDGC.2014.7030745
P. Swami, A. K. Godiyal, J. Santhosh, B. K. Panigrahi, M. Bhatia, S. Anand
The classification of normal and ailing brain activities through visual inspection proves to be very challenging even for any experienced neurologist. The case is even worse for detection of heterogeneous anomalies like epileptic seizures. Authors have presented robust expert system design for classification of epileptic seizures automatically with an improvement over the existing systems. The developed scheme illustrates selection methodology for feeding energy, entropy and standard deviation feature sets to the support vector classifier. The results display maximum classification rate of 99.53 % with sensitivity and specificity rates above 98.8 %. These results were validated over 10 folds of sub-divisions using rotation estimation technique with minimum computation time noted to be 0.0131 s. Therefore, the expert system developed during this study holds promising grounds for automated clinical diagnosis in real time.
{"title":"Robust expert system design for automated detection of epileptic seizures using SVM classifier","authors":"P. Swami, A. K. Godiyal, J. Santhosh, B. K. Panigrahi, M. Bhatia, S. Anand","doi":"10.1109/PDGC.2014.7030745","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030745","url":null,"abstract":"The classification of normal and ailing brain activities through visual inspection proves to be very challenging even for any experienced neurologist. The case is even worse for detection of heterogeneous anomalies like epileptic seizures. Authors have presented robust expert system design for classification of epileptic seizures automatically with an improvement over the existing systems. The developed scheme illustrates selection methodology for feeding energy, entropy and standard deviation feature sets to the support vector classifier. The results display maximum classification rate of 99.53 % with sensitivity and specificity rates above 98.8 %. These results were validated over 10 folds of sub-divisions using rotation estimation technique with minimum computation time noted to be 0.0131 s. Therefore, the expert system developed during this study holds promising grounds for automated clinical diagnosis in real time.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130572140","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-12-01DOI: 10.1109/PDGC.2014.7030770
S. Bansal, Kaushal Bansal, R. Bansal
In the recent past, heterogeneous computing has gained popularity over the traditional homogeneous computing. Moreover, the upcoming processors are typically equipped with dynamic voltage and frequency scaling options to reduce energy consumption as per the application requirements. Scheduling plays a vital role for efficient parallel computing systems, and in this work, the relationship among heterogeneity, make-span and energy consumption has been explored through simulations for heterogeneous processing systems. Heterogeneity is found to adversely affect the total energy consumption in comparison to the extent of makespan improvement.
{"title":"Energy consumption on heterogeneous computing platforms","authors":"S. Bansal, Kaushal Bansal, R. Bansal","doi":"10.1109/PDGC.2014.7030770","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030770","url":null,"abstract":"In the recent past, heterogeneous computing has gained popularity over the traditional homogeneous computing. Moreover, the upcoming processors are typically equipped with dynamic voltage and frequency scaling options to reduce energy consumption as per the application requirements. Scheduling plays a vital role for efficient parallel computing systems, and in this work, the relationship among heterogeneity, make-span and energy consumption has been explored through simulations for heterogeneous processing systems. Heterogeneity is found to adversely affect the total energy consumption in comparison to the extent of makespan improvement.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124408990","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-12-01DOI: 10.1109/PDGC.2014.7030779
Ifra Bilal, Mahendra Singh Roj, Rajiv Kumar, P. K. Mishra
Communication of data in public requires data to be transmitted in robust and secure manner. Also, excessive use of digital data in various fields of life demands a secure system. Various techniques such as cryptography, steganography and watermarking have been established. Among these steganography provides better confidentiality as it is the practice of hiding data within data. In digital media steganography, text files, images, audio as well as video are used as carrier. We focus in this paper on digital audio as the carrier. In this paper, a survey on latest audio steganographic methods is carried out along with their strength and weakness. Also, comparison between various steganographic methods based on robustness is carried out. Another contribution of this paper is evaluation of performance of various reviewed steganography techniques.
{"title":"Recent advancement in audio steganography","authors":"Ifra Bilal, Mahendra Singh Roj, Rajiv Kumar, P. K. Mishra","doi":"10.1109/PDGC.2014.7030779","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030779","url":null,"abstract":"Communication of data in public requires data to be transmitted in robust and secure manner. Also, excessive use of digital data in various fields of life demands a secure system. Various techniques such as cryptography, steganography and watermarking have been established. Among these steganography provides better confidentiality as it is the practice of hiding data within data. In digital media steganography, text files, images, audio as well as video are used as carrier. We focus in this paper on digital audio as the carrier. In this paper, a survey on latest audio steganographic methods is carried out along with their strength and weakness. Also, comparison between various steganographic methods based on robustness is carried out. Another contribution of this paper is evaluation of performance of various reviewed steganography techniques.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115023502","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-12-01DOI: 10.1109/PDGC.2014.7030760
A. Vaish, M. Kumar
Principal component analysis (PCA) is one of the most widely used techniques for dimension reduction. It exploits the dependencies among the variables and represents the higher dimensional data in the lower dimensional with more amenable form, without losing a countable information. In this paper, we present a new image compression technique that uses PCA and Huffman coding. The input image is first compressed by using PCA, few of the principal components (PCs) are used to reconstruct the image, while the other less significant PCs are ignored. The reconstructed image is further quantized with dither to reduce contouring, occurred due to less number of PCs are used in image reconstruction. Finally, the Huffman coding is applied on quantized image to remove coding redundancy. The proposed image compression technique is applied on several test images and results are compared with JPEG2000. Comparative analysis and visual results clearly show that the proposed technique performs better than the JPEG2000.
{"title":"A new Image compression technique using principal component analysis and Huffman coding","authors":"A. Vaish, M. Kumar","doi":"10.1109/PDGC.2014.7030760","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030760","url":null,"abstract":"Principal component analysis (PCA) is one of the most widely used techniques for dimension reduction. It exploits the dependencies among the variables and represents the higher dimensional data in the lower dimensional with more amenable form, without losing a countable information. In this paper, we present a new image compression technique that uses PCA and Huffman coding. The input image is first compressed by using PCA, few of the principal components (PCs) are used to reconstruct the image, while the other less significant PCs are ignored. The reconstructed image is further quantized with dither to reduce contouring, occurred due to less number of PCs are used in image reconstruction. Finally, the Huffman coding is applied on quantized image to remove coding redundancy. The proposed image compression technique is applied on several test images and results are compared with JPEG2000. Comparative analysis and visual results clearly show that the proposed technique performs better than the JPEG2000.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133248440","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
扫码关注我们
求助内容：
应助结果提醒方式：