Name
Abstract | ||
|---|---|---|
Publish/subscribe systems form an important communication paradigms in distributed systems. However, how to leverage current chip multi-processors to increase throughput and reduce the matching time still need further research. In this paper, we present and implement two types of parallel matching algorithms. Experiments show that relatively independent matching algorithm produces similar throughput as complete independent matching algorithm and the average matching time of collaborative matching algorithm is reduced by approximately 77% as the number of threads increases from one to six. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/ITNG.2011.113 | ITNG |
Keywords | Field | DocType |
parallel matching algorithms,parallel processing,important communication paradigm,similar throughput,rdf,complete independent matching algorithm,current chip multi-processors,threads increase,parallel matching algorithm,subscribe system,collaborative matching algorithm,matching time,independent matching algorithm,matching algorithm,parallel algorithm,middleware,multiprocessor,average matching time,publish/subscribe,publish system,distributed system,scalability,resource description framework,throughput,publish subscribe,instruction sets,ontologies,approximation algorithms | Middleware,Approximation algorithm,Instruction set,Parallel algorithm,Computer science,Algorithm,Thread (computing),Throughput,Blossom algorithm,Scalability,Distributed computing | Conference |
ISBN | Citations | PageRank |
978-0-7695-4367-3 | 1 | 0.35 |
References | Authors | |
16 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jianfeng Qian | 1 | 17 | 2.28 |
| Jianwei Yin | 2 | 805 | 89.86 |
| Jinxiang Dong | 3 | 311 | 65.36 |