This paper proposes a distributedparallel processing of Queen Ant Strategy named "ASqueen" which imitated an ant society where a queen ant governs. It is noted that the proposed processing method achieves &...
详细信息
A Mobile Ad hoc NETwork (MANET) is an autonomous system of mobile nodes connected by wireless links There is no static infrastructure such as base station as that was in cell mobile communication. Due to the dynamic n...
详细信息
ISBN:
(纸本)0769524052
A Mobile Ad hoc NETwork (MANET) is an autonomous system of mobile nodes connected by wireless links There is no static infrastructure such as base station as that was in cell mobile communication. Due to the dynamic nature of the network topology and restricted resources, quality of service (QoS) and multicast routing in MANET is a challenging task In this paper, we present an entropy-based model to support QoS multicast routing optimization algorithm in mobile ad hoc networks (EQMOA). The basic motivations or the proposed modeling approach stem from the commonality observed in the location uncertainty in mobile ad hoc wireless networks and the concept of entropy. The simulation results demonstrate that the proposed approach and parameters provide an accurate and efficient method of estimating and evaluating the route stability in dynamic mobile networks.
Numerical methods based on interval arithmetic ore efficient means to reliably solve nonlinear systems of equations. Algorithm bc3revise is an interval method that tightens variables' domains by enforcing a proper...
详细信息
ISBN:
(纸本)9780769534435
Numerical methods based on interval arithmetic ore efficient means to reliably solve nonlinear systems of equations. Algorithm bc3revise is an interval method that tightens variables' domains by enforcing a property called box consistency. It has been successfully used on difficult problems whose solving eluded traditional numerical methods. We present a new algorithm to enforce box consistency that is simpler than bc3revise, faster and easily data parallelizable. A parallel implementation with Intel SSE2 SIMD instructions shows that an increase in performance of up to an order of magnitude and more is achievable.
Metacube is an attractive, hypercube-like interconnection network that can connect an extremely large number of nodes with a small node degree while keeping a relatively short diamemter A Metacube MC(k, m) connects 2(...
详细信息
ISBN:
(纸本)9780769534435
Metacube is an attractive, hypercube-like interconnection network that can connect an extremely large number of nodes with a small node degree while keeping a relatively short diamemter A Metacube MC(k, m) connects 2(2km+k) nodes with only k + m links per node. Metacube can be used to build parallelcomputing systems of very large scale with a small number of links per node. In this paper we propose a new presentation of Metacube for algorithmic design on Metacube. Based on the new presentation, we give an efficient algorithm for parallel prefix computation on Metacubes that runs in 2(k)m(k + 1) + k communication steps and 2(k+1) m + 2k computation steps.
In this paper, we propose an algorithm for parallel sorting on Recursive Dual-Net with an m-cube (Qm) as its base network. The Recursive Dual-Net RDNκ(Qm) for k > 0 has 2 2κm+2κ-1 nodes and m+ κ links per node....
详细信息
In the paper, we propose a generic parallelcomputing model for the distributedcomputing platforms. This model is built on the top of the popular CORBA middleware in order to ensure easy distribution of the software ...
详细信息
ISBN:
(纸本)9780769527369
In the paper, we propose a generic parallelcomputing model for the distributedcomputing platforms. This model is built on the top of the popular CORBA middleware in order to ensure easy distribution of the software components along the participating computers. We use the concept of factory objects in the model to create slave objects dynamically to fulflll the master/slave parallelcomputing paradigm. The speedup of the experiment programs using our proposed model is measured and compared with the corresponding A PI implementation. The experiment results show that our model is not only a feasible model for designing parallel programs with CORBA but also an efficient way in comparison to the MPI implementation.
The development of numerical simulation software tools for the solution of real-world problems usually calls for domain experts in modeling. The GraPA framework,, as an abstraction layer on top of hardware characteris...
详细信息
ISBN:
(纸本)9780769534435
The development of numerical simulation software tools for the solution of real-world problems usually calls for domain experts in modeling. The GraPA framework,, as an abstraction layer on top of hardware characteristics, supports modelers in two respects: one is the built-in support for co-processing of multiple models and the other is the generically delivered high performance achieved by implementing concurrency features of multicore and distributed memory architectures. Technically, GraPA is designed as a C++ template framework, where the modeler's data structures and algorithms instantiate the framework. Using this approach, we handle parallel processing of lock-free data structures and message passing transperently to the modelers. In this paper, we report on the status of the implementation of GraPA and on its performance characteristics.
A hybrid P2P system, such as Napster, has a central directory where the peers publish information about the content they offer for sharing. We study the incentives for self-interested node's participating in such ...
详细信息
ISBN:
(纸本)0769524052
A hybrid P2P system, such as Napster, has a central directory where the peers publish information about the content they offer for sharing. We study the incentives for self-interested node's participating in such P2P system with centralized directory, by developing the new cost model of P2P network In our model, a node will participate the system if and only if it can get more than it gives. We discover several interesting conclusions on the character of the participating. There is probably a threshold value in such P2P systems, that is, the system is unstable when the number of its nodes is less than the threshold and the system is,table and self-developing when its size exceeding the thresh-old.
For simultaneous multithreaded (SMT) processors, a large rename register file (RRF) is indispensable for holding intermediate results of in-flight instructions from multiple threads. Meanwhile, inter-thread interferen...
详细信息
ISBN:
(纸本)0769524052
For simultaneous multithreaded (SMT) processors, a large rename register file (RRF) is indispensable for holding intermediate results of in-flight instructions from multiple threads. Meanwhile, inter-thread interferences lower the efficiency of RRF badly, exacerbating the pressure on RRF design. We propose Thread-Sensitive Register Renaming (TSRR), which tracks the performance variations and dynamically tunes the amount of rename registers available to each thread. In contrast to the traditional fully-shared RRF this partly-shared scheme of TSRR guarantees (1) each thread has opportunities to fully exhibit its performance potential, (2) each thread can occupy just a reasonable number of rename registers, eliminating harmful inter-thread conflicts, and (3) the poorest-performance thread neither hinder other threads nor starve itself.
This paper presents a novel video service system DCSVS (distributed Collaborative Set-top-box Video Service), which encompasses several practical and effective solutions to both Live and VoD (Video-on-Demand) services...
详细信息
ISBN:
(纸本)9780769534435
This paper presents a novel video service system DCSVS (distributed Collaborative Set-top-box Video Service), which encompasses several practical and effective solutions to both Live and VoD (Video-on-Demand) services. DCSVS is established on an overlay DHT (distributed Hash Table) network, which improves Kademlia Protocol to fit for Real-Time application. We use several types of Pre-Fetching to enhance continuity rate of VoD service, and we employ an effective scheduling algorithm based on transferring priorities. We design the Inner-First and Proxy-Forward strategy to relieve transferring failure, and we use Window-based storage and hashing to achieve better system performance. Both theoretical analysis and experimental results show that strategies in DCSVS perform well in terms of efficiency and robustness, and could maintain a fine state and scalability in large-scale networking.
暂无评论