2009 IEEE International Symposium on Parallel and Distributed Processing with Applications最新文献

Fuzzy Decision Tree Based Inference Technology for Spam Behavior Recognition 基于模糊决策树的垃圾邮件行为识别推理技术

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.60

Wang Meizhen, L. Zhitang, Zhong Sheng

引用次数: 2

Performance, Fault-Tolerance and Scalability Analysis of Virtual Infrastructure Management System 虚拟基础设施管理系统的性能、容错和可扩展性分析

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.24

Xiangzhen Kong, Jiwei Huang, Chuang Lin, P. Ungsunan

引用次数: 29

Virtual Machine Resource Management for High Performance Computing Applications 高性能计算应用的虚拟机资源管理

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.52

Zhiyuan Shao, Hai Jin, Yong Li

引用次数: 14

Bandwidth Sensitive Co-allocation Scheme for Parallel Downloading in Data Grid 数据网格并行下载的带宽敏感协同分配方案

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.101

Ching-Hsien Hsu, Chia-Wei Chu, Chih-Hsun Chou

{"title":"Bandwidth Sensitive Co-allocation Scheme for Parallel Downloading in Data Grid","authors":"Ching-Hsien Hsu, Chia-Wei Chu, Chih-Hsun Chou","doi":"10.1109/ISPA.2009.101","DOIUrl":"https://doi.org/10.1109/ISPA.2009.101","url":null,"abstract":"The large sized data sets are replicated in more than one site for the better availability to the nodes in a grid. Downloading the dataset from these replicated locations have practical difficulties, due to network traffic, congestion, frequent change-in performance of the servers, etc. In order to speed up the download, complex server selection techniques, network and server loads are used. However, consistent performance is not guaranteed due to the shared nature of network links of the load on them, which can vary unpredictably. In this paper, we present a bandwidth sensitive co-allocation scheme for parallel downloading in grid economics. Objective of the proposed technique aims to service grid applications efficiently and economically in data grids. With the consideration of cost factor, we present a novel mechanism for server selection, dynamic file decomposition and co-allocation. Under considerations in costs, our mechanism for selections of servers with various techniques combined is able to significantly attenuate economic costs. We compared our scheme with the existing schemes and the preliminary results show notable improvement in overall completion time of data transfer.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122055446","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}

引用次数: 10

Using Pcache to Speedup Interpretation in Dynamic Binary Translation 利用Pcache加速动态二进制翻译中的解释

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.83

Wei Chen, Hongyi Lu, Li Shen, Zhiying Wang, Nong Xiao

引用次数: 4

Optimizing Message Passing Programs Based on Task Section Duplication 基于任务段复制的消息传递程序优化

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.98

Yin Ye, Zhihui Du, Song Hao

引用次数: 1

Random Scheduling for Wireless Sensor Networks 无线传感器网络的随机调度

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.50

Jie Jiang, L. Fang, Jun Wen, Guofu Wu, He-ying Zhang

{"title":"Random Scheduling for Wireless Sensor Networks","authors":"Jie Jiang, L. Fang, Jun Wen, Guofu Wu, He-ying Zhang","doi":"10.1109/ISPA.2009.50","DOIUrl":"https://doi.org/10.1109/ISPA.2009.50","url":null,"abstract":"In energy constrained wireless sensor networks, node scheduling is an effective approach to improving the energy efficiency and prolonging the network lifetime. In this paper, we propose a distributed, lightweight, and location-unaware scheduling scheme for randomly deployed wireless sensor networks. The basic idea of the scheduling scheme is to organize sensor nodes into disjoint node sets, which work alternately to extend network lifetime effectively. This scheme neither incurs any communication overhead nor relies on expensive localization services. Also we have done thorough mathematical analysis and extensive simulations on the scheme using Poisson point process, a realistic deployment model in large scale randomly deployed sensor networks. Theoretic analysis reveals the internal relationship among the required coverage performance, expected network lifetime, node deployment intensity and failure probability. Impact of normally and uniformly distributed time asynchrony on network coverage quality is also investigated. Simulation results demonstrate that the proposed scheme is resilient to time asynchrony among random sensor nodes.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123921776","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}

引用次数: 11

Adaptive Processor Allocation with Estimated Job Execution Time in Heterogeneous Computing Grid 异构计算网格中估计作业执行时间的自适应处理器分配

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.46

Kuo-Chan Huang, Kuan-Po Lai, Hsi-Ya Chang

引用次数: 1

Multi-Source Traffic Data Fusion Method Based on Regulation and Reliability 基于规则和可靠性的多源流量数据融合方法

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.15

Xinhong Wu, Hai Jin

引用次数: 2

A Designated Path Scheme for Energy-Efficient Data Aggregation in Wireless Sensor Networks 无线传感器网络中节能数据聚合的指定路径方案

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.91

Yong-Ki Kim, Rabindra Bista, Jae-Woo Chang

{"title":"A Designated Path Scheme for Energy-Efficient Data Aggregation in Wireless Sensor Networks","authors":"Yong-Ki Kim, Rabindra Bista, Jae-Woo Chang","doi":"10.1109/ISPA.2009.91","DOIUrl":"https://doi.org/10.1109/ISPA.2009.91","url":null,"abstract":"For wireless sensor networks (WSNs), how to design routing protocols is very important to gather data efficiently so that the life of the network can be prolonged. A usual concept to collect data by a sink node is to transfer data from sensor nodes to the sink node by multi-hop. However, it gives rise to two problems. The first one is that core sensor nodes being more frequently used to gather data run out of energy sooner than other sensor nodes. As a result, the network loses its service ability, regardless of a large amount of residual energy of the other nodes. The second one is that the network generates unnecessary traffic during data transmission for choosing a proper data sending path. To resolves the problems, we, in this paper, propose a designated path scheme for energy-balanced data aggregation in WSNs. The proposed scheme pre-determines a set of paths and runs them in round-robin fashion so that all the nodes can participate in the workload of gathering data and transferring them to the sink node. With our analytical performance analysis, we show that our designated path scheme is more energy efficient and can prolong the life time of the network, compared with the existing two data–centric routing schemes, i.e., directed diffusion and hierarchical data aggregation (HDA).","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127852816","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}

引用次数: 9