检索结果-内蒙古大学图书馆

international conference on parallel and distributed Systems (ICPADS)

作者： Changjiu Xian Yung-Hsiang Lu Zhiyuan Li Department of Computer Science Purdue University West Lafayette IN USA School of Electrical and Computer Engineering Purdue University West Lafayette IN USA

This paper considers the problem of extending the battery lifetime for a portable computer by off loading its computation to a server. Depending on the inputs, computation time for different instances of a program can vary significantly and they are often difficult to predict. Different from previous studies on computation off loading, our approach does not require estimating the computation time before the execution. We execute the program initially on the portable client with a timeout. If the computation is not completed after the timeout, it is off loaded to the server. We first set the timeout to be the minimum computation time that can benefit from off loading. This method is proved to be 2- competitive. We further consider collecting online statistics of the computation time and find the statistically optimal timeout. Finally, we provide guidelines to construct programs with computation off loading. Experiments show that our methods can save up to 17% more energy than existing approaches.

关键词： Energy conservation Portable computers Batteries Network servers Computer networks Computer science Guidelines Hardware distributed computing Power engineering and energy

来源：评论

学校读者我要写书评

暂无评论

Controlling sensors and actuators collectively using the COCOS-framework

International Conference on Mobile Computing and Networking,...

引用

international conference on Mobile computing and Networking, MobiCom'07 Co-Located Workshops - Proceedings of the First ACM Workshop on Sensor and Actor networks, SANET'07 2007年 53-54页

作者： Krüger, Maik Karnapke, Reinhardt Nolte, Jörg Distributed Systems/Operating Systems group BTU Cottbus Cottbus Germany

ISBN: (纸本)9781595937353

Cocos (COordinated COmmunicating Sensors)1 is a lean middleware platform for wireless sensor and actuator networks. The major programming abstractions of Cocos are distributed sensor spaces, which enable the collective controlling of sensors or actuators on remote nodes. Thus, Cocosbrings high-level data-parallel programming conceptssuch as global reductions into the world of small networked systems. In this paper we discuss the design rationale of Cocos as well as its in-network processing and aggregation capabilities.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Cooperation of Trustworthy Peers in P2P Overlay networks

Cooperation of Trustworthy Peers in P2P Overlay Networks

引用

international conference on parallel Processing Workshops (ICPPW)

作者： Yoshio Nakajima Kenichi Watanabe Alireza Goudarzi Nemati Tomoya Enokido Makoto Takizawa S. Misbah Deen Tokyo Denki University Japan Rissho University Japan University of Keele England

In a fully distributed peer-to-peer (P2P) overlay network, peer processes (peers) cannot perceive where every object exists due to the scalability and openness. A peer has to obtain service through communicating with acquaintance peers. Here, acquaintance peers may hold obsolete information and may be even malicious. Hence, it is critical for a peer to identify which acquaintance is more trustworthy. In this paper, the trustworthiness of an acquaintance is defined in terms of the satisfiability and ranking factor. We define how satisfiable a requesting peer is for each type of access requests by newly taking into account the authorization. The ranking factor of an acquaintance shows how much the acquaintance is trusted by trustworthy acquaintances. The trustworthiness of each acquaintance is propagated in a peer-by-peer way. We evaluate how the ranking factors of acquaintances are changing in presence of faulty peers.

关键词： Permission Peer to peer computing Object detection Authorization Multimedia databases Electronic mail Scalability Computer networks parallel processing

来源：评论

学校读者我要写书评

暂无评论

Incremental In-Network RNN Search in Wireless Sensor networks

Incremental In-Network RNN Search in Wireless Sensor Network...

引用

international conference on parallel Processing Workshops (ICPPW)

作者： Yung-Chiao Tseng Chao-Chun Chen Chiang Lee Yuan-Ko Huang CSIE National Cheng Kung University Taiwan IC STUT Taiwan

