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.
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.
BitTorrent is a popular, open-source content distribution system that is conducive for distribution of large-volume files. In this paper, we first model the parallel downloading problem as directed graph and discuss p...
详细信息
Internet computing and Grid technologies promise to change the way we tackle complex problems. Harnessing these new technologies effectively, it will transform scientific disciplines ranging from high-energy physics t...
详细信息
ISBN:
(纸本)0769524052
Internet computing and Grid technologies promise to change the way we tackle complex problems. Harnessing these new technologies effectively, it will transform scientific disciplines ranging from high-energy physics to life sciences. This paper describes a metropolitan-scale Grid computing platform named TIGER Project (standing for Taichung Integrating Grid Environment and Resource), which basically interconnects universities and high schools' cluster computing resources and sharing available resources among them, for investigations in system technologies and high performance applications. This novel project shows the viability of implementation of such project in a metropolitan city.
distributedapplications operating in pervasive computing environment should have abilities to cope with the high heterogeneity and variability of this environment. In a high abstract level, the dynamic software archi...
详细信息
In this paper, we present our efforts to parallelize an unstructured quadrilateral mesh generator. Its serial version is based on the divider-and-conquer idea, and mainly includes two stages, i.e. geometry decompositi...
详细信息
ISBN:
(纸本)0769524052
In this paper, we present our efforts to parallelize an unstructured quadrilateral mesh generator. Its serial version is based on the divider-and-conquer idea, and mainly includes two stages, i.e. geometry decomposition and mesh generation. Both stages are parallelized separately. A highly efficient fine-grain level parallel scheme is presented to parallelize the stage of geometry decomposition. A SubDomain Graph (SDG), which represents the connections of subdomains, is constructed The task of parallel mesh generation is then reduced to that of the SDG partitioning. Since the number of elements in subdomains could be pre-computed before meshing, a static load balancing scheme to partition the SDG performs well with the aid of Metis tools. Numerical results show that scalable timing performance could be achieved by using the parallel mesh generator with resulting meshes nicely partitioned among processors, which enables a fast parallel simulation environment by eliminating the traditional 110-busy process of mesh repartitioning.
Discrete Fourier transform (DFT) has many applications in digital signal and image processing and other scientific and technological domains, but its time complexity of direct computation is O(n2), limiting greatly it...
详细信息
Extracting thread-level parallelism, as well as instruction-level one, is greatly expected for modern microprocessors. Speculative multithreading is one of the most hopeful candidates, although, its performance improv...
详细信息
ISBN:
(纸本)0769524052
Extracting thread-level parallelism, as well as instruction-level one, is greatly expected for modern microprocessors. Speculative multithreading is one of the most hopeful candidates, although, its performance improvement depends on prediction accuracy. On the other hand, profiling techniques can accelerate programs since it can reflect the programs' actual behavior This paper focuses our discussion on utilizing path-based profiling results in improving speculative multithreaded codes. Programs have many conditional branches thus many possible paths arise, however actually executed paths are very limited. Thus we show that most frequent two paths are sufficient candidates for prediction and speculation, and we present a novel speculation method, two-path limited speculation. Furthermore, we present a simple path predictor based on two level branch predictor Analytical and trace-driven evaluation results show the effectiveness of the proposed method.
How to improve the performance of content searching in peer-to-peer (P2P) systems is a challenging issue. In this paper we attack this problem by proposing a new decentralized P2P architecture ontoloy-based community ...
详细信息
ISBN:
(纸本)0769524052
How to improve the performance of content searching in peer-to-peer (P2P) systems is a challenging issue. In this paper we attack this problem by proposing a new decentralized P2P architecture ontoloy-based community overlays. The system exploits the semantic property of the content in the network to cluster nodes sharing similar interest together to improve the query and searching performance. Specifically, a distributed hash table (DHT) based overlay is constructed to assist peers organizing into communities. Those peers in the same community form a Gnutella-like unstructured overlay. This architecture helps reduce the search time and decrease the network traffic by minimizing the number of messages propagated in the system. Moreover, it retains the desirable properties of existing unstructured architectures, including being fully decentralized with loose structure, and supporting complex queries. We demonstrate by simulation, that with this architecture, peers can get more relevant resources faster and with less traffic generated.
暂无评论