2009 International Conference on Parallel and Distributed Computing, Applications and Technologies最新文献_第2页

A Data Caching Approach for Sensor Applications 传感器应用的数据缓存方法

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.57

Khaled Almiani, J. Taheri, Anastasios Viglas

{"title":"A Data Caching Approach for Sensor Applications","authors":"Khaled Almiani, J. Taheri, Anastasios Viglas","doi":"10.1109/PDCAT.2009.57","DOIUrl":"https://doi.org/10.1109/PDCAT.2009.57","url":null,"abstract":"In sensor network applications, data gathering mechanisms, which are based on multi-hop forwarding, can be expensive in terms of energy. This limitation challenges the use of sensor networks for applications that demand a predefined operational-lifetime. To avoid this problem, using of Mobile Element (ME) as a mechanical data carrier has emerged as a promising approach. However, practical considerations such as the ME speed and route planning, sensor buffer size and data frequency generation constraints impose limits on this approach. To address these issues, we propose a natural hybrid approach that combines two approaches of ME and multi-hop forwarding. We consider the problem of determining the path of the ME, in which the length of this path is bounded by pre-determined length. This path will visit a subset of the nodes. These selected nodes will work as caching points and will aggregate the other nodes’ data. The caching point nodes are selected with the aim of reducing the energy expenditures due to multi-hop forwarding. To address this problem, we present a heuristic-based solution and compare its performance against the optimal solution. We obtain the optimal solution by providing an Integer Linear Program for this problem.","PeriodicalId":312929,"journal":{"name":"2009 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128250716","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

Idiom Recognition and Program Scheme Recognition Based Program Transformations for Performance Tuning--Beyond Compiler Optimizations-- 基于习惯用法识别和程序方案识别的程序转换，用于性能调优——超越编译器优化

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.66

S. Hiroyuki

引用次数: 1

A Simple Parallel Convex Hulls Algorithm for Sorted Points and the Performance Evaluation on the Multicore Processors 一种简单的点排序并行凸包算法及其在多核处理器上的性能评价

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.56

Masaya Nakagawa, Duhu Man, Yasuaki Ito, K. Nakano

引用次数: 6

Lambda-Systolic Routing in a Wavelength-Division Multiplexed All-Optical Butterfly 波分复用全光蝴蝶中的lambda -收缩路由

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.21

Risto T. Honkanen

引用次数: 0

Error Compensation for Cricket Indoor Location System 板球室内定位系统的误差补偿

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.54

Shu-De Zhou, Haoran Feng, Ruixi Yuan

引用次数: 6

Space-Optimal Deterministic Rendezvous 空间最优确定性交会

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.13

Fabienne Carrier, Stéphane Devismes, F. Petit, Yvan Rivierre

引用次数: 1

A Task Selection Based Power-aware Scheduling Algorithm for Applying DVS 一种基于任务选择的分布式交换机调度算法

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.36

Yuichiro Mori, K. Asakura, Toyohide Watanabe

引用次数: 6

A Study of an Infrastructure for Research and Development of Many-Core Processors 面向多核处理器研发的基础架构研究

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.77

Koh Uehara, Shimpei Sato, T. Miyoshi, Kenji Kise

引用次数: 13

An Evolution of the Non-Parameter Harris Affine Corner Detector: A Distributed Approach 非参数Harris仿射角点检测器的一种改进:分布式方法

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.45

F. Bellavia, M. Cipolla, D. Tegolo, Cesare Valenti

引用次数: 5

Building Highly Available Cluster File System Based on Replication 基于复制技术构建高可用集群文件系统

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.14

Liang Cao, Yu Wang, Jin Xiong

{"title":"Building Highly Available Cluster File System Based on Replication","authors":"Liang Cao, Yu Wang, Jin Xiong","doi":"10.1109/PDCAT.2009.14","DOIUrl":"https://doi.org/10.1109/PDCAT.2009.14","url":null,"abstract":"In order to gain better cost-effectiveness, current large-scale storage systems are typically built up by thousands of individual components. As systems scale up, the probability of the failure of multiple components increases. And for large-scale storage system, failures are normal rather than exception. How to build file systems providing both high throughput and highly available service under such circumstances is a big challenge. We have designed and implemented HA-DCFS3, a highly available cluster file system prototype. It uses a scalable replication algorithm called Asynchronous Primary Copy Protocol (APCP). Unlike traditional Primary Copy Protocol that must synchronize updates to all replicas, APCP introduces an asynchronous approach where write operation is permitted to be synchronized to a subset of replicas. This flexible approach greatly improves the write performance. Furthermore, HA-DCFS3 also introduces a fine-grained failure detection called “ data path detection”, which is integrated into the fault-tolerant framework based on data replication. Hence, HA-DCFS3 can provide continuous service even when component failures occur. And finally, HA-DCFS3 adopts a two-level data recovery strategy that handles transient failures with reintegration and persistent failures with re-replication respectively to reduce the cost of data repair. Our performance results show that HA-DCFS3 can deliver high and scalable aggregate performance and provide highly available service at very low cost.","PeriodicalId":312929,"journal":{"name":"2009 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124947896","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}

引用次数: 5