With the rapid advances of wireless communication and sensor technologies, spatial queries on moving objects are increasingly important in many sensor applications. One of the most frequently used spatial queries is the reverse nearest neighbor (RNN) query that returns the objects whose nearest neighbor is the query object. RNN answers are particularly essential to the users who are under emergency circumstances. In this paper, we propose an incremental RNN search (IRS) method to answer RNN queries for moving objects in sensor networks. IRS employs a filter- verification framework to achieve the energy-efficient query processing by filtering out most objects irrelevant to the query results. To support the execution of IRS, we also design a distributed object location management scheme to reduce the amount of communication in managing moving objects. Our experimental results reveal that IRS is indeed quite promising, as it requires only a moderate amount of communications for managing moving objects as well as for processing RNN queries.

关键词： Recurrent neural networks Wireless sensor networks Nearest neighbor searches Energy efficiency Query processing Network servers Sensor systems Military computing Chaotic communication Application specific integrated circuits

来源：评论

学校读者我要写书评

暂无评论

A Service Oriented HLA RTI on the Grid

A Service Oriented HLA RTI on the Grid

引用

IEEE international conference on Web Services (ICWS)

作者： Ke Pan Stephen John Turner Wentong Cai Zengxiang Li Parallel and Distributed Computing Center School of Computer Engineering Nanyang Technological University Singapore

Modeling and simulation permeate all areas of business, science and engineering. To promote the interoperability and reusability of simulation applications and link geographically dispersed simulation components, distributed simulation was introduced. While the high level architecture (HLA) is the IEEE standard for distributed simulation, a run time infrastructure (RTI) provides the actual implementation of the HLA. With increased size and complexity of simulation applications, large amounts of distributed computational and data resources are required. The Grid provides a flexible, secure and coordinated resource sharing environment which can facilitate distributed simulation execution. In this paper, we propose a service oriented HLA RTI (SOHR) framework which provides the functionalities of an RTI as Grid services and enables large scale distributed simulations to be conducted on a heterogeneous Grid environment. The various services in SOHR can be dynamically deployed, discovered and undeployed, leading to a scalable distributed simulation environment. While the communications between simulators are through Grid service invocations, the standard HLA interface is provided as a library to increase simulator reusability and interoperability. A subset of HLA specifications was implemented in a SOHR prototype based on GT4 and the experimental results have verified the feasibility of SOHR.

关键词： Computational modeling Resource management distributed computing Computer simulation Web services Grid computing Application software Computer architecture Middleware Wide area networks

来源：评论

学校读者我要写书评

暂无评论

A distributed Deadlock Detection and Resolution Algorithm for Process networks

A Distributed Deadlock Detection and Resolution Algorithm fo...

引用

international conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Gregory E. Allen Paul E. Zucknick Brian L. Evans Applied Research Laboratories and Department of Electrical and Computer Engineering University of Texas Austin Austin TX USA

In the process network (PN) model, multiple concurrent processes communicate over unidirectional FIFO queues. PN is useful for modeling signal processing systems of streaming data, and naturally captures parallelism in these systems. PN provides formal execution properties to alleviate the difficulties of threaded and distributed programming, and naturally maps onto parallel and distributed targets. For a large class of PN, clever run-time scheduling can permit execution in bounded memory. In general, PN termination and boundedness cannot be statically determined, so correct bounded scheduling of PN requires run-time deadlock detection. We present the first algorithm that correctly performs dynamic deadlock detection and resolution for bounded scheduling of PN. The proposed algorithm is a modification of a distributed deadlock detection algorithm by Mitchell and Merritt.

关键词： System recovery Dynamic scheduling Signal processing algorithms Signal processing parallel processing Writing Laboratories distributed computing Runtime Scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

Scheduling and Data Redistribution Strategies on Star Platforms

Scheduling and Data Redistribution Strategies on Star Platfo...

引用

Euromicro conference on parallel, distributed and Network-Based Processing

作者： Loris Marchal Veronika Rehn Yves Robert Frederic Vivien Laboratoire de lE28099Informatique du Parallélisme UMR CNRS-ENS Lyon-INRIA-UCBL 5668 Lyon France

