2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing最新文献

筛选
英文 中文
Distributed adaptive spanning tree for data gathering in Wireless Sensor Networks 无线传感器网络数据采集的分布式自适应生成树
2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing Pub Date : 2012-12-06 DOI: 10.1109/PDGC.2012.6449869
H. Poostchi, M. Akbarzadeh-T., S. M. Taheri
{"title":"Distributed adaptive spanning tree for data gathering in Wireless Sensor Networks","authors":"H. Poostchi, M. Akbarzadeh-T., S. M. Taheri","doi":"10.1109/PDGC.2012.6449869","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449869","url":null,"abstract":"Wireless Sensor Networks (WSNs) consist of many independent sensor/processing elements that are highly interactive to reach a unifying goal. Providing a suitable infrastructure for this interaction is the first step to support intra-network processing. Such underlying infrastructure should also scale well with network properties, prolong the network life and balance the load among sensors as much as possible. In this paper, we propose a novel distributed adaptive spanning tree based on Markov property interpretation in WSNs that not only enables consensus processing, but also improves network performance. The tree is constructed using a new energy efficient coverage cost and distributed Voronoi Tessellation. The utility of the proposed approach is illustrated by applying this interaction architecture for data gathering tasks in WSNs.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129965520","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}
引用次数: 0
Porting clondike to heterogeneous platforms 将clondike移植到异构平台
2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing Pub Date : 2012-12-01 DOI: 10.1109/PDGC.2012.6449850
J. Gattermayer, P. Tvrdík
{"title":"Porting clondike to heterogeneous platforms","authors":"J. Gattermayer, P. Tvrdík","doi":"10.1109/PDGC.2012.6449850","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449850","url":null,"abstract":"Clustering plays an important role in today's computer networks. We can achieve a higher efficiency of the whole network infrastructure by simply using idle computing power of ordinary workstations. The Clondike project aims to create a universal non-dedicated peer-to-peer cluster where every participating node can benefit from its membership in the cluster. The peer-to-peer approach does not contain any single point of failure, so a high availability is guaranteed by design. So far, we have tested Clondike only in our laboratory with homogeneous computer network architecture, all the computer nodes were the same. In this paper, we report on experiments with moving the Clondike cluster closer to a real environment: with porting Clondike to a real office network with heterogeneous computers. We have run a distributed compilation of the Linux Kernel on both platforms to verify our results and to assess the weaknesses of the current solution and to identify further development needs.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115484833","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}
引用次数: 2
Computing aspects of monitoring walking disorder using body sensor network and neural network 用身体传感器网络和神经网络监测行走障碍的计算方面
2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing Pub Date : 2012-12-01 DOI: 10.1109/PDGC.2012.6449837
D. Acharjee, A. Mukherjee, N. Mukherjee
{"title":"Computing aspects of monitoring walking disorder using body sensor network and neural network","authors":"D. Acharjee, A. Mukherjee, N. Mukherjee","doi":"10.1109/PDGC.2012.6449837","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449837","url":null,"abstract":"Here, it is proposed to monitor walking disorder of any patient with the help of wireless three dimensional (3D) accelerometer based body sensors and its networks. We gather Ground Truth Data from the sensors, filter it, boost up it when required, then collect some important features and compare with the features of run time data using different algorithms developed by us. Where, for matching the run time features, we use supervised learning method of back propagation neural network. After gathering data, a prototype model of computation is developed which may be used in any motion disorder of any subjects like: patients, athletes, pilots and astronauts. The contribution of this paper is focused on to develop a model of computational processes required to monitor activity recognition system. The computing model developed is validated working over different walking motion disorders of different subjects and then discussed how this model can be applied in an organization to provide internet based online patient's information services with the help of Feature Server and Local Server connected by wireless radio link of Personal Computing Devices like mobile phone, PDA, laptop etc.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115491459","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}
引用次数: 4
Exploration of automatic optimization for CUDA programming CUDA编程的自动优化探索
2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing Pub Date : 2012-12-01 DOI: 10.1109/PDGC.2012.6449791
M. Al-Mouhamed, A. ul Hassan Khan
{"title":"Exploration of automatic optimization for CUDA programming","authors":"M. Al-Mouhamed, A. ul Hassan Khan","doi":"10.1109/PDGC.2012.6449791","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449791","url":null,"abstract":"Graphic processing Units (GPUs) are gaining ground in high-performance computing. CUDA (an extension to C) is most widely used parallel programming framework for general purpose GPU computations. However, the task of writing optimized CUDA program is complex even for experts. We present a method for restructuring loops into an optimized CUDA kernels based on a 3-step algorithm which are loop tiling, coalesced memory access, and resource optimization. We also establish the relationships between the influencing parameters and propose a method for finding possible tiling solutions with coalesced memory access that best meets the identified constraints. We also present a simplified algorithm for restructuring loops and rewrite them as an efficient CUDA Kernel. The execution model of synthesized kernel consists of uniformly distributing the kernel threads to keep all cores busy while transferring a tailored data locality which is accessed using coalesced pattern to amortize the long latency of the secondary memory. In the evaluation, we implement some simple applications using the proposed restructuring strategy and evaluate the performance in terms of execution time and GPU throughput.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123123065","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}
引用次数: 6
A novel framework and policies for on-line block of cores allotment for multiple DAGs on NoC 一种新的NoC上多dag在线核块分配框架和策略
2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing Pub Date : 2012-12-01 DOI: 10.1109/PDGC.2012.6449813
U. Boregowda, V. R. Chakaravarthy
{"title":"A novel framework and policies for on-line block of cores allotment for multiple DAGs on NoC","authors":"U. Boregowda, V. R. Chakaravarthy","doi":"10.1109/PDGC.2012.6449813","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449813","url":null,"abstract":"Computer industry has widely accepted that future performance increases must largely come from increasing the number of processing cores on a die. This has led to NoC processors. Task scheduling is one of the most challenging problems facing parallel programmers today which is known to be NP-complete. A good principle is space-sharing of cores and to schedule multiple DAGs simultaneously on NoC processor. Hence the need to find optimal number of cores for a DAG and further which region of cores on NoC, to be allotted for a DAG . In this work, a method is proposed to find near-optimal minimal block of cores for a DAG on a NoC processor. Further, a time efficient framework and three on-line block allotment policies to submitted DAGs are experimented. The objectives of the policies, is to improve the total completion time for the submitted set of DAGs, hence the throughput. The policies are experimented on a simulator and found to deliver better performance than the policies found in literature.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115774945","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}
引用次数: 0
Breast cancer detection using backpropagation neural network with comparison between different neuron 用反向传播神经网络检测乳腺癌,并对不同神经元进行比较
2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing Pub Date : 2012-12-01 DOI: 10.1109/PDGC.2012.6449811
P. Pawar, D. Patil
{"title":"Breast cancer detection using backpropagation neural network with comparison between different neuron","authors":"P. Pawar, D. Patil","doi":"10.1109/PDGC.2012.6449811","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449811","url":null,"abstract":"Breast cancer is an uncontrolled growth of breast cells. Cell in the body get divide, grow and die every day. This division and growth of cell is most of the in orderly manner but when their growth is out of control. The uncontrolled growth of cell forms the lump which is called as tumor. A tumor generally of two types benign (not dangerous) or malignant (dangerous to health). The malignant tumor which develops in breast is called as breast cancer. In this paper we use backpropagation neural network for classification of breast cancer with different neuron models. It can assist doctors for taking correct decisions.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117147901","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}
引用次数: 4
Task scheduling through limited duplication with processor utilization in grid computing system 网格计算系统中基于处理器利用率的有限重复任务调度
2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing Pub Date : 2012-12-01 DOI: 10.1109/PDGC.2012.6449947
N. Agarwal, C. Gupta, A. Khare
{"title":"Task scheduling through limited duplication with processor utilization in grid computing system","authors":"N. Agarwal, C. Gupta, A. Khare","doi":"10.1109/PDGC.2012.6449947","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449947","url":null,"abstract":"In dependent task scheduling algorithms, task duplication is the finest scheduling technique for minimizing the response time of workflow application in grid computing system. When we apply task duplication scheduling algorithm on workflow application, we get shorter schedules (makespan) but it has one limitation that grid node can be overloaded due to duplications of tasks. In this paper we are proposing an algorithm in which we are focusing on three points (1) reducing makespan (2) reducing tasks duplication, and (3) achieving better processor utilization. For this we have suggested an algorithm (TLD-P) which is achieving good results for considered parameters as compared to the existing HLD and EDS-G algorithm.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121247910","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}
引用次数: 1
Combinatorial reliability analysis of Folded Crossed cube 折叠交叉立方体组合可靠性分析
2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing Pub Date : 2012-12-01 DOI: 10.1109/PDGC.2012.6449901
S. Jena, P. Radhika, P. Reddy, G. Sowmya
{"title":"Combinatorial reliability analysis of Folded Crossed cube","authors":"S. Jena, P. Radhika, P. Reddy, G. Sowmya","doi":"10.1109/PDGC.2012.6449901","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449901","url":null,"abstract":"This paper presents an efficient combinatorial approach to compute the reliability of Folded Crossed cube topology. The reliability measure has been defined as Task-based Reliability (TBR).The model is based on decomposition principle which is entirely task-based and can handle any degradation. The reliability results are obtained using recursive equation both optimistic and pessimistic are better than for the Crossed cube as well as for most of the other networks. We have utilized the method to generate the task-based reliability of some higher dimensional interconnection networks with various failure rates and coverage factors.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"21 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127478494","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}
引用次数: 2
A novel hybrid approach to enhance low resolution images using particle swarm optimization 基于粒子群优化的低分辨率图像增强混合方法
2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing Pub Date : 2012-12-01 DOI: 10.1109/PDGC.2012.6449941
M. I. Quraishi, K. G. Dhal, J. P. Choudhury, K. Pattanayak, M. De
{"title":"A novel hybrid approach to enhance low resolution images using particle swarm optimization","authors":"M. I. Quraishi, K. G. Dhal, J. P. Choudhury, K. Pattanayak, M. De","doi":"10.1109/PDGC.2012.6449941","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449941","url":null,"abstract":"Enhancement of low resolution images is always a priority Enhancement of low resolution images is always a priority field of digital image processing. In this paper, we propose a novel hybrid approach based on discrete wavelet transform (DWT) and particle swarm optimization (PSO). To develop the proposed method we use spatial domain as well as frequency domain. To reduce the low frequencies from the input image we use the frequency domain. DWT is used to decompose the input low resolution image into different sub bands. Each of the interpolated high frequency sub band (LH, HL, HH) is then summed up with the interpolated output image of the frequency domain. In order to achieve high resolution image, the estimated high frequency sub bands of the intermediate stage and the interpolated low resolution input image have been combined by using inverse DWT. To generate a better high resolution image particle swarm optimization (PSO) technique has been used. The quantitative (root mean square error, normalized cross correlation, normalized absolute error) and visual outcome show the strength of this proposed method.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125105710","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}
引用次数: 13
Identification of nonlinear systems from the knowledge around different operating conditions: A feed-forward multi-layer ANN based approach 基于不同运行条件的非线性系统识别:一种基于前馈多层神经网络的方法
2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing Pub Date : 2012-12-01 DOI: 10.1109/PDGC.2012.6449856
Sayan Saha, Saptarshi Das, Anish Acharya, Abhishek Kumar, S. Mukherjee, Indranil Pan, Amitava Gupta
{"title":"Identification of nonlinear systems from the knowledge around different operating conditions: A feed-forward multi-layer ANN based approach","authors":"Sayan Saha, Saptarshi Das, Anish Acharya, Abhishek Kumar, S. Mukherjee, Indranil Pan, Amitava Gupta","doi":"10.1109/PDGC.2012.6449856","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449856","url":null,"abstract":"The paper investigates nonlinear system identification using system output data at various linearized operating points. A feed-forward multi-layer Artificial Neural Network (ANN) based approach is used for this purpose and tested for two target applications i.e. nuclear reactor power level monitoring and an AC servo position control system. Various configurations of ANN using different activation functions, number of hidden layers and neurons in each layer are trained and tested to find out the best configuration. The training is carried out multiple times to check for consistency and the mean and standard deviation of the root mean square errors (RMSE) are reported for each configuration.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126152796","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}
引用次数: 8
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信