2008 IEEE International Symposium on Parallel and Distributed Processing with Applications最新文献_第7页

Performance Evaluation of Recommendation Retrieval in Peer-to-Peer Networks 点对点网络中推荐检索的性能评价

2008 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2008-12-10 DOI: 10.1109/ISPA.2008.79

Farag Azzedin, Ahmad Ridha

引用次数: 1

Design Techniques for the Scalability of Cluster Management Software on Dawning Supercomputers 曙光超级计算机集群管理软件可扩展性设计技术

2008 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2008-12-10 DOI: 10.1109/ISPA.2008.12

Bibo Tu, Ming Zou, Jianfeng Zhan, Jianping Fan

引用次数: 0

A Distributed Relay MAC Protocol in WiMedia Wireless Personal Area WiMedia无线个人区域中的分布式中继MAC协议

2008 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2008-12-10 DOI: 10.1109/ISPA.2008.135

Hyunmee Shin, Yongsung Kim, Sangheon Pack, C. Kang

引用次数: 10

Intelligent Target Tracking and Shooting System with Mean Shift 均值移位智能目标跟踪与射击系统

2008 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2008-12-10 DOI: 10.1109/ISPA.2008.167

Xiang Xiang, Wenhui Chen, Du Zeng

引用次数: 5

A Generic Construction of Identity-Based Online/Offline Signcryption 基于身份的在线/离线签名加密的通用构造

2008 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2008-12-10 DOI: 10.1109/ISPA.2008.16

Dongdong Sun, Y. Mu, W. Susilo

引用次数: 13

Energy Optimal Scheduling on Multiprocessors with Migration 带迁移的多处理机能量最优调度

2008 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2008-12-10 DOI: 10.1109/ISPA.2008.128

B. Bingham, M. Greenstreet

引用次数: 37

Event Classification and Filtering of False Alarms in Wireless Sensor Networks 无线传感器网络中虚警的事件分类与过滤

2008 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2008-12-10 DOI: 10.1109/ISPA.2008.26

M. Wälchli, T. Braun

{"title":"Event Classification and Filtering of False Alarms in Wireless Sensor Networks","authors":"M. Wälchli, T. Braun","doi":"10.1109/ISPA.2008.26","DOIUrl":"https://doi.org/10.1109/ISPA.2008.26","url":null,"abstract":"In this paper the classification of discrete events, computed on tiny wireless sensor nodes, is investigated. Three different classifiers are evaluated: a Bayesian classifier, a fuzzy logic controller (FLC), and a neural network approach. The target applications pose several requirements on the classifiers. No a priori knowledge about the event classes is available. Events are only observable as collections of raw sensor data. Accordingly, event classes need to be learned from that raw (training) data. As a consequence, pre-labeling of the events is not possible either. In our work, event classes are learned by a k-means clustering algorithm. Any subsequent classifier training is based on these extracted event classes. Thus, the resulting classifiers are completely self-learning. Event classes are learned from emitted signal strength estimations, which are collected and processed by dynamically established tracking groups. The resulting event estimates are reported to a base station, where the classifiers are trained. The learned classifier parameters are then downloaded onto the sensor nodes, where any subsequent classification and filtering is performed.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122523072","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

CLCP – A Distributed Cross-Layer Commit Protocol for Mobile Ad Hoc Networks CLCP -移动自组织网络的分布式跨层提交协议

2008 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2008-12-10 DOI: 10.1109/ISPA.2008.31

S. Obermeier, S. Böttcher, Dominik Kleine

{"title":"CLCP – A Distributed Cross-Layer Commit Protocol for Mobile Ad Hoc Networks","authors":"S. Obermeier, S. Böttcher, Dominik Kleine","doi":"10.1109/ISPA.2008.31","DOIUrl":"https://doi.org/10.1109/ISPA.2008.31","url":null,"abstract":"Transaction processing in mobile ad hoc networks must take network problems like node disconnection, message loss, and network partitioning into consideration. We present a distributed cross-layer atomic commit protocol called CLCP that uses multiple coordinators and makes use of acknowledgement messages to piggyback information. We evaluated transaction processing in mobile ad hoc networks by using two mobility models (i.e. Attraction Point and Manhattan Geometry), and compared CLCP with both atomic commit protocols, 2PC and Paxos Commit, each implemented in 3 versions, i.e. without acknowledgements, with relay routing, and with nearest forward progress routing. Special to our simulation environment is the use of the quasi-unit-disc model, which assumes a non-binary message reception probability that captures real-world behavior much better than the classical unit-disc-model, often used in theory. Using the quasi-unit-disc model, our evaluation shows the following results. CLCP and \"2PC without acknowledement messages\" have a significantly lower energy consumption than the other protocols, and CLCP is able to commit significantly more distributed transactions than all the other atomic commit protocols for each of the mobility models.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123380697","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

Supporting Parallel R Code in Clinical Trials: A Grid-Based Approach 在临床试验中支持并行R代码:基于网格的方法

2008 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2008-12-10 DOI: 10.1109/ISPA.2008.29

D. Wegener, T. Sengstag, S. Sfakianakis, S. Rüping

引用次数: 3

A System for Dynamic Server Allocation in Application Server Clusters 应用服务器集群中的动态服务器分配系统

2008 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2008-12-10 DOI: 10.1109/ISPA.2008.88

Adam P. Chester, J. Xue, Ligang He, S. Jarvis

{"title":"A System for Dynamic Server Allocation in Application Server Clusters","authors":"Adam P. Chester, J. Xue, Ligang He, S. Jarvis","doi":"10.1109/ISPA.2008.88","DOIUrl":"https://doi.org/10.1109/ISPA.2008.88","url":null,"abstract":"Application server clusters are often used to service high-throughput web applications. In order to host more than a single application, an organisation will usually procure a separate cluster for each application. Over time the utilisation of the clusters will vary, leading to variation in the response times experienced by users of the applications. Techniques that statically assign servers to each application prevent the system from adapting to changes in the workload, and are thus susceptible to providing unacceptable levels of service. This paper investigates a system for allocating server resources to applications dynamically, thus allowing applications to automatically adapt to variable workloads. Such a scheme requires meticulous system monitoring, a method for switching application servers between text it {server pools} and a means of calculating when a server switch should be made (balancing switching cost against perceived benefits). Experimentation is performed using such a switching system on a Web application testbed hosting two applications across eight application servers. The testbed is used to compare several theoretically derived switching policies under a variety of workloads. Recommendations are made as to the suitability of different policies under different workload conditions.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130264858","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}

引用次数: 17