In this work we are interested in the problem of scheduling and redistributing data on master-slave platforms. We consider the case were the workers possess initial loads, some of which having to be redistributed in order to balance their completion times. We assume that the data consists of independent and identical tasks. As the general case is NP-complete in the strong sense, we propose three heuristics. Simulations consolidate the theoretical results

关键词： Processor scheduling Biology computing Computer networks Master-slave Bandwidth Application software Open source software Topology Finishing Astrochemistry

来源：评论

学校读者我要写书评

暂无评论

distributed state estimation technique for active distribution networks

Distributed state estimation technique for active distributi...

引用

international Universities Power Engineering conference (UPEC)

作者： L. Ramesh S. P. Chowdhury S. Chowdhury A. A. Natarajan Y. H. Song P. K. Goswami Dr. M.G.R. University India Jadavpur University India Womens Polytechnic India SSIT India Brunei University UK Damodar Valley Corporation India

The need for higher frequency in state estimation execution covering larger supervised networks has led to the investigation of faster and numerically more stable state estimation algorithms. However, technical developments in distributed energy management systems based on fast data communication networks open up the possibility of parallel or distributed state estimation implementation. In this paper, this possibility is exploited to derive a solution methodology based on conventional WLS distributed state estimation algorithms and an intelligent ANN technique. Numerical experiments show suitable performance of the proposed method with regard to estimation accuracy, convergence robustness and computational efficiency. The above methods are demonstrated with IEEE 37 bus distributed distribution system with comparison of simulated estimated outputs.

关键词： State estimation distributed computing Control systems Power system reliability distributed control Power system management Photovoltaic systems distributed power generation Power system stability Energy management

来源：评论

学校读者我要写书评

暂无评论

Fast Send Protocol - minimizing sending time in high-speed bulk data transfers

Fast Send Protocol - minimizing sending time in high-speed b...

引用

international conference on Digital Information Management (ICDIM)

作者： Christoph Koch Tilmann Rabl Gunther Holbling Harald Kosch Distributed Information Systems University of Passau Passau Germany

Over the last decades Internet traffic has grown dramatically. Besides the number of transfers, data sizes have risen as well. Traditional transfer protocols do not adapt to this evolution. Large-scale computational applications running on expensive parallel computers produce large amounts of data which often have to be transferred to weaker machines at the clients' premises. As parallel computers are frequently charged by the minute, it is indispensable to minimize the transfer time after computation succeeded to keep down costs. Consequently, the economic focus lies on minimizing the time to move away all data from the parallel computer whereas the actual time to arrival remains less (but still) important. This paper describes the design and implementation of a new transfer protocol, the fast send protocol (FSP), which employs striping to intermediate nodes in order to minimize sending time and to utilize the sender's resources to a high extent.

关键词： Concurrent computing Peer to peer computing Network servers Throughput Costs Grid computing Time sharing computer systems Wide area networks Transport protocols Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Efficient Simulation of Large-Scale P2P networks: Compact Data Structures

Efficient Simulation of Large-Scale P2P Networks: Compact Da...

引用

Euromicro conference on parallel, distributed and Network-Based Processing

作者： Andreas Binzenhofer Tobias Hossfeld Gerald Kunzmann Kolja Eger University of Würzburg Institute of Computer Science Germany Technical University of Munich Institute of Communication Networks Germany Department of Communication Networks Hamburg University of Technology (TUHH) Germany

One of the most important design goals of current peer-to-peer (P2P) technology is to be able to offer its service to an arbitrary large number of users. Discrete event simulation is often applied to quantitatively and qualitatively evaluate the performance and scalability of such systems before they are deployed. However, the number of users, processes and events which can be simulated is limited by both the central memory and the time available. In this paper we present compact data structures and event design algorithms, which are intended to be a further step towards efficient simulation of large scale P2P systems. In particular, we give guidelines on how to increase the number of peers which can be simulated and show how to find a good tradeoff between computational time and memory consumption in large scale P2P simulation

关键词： Large-scale systems Data structures Computational modeling Discrete event simulation Scalability Communication networks Peer to peer computing Analytical models Computer simulation Computer science

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：