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.
Configuration for products in the distributed and dynamic computing environment motivates the demand for semantic based cooperation. Stand-alone data model of configuration systems does not meet the new requirements. ...
详细信息
View-Oriented parallel Programming is based on distributed Shared Memory which is friendly and easy for programmers to use. It requires the programmer to divide shared data into views according to the memory access pa...
详细信息
In this paper we give a parallel algorithm for the longest increasing subsequence problem on a LARPBS, one of the recently proposed parallel model based on optical bus. For a sequence of n integers, we solve the longe...
详细信息
ISBN:
(纸本)9780769530499
In this paper we give a parallel algorithm for the longest increasing subsequence problem on a LARPBS, one of the recently proposed parallel model based on optical bus. For a sequence of n integers, we solve the longest increasing subsequence problem in O(k) time using n processors where k is the length of the solution. Then, we give an algorithm for the maximal layers problem that runs in O(k+log(n)) time for a set of n points where k is the number of layers on a n-processor array. To our knowledge, this is the fastest algorithm for that problem.
In recent years, network bandwidth and quality has been drastically improved in a speed even much faster than the enhancement of computer performance. Various communication and computing tasks in the fields can be int...
详细信息
ISBN:
(纸本)9780769527369
In recent years, network bandwidth and quality has been drastically improved in a speed even much faster than the enhancement of computer performance. Various communication and computing tasks in the fields can be integrated and applied in a distributed system in nowadays. However, those resources are heterogeneous and dynamic in distributed systems connecting a broad range of resources. This study proposed a hybrid load balancing policy to maintain performance and stability of distributed system.
Many of the current service-oriented architectures are built on top of distributed object technologies. These technologies have, however, lost most of their initial appeal, mainly due to the inability to port their co...
详细信息
To overcome the disadvantages of existing algorithms in scheduling distributed real-time tasks, this paper proposes a post-scheduling optimization algorithm (PSO) based on a novel structure called Scheduled Clusters T...
详细信息
The dynamical Grid environment requires flexible and adaptive workflow system. This paper integrates Agents and Web Services into Grid Service Workflow System based on Colored Petri Nets. The combination of Agents and...
详细信息
With the rising demand on internet online services, more and more individuals and organizations migrate their data and services from local to geographically distributed internet data centers for reliability, managemen...
详细信息
Scheduling tasks onto the processors of a parallel system is a crucial part of program parallelisation. Due to the NP-hard nature of the task scheduling problem, scheduling algorithms are based on heuristics that try ...
详细信息
ISBN:
(纸本)9780769534435
Scheduling tasks onto the processors of a parallel system is a crucial part of program parallelisation. Due to the NP-hard nature of the task scheduling problem, scheduling algorithms are based on heuristics that try to produce good rather than optimal schedules. Nevertheless, in certain situations it is desirable to have optimal schedules, for example for time critical systems or to evaluate scheduling heuristics. This paper investigates the task scheduling problem using A* search algorithm. The A* scheduling algorithm implemented can produce optimal schedules in reasonable time for small to medium sized task graphs. In comparison to a previous approach, the here presented A* scheduling algorithm has a significantly reduced search space due to a much improved cost function f (s) and additional pruning techniques. Last but not least, the experimental results show that the proposed A* scheduling algorithm significantly outperforms the previous approach.
暂无评论