the proceedings contain 109 papers. the topics discussed include: an intrusion detection architecture for ad hoc network based on artificial immune system;conditional fault-tolerant hamiltonicity of twisted cubes;cond...
详细信息
ISBN:
(纸本)0769527361
the proceedings contain 109 papers. the topics discussed include: an intrusion detection architecture for ad hoc network based on artificial immune system;conditional fault-tolerant hamiltonicity of twisted cubes;conditional fault-tolerant hamiltonicity of star graphs;merging source and shared trees multicast in MPLS networks;java annotated concurrency based on the concurrent package;a high-efficiency vector interpolator using redundant CORDIC arithmetic in power-aware 3D graphics rendering;error-diffusion kernel estimation using least squares;remote sensing images classification/data fusion using distance weighted multiple classifiers systems;image encryption and decryption using SCAN methodology;an attribute-based access control model for web services;administrative usage control model for secure interoperability;an efficient assignment of transmission opportunity in qos guaranteed wireless LAN;and k-MCore for multicasting on mobile ad hoc networks.
this paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O(δ) time and message complexity where a is the maximum size of a two-hop neighborhoo...
详细信息
ISBN:
(纸本)1595933689
this paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O(δ) time and message complexity where a is the maximum size of a two-hop neighborhood in a wireless network while message complexity remains O(δ), assuming that message delays can be bounded by an unknown constant. DRAND is the first fully distributed version of RAND. the algorithm is suitable for a wireless network where most nodes do not move, such as wireless mesh networks and wireless sensor networks. We implement the algorithm in TinyOS and demonstrate its performance in a real testbed of Mica2 nodes. the algorithm does not require any time synchronization and is shown to be effective in adapting to local topology changes without incurring global overhead in the scheduling. Because of these features, it can also be used even for other scheduling problems such as frequency or code scheduling (for FDMA or CDMA) or local identifier assignment for wireless networks where time synchronization is not enforced. Copyright 2006 ACM.
the traditional technique to simulate physical systems modeled by partial differential equations is by means of a time-stepped methodology where the state of the system is updated at regular discrete time intervals. T...
详细信息
ISBN:
(纸本)3540290672
the traditional technique to simulate physical systems modeled by partial differential equations is by means of a time-stepped methodology where the state of the system is updated at regular discrete time intervals. this method has inherent inefficiencies. Recently, we proposed [1] a new asynchronous formulation based on a discrete-event-driven (as opposed to time-driven) approach.. where the state of the simulation is updated on a '' need-to-be-done-only '' basis. Using a serial electrostatic implementation, we obtained more than two orders of magnitude speedup compared with traditional techniques. Here we examine issues related to the parallel extension of this technique and discuss several different parallel strategies. In particular, we present in some detail a newly developed discrete-event based parallel electromagnetic hybrid code and its performance using conservative synchronization on a cluster computer. these initial performance results are encouraging in that they demonstrate very good parallel speedup for large-scale simulation computations containing tens of thousands of cells, though overheads for inter-processor communication remain a challenge for smaller computations.
We describe some extensions to parallel Sparse BLAS (PSBLAS), a library of routines providing basic Linear Algebra operations needed to build iterative sparse linear system solvers on distributed-memory parallel compu...
详细信息
Recently there have been considerable interests focusing on the performance evaluation of IEEE 802.11e Medium Access Control (MAC) protocols, which were proposed for supporting Quality of Services (QoS) in Wireless Lo...
详细信息
SMP Clusters with fat nodes offer an interesting capability for large applications that employ a hybrid parallelization model: to improve load balance, the number of threads can be increased in order to speed-up busy ...
详细信息
the proceedings contain 65 papers. the topics discussed include: decision table based analysis of trading models;a three-layer model for software engineering metrics;design phase analysis of software qualities using a...
详细信息
ISBN:
(纸本)076952611X
the proceedings contain 65 papers. the topics discussed include: decision table based analysis of trading models;a three-layer model for software engineering metrics;design phase analysis of software qualities using aspect-oriented programming;applying dynamic change impact analysis in component-based architecture design;transforming linear terms of algebraic specifications into extended pomsets;an extension of robustness slicing algorithm based on dynamic array;text classification by combining different distance functions with weights;network intrusion detection through genetic feature selection;minimizing multicast communication latency in WAN-based environment;a software tool for network traffic analysis;topology control and mobility management in mobile Ad Hoc Networks;approximation algorithm for maximum lifetime in wireless sensor networks with data aggregation;and a survey of software estimation techniques and project planning practices.
Data Warehouses (DWs) with large quantities of data present major performance and scalability challenges, and parallelism can be used for major performance improvement in such context. However instead of costly specia...
详细信息
Data Warehouses (DWs) with large quantities of data present major performance and scalability challenges, and parallelism can be used for major performance improvement in such context. However instead of costly specialized parallel hardware and interconnections, we focus on low-cost standard computing nodes, possibly in a non-dedicated local network. In this environment, special care must be taken with partitioning and processing. We use experimental evidence to analyze the shortcomings of a basic horizontal partitioning strategy designed for that environment, then propose and test improvements to allow efficient placement for the lowcost Node Partitioned Data Warehouse. We show experimenially that extra overheads related to processing large replicated relations and repartitioning requirements between nodes can significantly degrade speedup performance for many query, patterns. We analyze a simple, easy to-apply partitioning and placement decision that achieves good performance improvement results. Our experiments and discussion provide important insight into partitioning and processing issues for data warehouses in shared-nothing environments.
An effective approach for improving the efficiency of multi-scale combustion simulations is the use of on-line scientific databases. these databases allow for the approximation of computationally expensive functions b...
详细信息
Micro-payment systems have the potential to provide non-intrusive, high-volume and low-cost payas-you-use services for a wide variety of web-based applications. Previously we have developed NetPay, an off-line micro-p...
详细信息
暂无评论