Pub Date : 2014-08-01DOI: 10.1109/ICAETR.2014.7012962
Mohd Shoaib, A. Maurya
There are billions of Web pages on World Wide Web which can be accessed via internet. All of us rely on usage of internet for source of information. This source of information is available on web in various forms such as Websites, databases, images, sound, videos and many more. The search results given by search engine are classified on basis of many techniques such as keyword matches, link analysis, or many other techniques. Search engines provide information gathered from their own indexed databases. These indexed databases contain downloaded information from web pages. Whenever a query is provided by user, the information is fetched from these indexed pages. The Web Crawler is used to download and store web pages. Web crawler of these search engines is expert in crawling various Web pages to gather huge source of information. Web Crawler is developed which orders URLs on the basis of their content similarity to a query and structural similarity. Results are provided over five parameters: Top URLs, Precision, Content, Structural and Total Similarity for a keyword.
{"title":"URL ordering based performance evaluation of Web crawler","authors":"Mohd Shoaib, A. Maurya","doi":"10.1109/ICAETR.2014.7012962","DOIUrl":"https://doi.org/10.1109/ICAETR.2014.7012962","url":null,"abstract":"There are billions of Web pages on World Wide Web which can be accessed via internet. All of us rely on usage of internet for source of information. This source of information is available on web in various forms such as Websites, databases, images, sound, videos and many more. The search results given by search engine are classified on basis of many techniques such as keyword matches, link analysis, or many other techniques. Search engines provide information gathered from their own indexed databases. These indexed databases contain downloaded information from web pages. Whenever a query is provided by user, the information is fetched from these indexed pages. The Web Crawler is used to download and store web pages. Web crawler of these search engines is expert in crawling various Web pages to gather huge source of information. Web Crawler is developed which orders URLs on the basis of their content similarity to a query and structural similarity. Results are provided over five parameters: Top URLs, Precision, Content, Structural and Total Similarity for a keyword.","PeriodicalId":196504,"journal":{"name":"2014 International Conference on Advances in Engineering & Technology Research (ICAETR - 2014)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116653037","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-08-01DOI: 10.1109/ICAETR.2014.7012830
S. Dwivedi, R. Meena, R. Upadhyay, P. Padhy
In this paper, a novel approach of hybrid controller made up of Proportional-Integral-Derivative (PID) controller and Support Vector Machine (SVM) is proposed, for the navigation of mobile robot. In proposed hybrid technique, the two parameters of mobile robot i.e. velocity and turning angles are controlled by PID controller and support vector machine respectively. Particle Swarm Optimization (PSO) technique is used to find the global optimum values of PID parameters within the search space. PSO technique helps to achieve, stable convergence characteristics and fast tuning of the process. The proposed hybrid approach enables mobile robot to track path accurately with computational efficiency. Robustness and accuracy of the proposed hybrid model is illustrated through simulation results for circular and random path.
{"title":"Tracking of mobile robot using hybrid controller","authors":"S. Dwivedi, R. Meena, R. Upadhyay, P. Padhy","doi":"10.1109/ICAETR.2014.7012830","DOIUrl":"https://doi.org/10.1109/ICAETR.2014.7012830","url":null,"abstract":"In this paper, a novel approach of hybrid controller made up of Proportional-Integral-Derivative (PID) controller and Support Vector Machine (SVM) is proposed, for the navigation of mobile robot. In proposed hybrid technique, the two parameters of mobile robot i.e. velocity and turning angles are controlled by PID controller and support vector machine respectively. Particle Swarm Optimization (PSO) technique is used to find the global optimum values of PID parameters within the search space. PSO technique helps to achieve, stable convergence characteristics and fast tuning of the process. The proposed hybrid approach enables mobile robot to track path accurately with computational efficiency. Robustness and accuracy of the proposed hybrid model is illustrated through simulation results for circular and random path.","PeriodicalId":196504,"journal":{"name":"2014 International Conference on Advances in Engineering & Technology Research (ICAETR - 2014)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127295194","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-08-01DOI: 10.1109/ICAETR.2014.7012823
Preeti, Jyoti Chaudhary
Quality of a software system depends on testing approaches adopted to analyze the software product. Testing process itself depends on two main vectors called test sequence generation and test data generation. Test sequence generation is about to identify the order in which the particular test cases will be executed and the test data defines the various checks performed on each test case. In this present work, a fuzzy improved genetic approach is suggested for test case generation. The sequence on these test cases is here dependent on module interaction analysis. Based on this analysis, the test case prioritization will be defined. Once the test cases will be prioritized, the next work is to apply fuzzy improved genetic approach for test path generation. The work is analyzed under different prioritization vectors. Analysis of work is defined in terms of test cost estimation under different prioritization scenarios.
{"title":"An improved genetic approach for test path generation","authors":"Preeti, Jyoti Chaudhary","doi":"10.1109/ICAETR.2014.7012823","DOIUrl":"https://doi.org/10.1109/ICAETR.2014.7012823","url":null,"abstract":"Quality of a software system depends on testing approaches adopted to analyze the software product. Testing process itself depends on two main vectors called test sequence generation and test data generation. Test sequence generation is about to identify the order in which the particular test cases will be executed and the test data defines the various checks performed on each test case. In this present work, a fuzzy improved genetic approach is suggested for test case generation. The sequence on these test cases is here dependent on module interaction analysis. Based on this analysis, the test case prioritization will be defined. Once the test cases will be prioritized, the next work is to apply fuzzy improved genetic approach for test path generation. The work is analyzed under different prioritization vectors. Analysis of work is defined in terms of test cost estimation under different prioritization scenarios.","PeriodicalId":196504,"journal":{"name":"2014 International Conference on Advances in Engineering & Technology Research (ICAETR - 2014)","volume":"679 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116107143","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-08-01DOI: 10.1109/ICAETR.2014.7012870
Amit Singh Bhadouria, Mithilesh Kumar
In this paper, a tetraband microstrip patch antenna with defective ground structure (DGS) is proposed. DGS structure is used for improving the performance of microstrip patch antenna. The proposed structure shows the multi-frequency band operation and it covers S and C-band frequencies that are allocated by FCC for TV transmission and reception with open satellite communication. This antenna is designed on FR-4 substrate with dielectric constant 4.5 and thickness 1.8 mm and its size is 40 X 35 X 1.87 mm3. The return loss, gain and directivity of proposed structure is analyzed using commercial computer simulation technology microwave studio (CST MWS). The simulated results show the close agreement with proposed theory. The main application of proposed antenna is to make compatible with open satellite communication for free (not scrambled no subscription required) satellite services.
提出了一种带有缺陷接地结构的四带微带贴片天线。采用DGS结构提高微带贴片天线的性能。所提出的结构显示了多频段工作，它涵盖了FCC分配的S和c频段频率，用于开放卫星通信的电视发送和接收。该天线设计在介电常数4.5、厚度1.8 mm的FR-4衬底上，尺寸为40 X 35 X 1.87 mm3。利用商用计算机仿真技术微波工作室(CST MWS)对该结构的回波损耗、增益和方向性进行了分析。仿真结果与所提出的理论基本一致。该天线的主要应用是兼容开放的卫星通信，提供免费(不加扰，无需订阅)的卫星服务。
{"title":"Multiband DGS based microstrip patch antenna for open satellite communication","authors":"Amit Singh Bhadouria, Mithilesh Kumar","doi":"10.1109/ICAETR.2014.7012870","DOIUrl":"https://doi.org/10.1109/ICAETR.2014.7012870","url":null,"abstract":"In this paper, a tetraband microstrip patch antenna with defective ground structure (DGS) is proposed. DGS structure is used for improving the performance of microstrip patch antenna. The proposed structure shows the multi-frequency band operation and it covers S and C-band frequencies that are allocated by FCC for TV transmission and reception with open satellite communication. This antenna is designed on FR-4 substrate with dielectric constant 4.5 and thickness 1.8 mm and its size is 40 X 35 X 1.87 mm3. The return loss, gain and directivity of proposed structure is analyzed using commercial computer simulation technology microwave studio (CST MWS). The simulated results show the close agreement with proposed theory. The main application of proposed antenna is to make compatible with open satellite communication for free (not scrambled no subscription required) satellite services.","PeriodicalId":196504,"journal":{"name":"2014 International Conference on Advances in Engineering & Technology Research (ICAETR - 2014)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114608505","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-08-01DOI: 10.1109/ICAETR.2014.7012923
Dhrubajyoti Das, Saptarshi Chakraborty
Facial biometric system is a widely used approach in security industry. But face recognition systems are vulnerable to spoofing attacks which can be done by falsifying data using non-real faces and thereby gaining illegal access. An easy way to spoof face recognition systems is to use portrait photographs instead of the real person. Thus, Liveness detection is needed to make a system secure against such spoofing attacks. Inspired from the fact that the images taken from 2-D photographs and live faces are bound to have differences in terms of shape and detailedness, we present an approach based on frequency analysis and texture analysis by using frequency descriptor and Local Binary Pattern (LBP) respectively. Experiments which were done on publicly available database showed excellent results and can efficiently classify live faces and 2-D photographs.
{"title":"Face liveness detection based on frequency and micro-texture analysis","authors":"Dhrubajyoti Das, Saptarshi Chakraborty","doi":"10.1109/ICAETR.2014.7012923","DOIUrl":"https://doi.org/10.1109/ICAETR.2014.7012923","url":null,"abstract":"Facial biometric system is a widely used approach in security industry. But face recognition systems are vulnerable to spoofing attacks which can be done by falsifying data using non-real faces and thereby gaining illegal access. An easy way to spoof face recognition systems is to use portrait photographs instead of the real person. Thus, Liveness detection is needed to make a system secure against such spoofing attacks. Inspired from the fact that the images taken from 2-D photographs and live faces are bound to have differences in terms of shape and detailedness, we present an approach based on frequency analysis and texture analysis by using frequency descriptor and Local Binary Pattern (LBP) respectively. Experiments which were done on publicly available database showed excellent results and can efficiently classify live faces and 2-D photographs.","PeriodicalId":196504,"journal":{"name":"2014 International Conference on Advances in Engineering & Technology Research (ICAETR - 2014)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126803630","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-08-01DOI: 10.1109/ICAETR.2014.7012851
A. Kurkure, Bhakti Chaudhari
Mobile Ad Hoc Network (MANET) is collection of self configuring, wireless, multi hop mobile nodes. This network lacks centralized routing capability as well as a fixed network infrastructure and topology. In order to communicate with each other these multi hop nodes themselves act as routers. As the nodes are mobile and due to lack of central server, the routing may become erroneous. Also due to dynamic nature of nodes the routing becomes a highly tedious task. In the literature several routing protocols have been proposed for mobile ad hoc networks and most prominent among them are DSR, AODV and TORA. But almost all of these protocols assume that the nodes in the MANET are always cooperative. However, these protocols protect MANET from all the possible attacks except non cooperative behavior. ARAN (Authenticated Routing for Adhoc Networks) is a solution proposed which provides security against all possible vulnerabilities but an authenticated selfish node can manipulate these protocols and can disturb the network by dropping packets or delaying the packet. These noncooperative nodes may in turn partition the network. In this paper we propose a credit based system that can be applied to routing protocol to detect selfish node and improve the network performance.
移动自组网(MANET)是自配置、无线、多跳移动节点的集合。这种网络缺乏集中路由能力，缺乏固定的网络基础设施和拓扑结构。为了相互通信，这些多跳节点本身充当路由器。由于节点是移动的，并且由于缺少中心服务器，路由可能会出错。此外，由于节点的动态性，路由成为一项非常繁琐的任务。在文献中，针对移动自组织网络提出了几种路由协议，其中最突出的是DSR, AODV和TORA。但是，几乎所有这些协议都假设MANET中的节点总是合作的。然而，这些协议保护MANET免受所有可能的攻击，除了非合作行为。ARAN (Authenticated Routing for Adhoc Networks)是一种针对所有可能的漏洞提供安全性的解决方案，但是一个经过认证的自私节点可以操纵这些协议，并且可以通过丢弃数据包或延迟数据包来干扰网络。这些不合作的节点可能反过来划分网络。本文提出了一种基于信用的系统，可以应用于路由协议中检测自利节点，提高网络性能。
{"title":"Analysing credit based ARAN to detect selfish nodes in MANET","authors":"A. Kurkure, Bhakti Chaudhari","doi":"10.1109/ICAETR.2014.7012851","DOIUrl":"https://doi.org/10.1109/ICAETR.2014.7012851","url":null,"abstract":"Mobile Ad Hoc Network (MANET) is collection of self configuring, wireless, multi hop mobile nodes. This network lacks centralized routing capability as well as a fixed network infrastructure and topology. In order to communicate with each other these multi hop nodes themselves act as routers. As the nodes are mobile and due to lack of central server, the routing may become erroneous. Also due to dynamic nature of nodes the routing becomes a highly tedious task. In the literature several routing protocols have been proposed for mobile ad hoc networks and most prominent among them are DSR, AODV and TORA. But almost all of these protocols assume that the nodes in the MANET are always cooperative. However, these protocols protect MANET from all the possible attacks except non cooperative behavior. ARAN (Authenticated Routing for Adhoc Networks) is a solution proposed which provides security against all possible vulnerabilities but an authenticated selfish node can manipulate these protocols and can disturb the network by dropping packets or delaying the packet. These noncooperative nodes may in turn partition the network. In this paper we propose a credit based system that can be applied to routing protocol to detect selfish node and improve the network performance.","PeriodicalId":196504,"journal":{"name":"2014 International Conference on Advances in Engineering & Technology Research (ICAETR - 2014)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124066999","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-08-01DOI: 10.1109/ICAETR.2014.7012906
Priyanka
Fingerprints are the most widely used biometric identifier because of their ease of acquisition, storage and further processing for identification/ verification. Fingerprint recognition (FPR) has been used for security purposes and criminal identifications since a long time. This paper presents overview of a basic FPR system, various FPR techniques and challenges. After that a brief discussion on how to compare/verify FPR systems is presented. FPR applications in different areas are listed with some industries and government sectors using this technology. Finally, use of advanced image processing techniques for better results of FPR is discussed, which actually provides a platform for research and development in this area for researchers.
{"title":"Fingerprint recognition techniques and its applications","authors":"Priyanka","doi":"10.1109/ICAETR.2014.7012906","DOIUrl":"https://doi.org/10.1109/ICAETR.2014.7012906","url":null,"abstract":"Fingerprints are the most widely used biometric identifier because of their ease of acquisition, storage and further processing for identification/ verification. Fingerprint recognition (FPR) has been used for security purposes and criminal identifications since a long time. This paper presents overview of a basic FPR system, various FPR techniques and challenges. After that a brief discussion on how to compare/verify FPR systems is presented. FPR applications in different areas are listed with some industries and government sectors using this technology. Finally, use of advanced image processing techniques for better results of FPR is discussed, which actually provides a platform for research and development in this area for researchers.","PeriodicalId":196504,"journal":{"name":"2014 International Conference on Advances in Engineering & Technology Research (ICAETR - 2014)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127750476","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-08-01DOI: 10.1109/ICAETR.2014.7012952
S. Kanetkar, Akshay Nayak, Sridhar Swamy, G. Bhatia
Recommender Systems have been around for more than a decade now. Choosing what book to read next has always been a question for many. Even for students, deciding which textbook or reference book to read on a topic unknown to them is a big question. In this paper, we try to present a model for a web-based personalized hybrid book recommender system which exploits varied aspects of giving recommendations apart from the regular collaborative and content-based filtering approaches. Temporal aspects for the recommendations are incorporated. Also for users of different age, gender and country, personalized recommendations can be made on these demographic parameters. Scraping information from the web and using the information obtained from this process can be equally useful in making recommendations.
{"title":"Web-based personalized hybrid book recommendation system","authors":"S. Kanetkar, Akshay Nayak, Sridhar Swamy, G. Bhatia","doi":"10.1109/ICAETR.2014.7012952","DOIUrl":"https://doi.org/10.1109/ICAETR.2014.7012952","url":null,"abstract":"Recommender Systems have been around for more than a decade now. Choosing what book to read next has always been a question for many. Even for students, deciding which textbook or reference book to read on a topic unknown to them is a big question. In this paper, we try to present a model for a web-based personalized hybrid book recommender system which exploits varied aspects of giving recommendations apart from the regular collaborative and content-based filtering approaches. Temporal aspects for the recommendations are incorporated. Also for users of different age, gender and country, personalized recommendations can be made on these demographic parameters. Scraping information from the web and using the information obtained from this process can be equally useful in making recommendations.","PeriodicalId":196504,"journal":{"name":"2014 International Conference on Advances in Engineering & Technology Research (ICAETR - 2014)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125656706","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-08-01DOI: 10.1109/ICAETR.2014.7012801
A. Joshi, Deepak Bhatia
A new ultra-wideband (UWB) bandpass filter (BPF) with single-notch band is presented in this paper. Single notch-band inside the UWB passband are implemented by a centrally loaded resonator attached to the main transmission line of the initial UWB BPF. The single notch-band can be easily generated and set at any desired frequencies by varying the designed parameters of centrally loaded resonator. Rejection level at desired frequencies is -33.99 dB and pass band insertion loss is almost 0 dB. For verification, a UWB BPF with single notch-band at frequency of 6.8 GHz is designed.
{"title":"Analysis and design of compact UWB bandpass filter with single notch-band","authors":"A. Joshi, Deepak Bhatia","doi":"10.1109/ICAETR.2014.7012801","DOIUrl":"https://doi.org/10.1109/ICAETR.2014.7012801","url":null,"abstract":"A new ultra-wideband (UWB) bandpass filter (BPF) with single-notch band is presented in this paper. Single notch-band inside the UWB passband are implemented by a centrally loaded resonator attached to the main transmission line of the initial UWB BPF. The single notch-band can be easily generated and set at any desired frequencies by varying the designed parameters of centrally loaded resonator. Rejection level at desired frequencies is -33.99 dB and pass band insertion loss is almost 0 dB. For verification, a UWB BPF with single notch-band at frequency of 6.8 GHz is designed.","PeriodicalId":196504,"journal":{"name":"2014 International Conference on Advances in Engineering & Technology Research (ICAETR - 2014)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127969657","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-08-01DOI: 10.1109/ICAETR.2014.7012824
Abhijit L. Sangale, Urvesh Devani, V. Nikam, B. Meshram
Dynamic data structures are the key to many highly efficient and optimized implementations. On CPU, dynamic data structures can grow and shrink at run time by allocating and de-allocating memory from a place called heap and link those blocks using pointers. Adaptive data structure means changing the internal properties and structures of the data structure at run time according to requirement for various purposes, known as adaptive use of data structure. When we consider parallelism on GPUs using CUDA, there are many limitations on what can be used as data structure on GPU's global and shared memory. Generally simple arrays are handled on the GPU memory. Programmers need to find ways to present different data structures in terms of multiple arrays. In this paper, we have studied and implemented dynamic data structures & adaptive methodologies on GPU. We majorly explore the concept dynamic parallelism available in latest CUDA devices by implementing and analyzing quick sort and kernel call wise break down on latest NVIDIA's Kepler Architecture GPU. We also experimented with basic array operations on GPU by implementing minimum number finding. Implementation using CUDA results in very high performance gain.
{"title":"Implementing adaptive and dynamic data structures using CUDA parallelism","authors":"Abhijit L. Sangale, Urvesh Devani, V. Nikam, B. Meshram","doi":"10.1109/ICAETR.2014.7012824","DOIUrl":"https://doi.org/10.1109/ICAETR.2014.7012824","url":null,"abstract":"Dynamic data structures are the key to many highly efficient and optimized implementations. On CPU, dynamic data structures can grow and shrink at run time by allocating and de-allocating memory from a place called heap and link those blocks using pointers. Adaptive data structure means changing the internal properties and structures of the data structure at run time according to requirement for various purposes, known as adaptive use of data structure. When we consider parallelism on GPUs using CUDA, there are many limitations on what can be used as data structure on GPU's global and shared memory. Generally simple arrays are handled on the GPU memory. Programmers need to find ways to present different data structures in terms of multiple arrays. In this paper, we have studied and implemented dynamic data structures & adaptive methodologies on GPU. We majorly explore the concept dynamic parallelism available in latest CUDA devices by implementing and analyzing quick sort and kernel call wise break down on latest NVIDIA's Kepler Architecture GPU. We also experimented with basic array operations on GPU by implementing minimum number finding. Implementation using CUDA results in very high performance gain.","PeriodicalId":196504,"journal":{"name":"2014 International Conference on Advances in Engineering & Technology Research (ICAETR - 2014)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127993079","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
扫码关注我们
求助内容：
应助结果提醒方式：