In this paper, we propose a distributed power-efficient data gathering and aggregation algorithm (DPEG), in which a node, according to its residual energy and the strength of signal received from its neighboring nodes...
详细信息
The major goal of dynamic load balancing is not primarily to equalize the load on the nodes of a parallel computing system, but to optimize the average response time of single requests or the throughput of all applica...
详细信息
The major goal of dynamic load balancing is not primarily to equalize the load on the nodes of a parallel computing system, but to optimize the average response time of single requests or the throughput of all applications in the system. Therefore it is often necessary not only to keep all processors busy and all processor ready queue lengths within the same range, but to avoid delays and inefficient computations caused by foreseeable but ignored data flow and precedence constraints between related tasks. We will present concepts for dynamic consideration of inter task dependencies within small groups of tasks and evaluate them observing real applications in a load balancing environment on a network of workstations. The concepts are developed from scheduling of single task graphs towards heterogeneous multi user operation scenarios.
This paper presents a smart home system prototype which employs an indoor positioning system called the Best Beacon Match (BBM) positioning method to intelligently trigger the appropriately services for the home membe...
详细信息
ISBN:
(纸本)9783540747666
This paper presents a smart home system prototype which employs an indoor positioning system called the Best Beacon Match (BBM) positioning method to intelligently trigger the appropriately services for the home members. To overcome the ninja problem in the BBM method, the signal filtering, adjustment and smooth procedures are proposed. We employ the Zigbee module to implement the prototypes of the components for the BBM positioning method, and the prototypes were pass the ZigBee Compliant Platform (ZCP) certification test. The proposed system prototype which intelligently controls the air condition and light system for smart home applications is also verifying in our demo room and in the smart house in National Taiwan University.
Ad hoc networks became a hot topic recently, but the routing algorithm of anycast in the ad hoc networks has not yet been much explored. In this paper, we propose a mesh-based anycast routing algorithm (MARP) for ad h...
详细信息
ISBN:
(纸本)3540297693
Ad hoc networks became a hot topic recently, but the routing algorithm of anycast in the ad hoc networks has not yet been much explored. In this paper, we propose a mesh-based anycast routing algorithm (MARP) for ad hoc networks. The proposed routing model is robust and reliable, which can solve the unsteady topology problem in ad hoc networks. The future work is discussed at the end of this paper.
The proceedings contain 95 papers. The topics discussed include: a parallel FPT application for clusters;a synthesis of parallel out-of-core sorting programs on heterogeneous clusters*;noncontiguous I/O accesses throu...
ISBN:
(纸本)0769519199
The proceedings contain 95 papers. The topics discussed include: a parallel FPT application for clusters;a synthesis of parallel out-of-core sorting programs on heterogeneous clusters*;noncontiguous I/O accesses through MPI-IO;leveraging non-uniform resources for parallel query processing;a performance oriented migration framework for the grid*;scheduling distributedapplications: the SimGrid simulation framework;fair share on high performance computing systems: what does fair really mean?;distributed computing with hierarchical master-worker paradigm for parallel branch and bound algorithm;programming for dependability in a service-based grid;improving access to multi-dimensional self-describing scientific datasets*;and merging the CCA component model with the OGSI framework.
Response time predictions for workload on new server architectures can enhance Service Level Agreement-based resource management. This paper evaluates two performance prediction methods using a distributed enterprise ...
详细信息
Response time predictions for workload on new server architectures can enhance Service Level Agreement-based resource management. This paper evaluates two performance prediction methods using a distributed enterprise application benchmark. The historical method makes predictions by extrapolating from previously gathered performance data, while the layered queuing method makes predictions by solving layered queuing networks. The methods are evaluated in terms of: the systems that can be modelled;the metrics that can be predicted;the ease with which the models can be created and the level of expertise required;the overheads of recalibrating a model;and the delay when evaluating a prediction. The paper also investigates how a prediction-enhanced resource management algorithm can be tuned so as to compensate for predictive inaccuracy and balance the costs of SLA violations and server usage.
作者：
Schikuta, EUniv Vienna
Inst Knowledge & Business Engn Res Lab Computat Technol & Applicat A-1010 Vienna Austria
We develop a concise but comprehensive analytical model for the well-known Nested Loop Join algorithm on cost effective cluster architectures. We concentrate on a limited number of characteristic parameters to keep th...
详细信息
ISBN:
(纸本)3540297693
We develop a concise but comprehensive analytical model for the well-known Nested Loop Join algorithm on cost effective cluster architectures. We concentrate on a limited number of characteristic parameters to keep the analytical model clear and focused. We believe that a meaningful model can be built upon only three characteristic parameter sets, describing main memory size, the I/O bandwidth and the disk bandwidth. We justify our approach by a practical implementation and a comparison of the theoretical and real performance values.
Workstation networks are an underutilized yet valuable resource for solving large-scale parallel problems. In this paper, we present `idle-initiated' techniques for efficiently scheduling large-scale parallel comp...
详细信息
Workstation networks are an underutilized yet valuable resource for solving large-scale parallel problems. In this paper, we present `idle-initiated' techniques for efficiently scheduling large-scale parallel computations on workstation networks. By `idle-initiated,' we mean that idle computers actively search out work to do rather than wait for work to be assigned. The idle-initiated scheduler operates at both the macro and the micro levels. On the macro level, a computer without work joins an ongoing parallel computation as a participant. On the micro level, a participant without work `steals' work from some other participant of the same computation. We have implemented these scheduling techniques in Phish, a portable system for running dynamic parallelapplications on a network of workstations.
This paper describes a very high-level approach that aims to orchestrate sequential components written using high-level domain-specific programming into high-performance parallelapplications. By achieving this goal, ...
详细信息
ISBN:
(纸本)9780769534718
This paper describes a very high-level approach that aims to orchestrate sequential components written using high-level domain-specific programming into high-performance parallelapplications. By achieving this goal, we hope to make parallel programming more accessible to experts in mathematics, engineering and other domains. A key feature of our approach is that parallelism is achieved without any modification to the underlying sequential computational algebra systems, or to the user-level components: rather, all orchestration is performed at an outer level, with sequential components linked through a standard communication protocol, the Symbolic Computing Software Composability Protocol, SCSCP Despite the generality of our approach, our results show that we are able to achieve very good, and even, in some cases, super-linear speedups on clusters of commodity workstations: up to a factor of 33.4 on a 28-processor cluster We are, moreover, able to parallelise a wider variety of problem, and achieve higher performance than typical specialist parallel computational algebra implementations.
Some trading strategies are becoming more and more complicated and utilize a large amount of data, which makes the backtesting of these strategies very time consuming. This paper presents an efficient implementation o...
详细信息
ISBN:
(纸本)3540297693
Some trading strategies are becoming more and more complicated and utilize a large amount of data, which makes the backtesting of these strategies very time consuming. This paper presents an efficient implementation of the backtesting of such a trading strategy using a parallel genetic algorithm (PGA) which is fine tuned based on thorough analysis of the trading strategy. The reuse of intermediate results is very important for such backtesting problems. Our implementation can perform the backtesting within a reasonable time range so that the tested trading strategy can be properly deployed in time.
暂无评论