Pub Date : 2014-12-01DOI: 10.1109/PDGC.2014.7030732
M. Priya, C. Rama Krishna, P. Saini
The group mutual exclusion problem is a simplification of mutual exclusion problem such that a set of processes in the similar group can enter a critical section all together. To handle group mutual exclusion, the interrelated solutions are chiefly classified into quorum-based, token-based as well as permission-based protocols. The proposed algorithm is based on tokens; a process that grasps a token can invoke a critical section. To our knowledge, only some algorithms have been proposed in the literature which follows permission-based or token-based approach. In this paper, we put the entire nodes into dissimilar regions. Arbitrator nodes have been introduced in this paper that forms the relationship among two neighboring regions. “Look-ahead” procedure is used which helps in dropping message complexity. We present the distributed group mutual exclusion algorithm developed for MANETs. The outcomes have been substantiated by simulations and experiments. We observed that the proposed algorithm outperforms the TQGmx algorithm in performance parameters such as synchronization delay, response time in addition to message complexity.
{"title":"Arbitration based distributed group mutual exclusion algorithm for mobile ad hoc networks","authors":"M. Priya, C. Rama Krishna, P. Saini","doi":"10.1109/PDGC.2014.7030732","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030732","url":null,"abstract":"The group mutual exclusion problem is a simplification of mutual exclusion problem such that a set of processes in the similar group can enter a critical section all together. To handle group mutual exclusion, the interrelated solutions are chiefly classified into quorum-based, token-based as well as permission-based protocols. The proposed algorithm is based on tokens; a process that grasps a token can invoke a critical section. To our knowledge, only some algorithms have been proposed in the literature which follows permission-based or token-based approach. In this paper, we put the entire nodes into dissimilar regions. Arbitrator nodes have been introduced in this paper that forms the relationship among two neighboring regions. “Look-ahead” procedure is used which helps in dropping message complexity. We present the distributed group mutual exclusion algorithm developed for MANETs. The outcomes have been substantiated by simulations and experiments. We observed that the proposed algorithm outperforms the TQGmx algorithm in performance parameters such as synchronization delay, response time in addition to message complexity.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"20 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":"116727481","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.7030740
L. S. Umrao, D. P. Mahato, Ravi Shankar Singh
Independent spanning trees (ISTs) may be used for message broadcasting in any interconnection networks, which provides preferential performances. It can be used to enhance the fault tolerance, bandwidth, and security. In this way, the designs of ISTs for various types of topologies have been widely analysed. There is a hypothesis on ISTs: any n-connected network has n ISTs rooted at any node. In this paper, we first analysed the algorithm then parallel construct the ISTs in hypercubes. We give an algorithm for ISTs which can be applied to solve any node broadcast problem for hypercubes. Then, simulation results showed that fault tolerance is effective in reliable broadcasting and concedes 11%-23% fault tolerance for successful broadcasting.
{"title":"Fault tolerance for hypercube networks via independent spanning trees","authors":"L. S. Umrao, D. P. Mahato, Ravi Shankar Singh","doi":"10.1109/PDGC.2014.7030740","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030740","url":null,"abstract":"Independent spanning trees (ISTs) may be used for message broadcasting in any interconnection networks, which provides preferential performances. It can be used to enhance the fault tolerance, bandwidth, and security. In this way, the designs of ISTs for various types of topologies have been widely analysed. There is a hypothesis on ISTs: any n-connected network has n ISTs rooted at any node. In this paper, we first analysed the algorithm then parallel construct the ISTs in hypercubes. We give an algorithm for ISTs which can be applied to solve any node broadcast problem for hypercubes. Then, simulation results showed that fault tolerance is effective in reliable broadcasting and concedes 11%-23% fault tolerance for successful broadcasting.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"26 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":"133759125","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.7030755
K. Manna, Vedic Choubey, S. Chattopadhyay, I. Sengupta
This paper presents a Kernighan-Lin bi-partitioning based approach to perform mapping the core graph of an application onto a mesh-based Network-on-Chip (NoC) architecture. It aims at optimizing both communication cost and thermal variance of the resulting solution. Experimental results show that the approach could obtain significant reduction in mean temperature of the die and its standard deviation, compared to many of the recently reported application mapping strategies such as NMAP [1], LMAP [2] and DPSO [3]. All these reported approaches attempt to obtained a communication aware mapping, without any concern about temperature profile of the die. Our proposed approach outperforms all these reported approaches except DPSO, in-terms of communication cost, whereas, in-terms of temperature profile, it outperforms all these approaches. Tradeoff between the communication cost and temperature profile could also be achieved.
{"title":"Thermal variance-aware application mapping for mesh based network-on-chip design using Kernighan-Lin partitioning","authors":"K. Manna, Vedic Choubey, S. Chattopadhyay, I. Sengupta","doi":"10.1109/PDGC.2014.7030755","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030755","url":null,"abstract":"This paper presents a Kernighan-Lin bi-partitioning based approach to perform mapping the core graph of an application onto a mesh-based Network-on-Chip (NoC) architecture. It aims at optimizing both communication cost and thermal variance of the resulting solution. Experimental results show that the approach could obtain significant reduction in mean temperature of the die and its standard deviation, compared to many of the recently reported application mapping strategies such as NMAP [1], LMAP [2] and DPSO [3]. All these reported approaches attempt to obtained a communication aware mapping, without any concern about temperature profile of the die. Our proposed approach outperforms all these reported approaches except DPSO, in-terms of communication cost, whereas, in-terms of temperature profile, it outperforms all these approaches. Tradeoff between the communication cost and temperature profile could also be achieved.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"34 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":"133396188","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.7030784
Neeraj Chugh, Mitali Chugh, A. Agarwal
Data mining is a system that brings up the light to hidden and valuable information from the data and the facts revealed by data mining which were previously not known, theoretically useful, and of high quality. Data mining offers a means by which we can explores the knowledge in database. Data stream mining and finding outliers are dynamic research areas of data mining. It is thought that `data stream mining and outlier detection' research has drastically expanded the range of data analysis and will have profound impact on data mining methodologies and applications in the long run. However, there are still some difficult research problem that are to be answered before data stream mining and outlier detection can declare a keystone approach in data mining applications. The aim of this work is to simplify problems related to detecting outlier over dynamic data stream and exploring explicit techniques used for detecting outlier over streaming data in data mining presented by researchers in recent years and also to look at the future trends.
{"title":"Outlier detection in streaming data a research perspective","authors":"Neeraj Chugh, Mitali Chugh, A. Agarwal","doi":"10.1109/PDGC.2014.7030784","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030784","url":null,"abstract":"Data mining is a system that brings up the light to hidden and valuable information from the data and the facts revealed by data mining which were previously not known, theoretically useful, and of high quality. Data mining offers a means by which we can explores the knowledge in database. Data stream mining and finding outliers are dynamic research areas of data mining. It is thought that `data stream mining and outlier detection' research has drastically expanded the range of data analysis and will have profound impact on data mining methodologies and applications in the long run. However, there are still some difficult research problem that are to be answered before data stream mining and outlier detection can declare a keystone approach in data mining applications. The aim of this work is to simplify problems related to detecting outlier over dynamic data stream and exploring explicit techniques used for detecting outlier over streaming data in data mining presented by researchers in recent years and also to look at the future trends.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"14 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":"115108395","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.7030721
Pinak Panigrahi, Sriram Kanchiraju, A. Srinivasan, P. K. Baruah, C. D. Sudheer
The Intel MIC architecture, implemented in the Xeon Phi coprocessor, is targeted at highly parallel applications. In order to exploit it, one needs to make full use of simultaneous multi-threading, which permits four simultaneous threads per core. Our results also show that distributed tag directories can be a greater bottleneck than the ring for small messages when multiple threads access the same cache line. Careful design of algorithms and implementations based on these results can yield substantial performance improvement. We demonstrate these ideas by optimizing MPI collective calls. We obtain a speedup of 9x on barrier and a speed-up of 10x on broadcast, when compared with Intel's MPI implementation. We also show the usefulness of our collectives in two realistic codes: particle transport and the load balancing phase in QMC. Another important contribution of our work lies in showing that optimization techniques - such as double buffering - used with programmer controlled caches are also useful on MIC. These results can help optimize other communication intensive codes running on MIC.
{"title":"Optimizing MPI collectives on intel MIC through effective use of cache","authors":"Pinak Panigrahi, Sriram Kanchiraju, A. Srinivasan, P. K. Baruah, C. D. Sudheer","doi":"10.1109/PDGC.2014.7030721","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030721","url":null,"abstract":"The Intel MIC architecture, implemented in the Xeon Phi coprocessor, is targeted at highly parallel applications. In order to exploit it, one needs to make full use of simultaneous multi-threading, which permits four simultaneous threads per core. Our results also show that distributed tag directories can be a greater bottleneck than the ring for small messages when multiple threads access the same cache line. Careful design of algorithms and implementations based on these results can yield substantial performance improvement. We demonstrate these ideas by optimizing MPI collective calls. We obtain a speedup of 9x on barrier and a speed-up of 10x on broadcast, when compared with Intel's MPI implementation. We also show the usefulness of our collectives in two realistic codes: particle transport and the load balancing phase in QMC. Another important contribution of our work lies in showing that optimization techniques - such as double buffering - used with programmer controlled caches are also useful on MIC. These results can help optimize other communication intensive codes running on MIC.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"89 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":"121186640","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.7030706
Divya Chaudhary, B. Kumar
Scheduling enables the cloud in balancing the large amount of load present in the system for faster computation. It plays a vital and significant part in the execution of the load in the various heterogeneous systems. The scheduling portrays a selection of resources for the tasks for better resource utilization. This paper differentiates the various load scheduling algorithms applied in the various heterogeneous systems in detail. It plays a key role in larger resource utilization and handling. This paper defines the basic cloud computing fundamentals and the concept of load balancing i.e., scheduling of load in cloud. The applied load scheduling algorithms are elaborated and surveyed extensively.
{"title":"Analytical study of load scheduling algorithms in cloud computing","authors":"Divya Chaudhary, B. Kumar","doi":"10.1109/PDGC.2014.7030706","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030706","url":null,"abstract":"Scheduling enables the cloud in balancing the large amount of load present in the system for faster computation. It plays a vital and significant part in the execution of the load in the various heterogeneous systems. The scheduling portrays a selection of resources for the tasks for better resource utilization. This paper differentiates the various load scheduling algorithms applied in the various heterogeneous systems in detail. It plays a key role in larger resource utilization and handling. This paper defines the basic cloud computing fundamentals and the concept of load balancing i.e., scheduling of load in cloud. The applied load scheduling algorithms are elaborated and surveyed extensively.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"13 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":"123445081","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.7030791
Z. A. Khan, Jamshed Siddiqui, A. Samad
Multiprocessor architecture is the main resource to speed up applications by incorporating parallelism among various processing elements. The success of multiprocessor system depends how much efficiently the concurrent processes are managed on the system. This paper proposes a novel multiprocessor architecture which is less complex, easily extensible and inherits most of the desirable topological properties. The proposed system is capable to manage the distributing of parallel tasks efficiently when appropriate scheduling schemes are implemented on it. The comparative study shows that the proposed architecture could be used effectively in various multi-processing applications.
{"title":"A novel multiprocessor architecture for massively parallel system","authors":"Z. A. Khan, Jamshed Siddiqui, A. Samad","doi":"10.1109/PDGC.2014.7030791","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030791","url":null,"abstract":"Multiprocessor architecture is the main resource to speed up applications by incorporating parallelism among various processing elements. The success of multiprocessor system depends how much efficiently the concurrent processes are managed on the system. This paper proposes a novel multiprocessor architecture which is less complex, easily extensible and inherits most of the desirable topological properties. The proposed system is capable to manage the distributing of parallel tasks efficiently when appropriate scheduling schemes are implemented on it. The comparative study shows that the proposed architecture could be used effectively in various multi-processing applications.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"2007 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":"128587242","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.7030739
M. Sood, S. Bhooshan
Most of the real systems including a large number of physical, physiological and biochemical signals exhibit non-stationarity or time-varying behavior. Electroencephalogram is brain signal that allows gaining the understanding of the complex inner mechanisms of the brain and abnormal brain waves and plays a vital role in diagnosis of different brain disorders. We have carried out a study for nonlinear feature extracted from epochs of epileptic signal; and classification of EEG signals with feature from various epochs of the signal. The nonlinear properties of the time series are investigated by calculating Hurst exponent values during epileptic seizures, and in the interval between the seizures. During uncontrolled electrical discharges, the long-range correlation effects do appear in EEG signals in all cases, as the Hurst exponent values were above 0.5. It is observed that the proposed method can provide better performance, is much efficient and faster as compared to the time-frequency based techniques while classifying and discriminating seizure activities.
{"title":"Modular based dynamic analysis of EEG signals using non-linear feature","authors":"M. Sood, S. Bhooshan","doi":"10.1109/PDGC.2014.7030739","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030739","url":null,"abstract":"Most of the real systems including a large number of physical, physiological and biochemical signals exhibit non-stationarity or time-varying behavior. Electroencephalogram is brain signal that allows gaining the understanding of the complex inner mechanisms of the brain and abnormal brain waves and plays a vital role in diagnosis of different brain disorders. We have carried out a study for nonlinear feature extracted from epochs of epileptic signal; and classification of EEG signals with feature from various epochs of the signal. The nonlinear properties of the time series are investigated by calculating Hurst exponent values during epileptic seizures, and in the interval between the seizures. During uncontrolled electrical discharges, the long-range correlation effects do appear in EEG signals in all cases, as the Hurst exponent values were above 0.5. It is observed that the proposed method can provide better performance, is much efficient and faster as compared to the time-frequency based techniques while classifying and discriminating seizure activities.","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":"129937236","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.7030774
Mrinal Pandey, R. Pandey
Intelligent information retrieval and data credibility is maintained by the use of Provenance in semantic web. However there is still a need to embed provenance data in a simpler form so that it is trusted and is easily available for human consumption. This Objective is achieved by the use of PROV-ASN that provides multiple expression assertions for the use of abstract notations to represent provenance information on the semantic web. In this paper we have made an endeavour to create valid PROV-ASN instances by embedding entity, agent and activity expressions with reference to University People Program Ontology.
{"title":"Extending abstract notation to ontology provenance using PROV-ASN","authors":"Mrinal Pandey, R. Pandey","doi":"10.1109/PDGC.2014.7030774","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030774","url":null,"abstract":"Intelligent information retrieval and data credibility is maintained by the use of Provenance in semantic web. However there is still a need to embed provenance data in a simpler form so that it is trusted and is easily available for human consumption. This Objective is achieved by the use of PROV-ASN that provides multiple expression assertions for the use of abstract notations to represent provenance information on the semantic web. In this paper we have made an endeavour to create valid PROV-ASN instances by embedding entity, agent and activity expressions with reference to University People Program Ontology.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"51 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":"131127354","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.7030714
Aayush Agarwal, G. Manisha, R. Milind, S. Shylaja
Cloud computing is a model for enabling ubiquitous, convenient, on-demand network access to a shared pool of configurable computing resources that can be rapidly provisioned and released with minimal management effort or service provider interaction. In cloud computing, load balancing is one of the key issues. Load balancing is the process of apportioning the load among various nodes of a distributed system to improve both resource utilization and job response time while avoiding a situation where some of the nodes are heavily loaded while others are idle. This paper outlines an experimentation based comparative analysis of the load balancing algorithms for different scenario use cases.
{"title":"Performance analysis of cloud based load balancing techniques","authors":"Aayush Agarwal, G. Manisha, R. Milind, S. Shylaja","doi":"10.1109/PDGC.2014.7030714","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030714","url":null,"abstract":"Cloud computing is a model for enabling ubiquitous, convenient, on-demand network access to a shared pool of configurable computing resources that can be rapidly provisioned and released with minimal management effort or service provider interaction. In cloud computing, load balancing is one of the key issues. Load balancing is the process of apportioning the load among various nodes of a distributed system to improve both resource utilization and job response time while avoiding a situation where some of the nodes are heavily loaded while others are idle. This paper outlines an experimentation based comparative analysis of the load balancing algorithms for different scenario use cases.","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":"130368058","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
扫码关注我们
求助内容：
应助结果提醒方式：