A bridging model for parallel computation
Communications of the ACM
ACM Transactions on Information Systems (TOIS)
A pipelined architecture for distributed text query evaluation
Information Retrieval
A Search Engine Accepting On-Line Updates
Euro-Par '07 Proceedings of the 13th European international conference on Parallel Processing
Exploiting Hybrid Parallelism in Web Search Engines
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
A Bridging Model for Multi-core Computing
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
High-performance priority queues for parallel crawlers
Proceedings of the 10th ACM workshop on Web information and data management
Using graphics processors for high performance IR query processing
Proceedings of the 18th international conference on World wide web
Improved techniques for result caching in web search engines
Proceedings of the 18th international conference on World wide web
Database systems on virtual machines: How much do you lose?
ICDEW '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering Workshop
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Approximate parallel simulation of web search engines
Proceedings of the 2013 ACM SIGSIM conference on Principles of advanced discrete simulation
Modelling Search Engines Performance Using Coloured Petri Nets
Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012
| Hi-index | 0.00 |
Search nodes are single-purpose components of large Web search engines and their efficient implementation is critical to sustain thousands of queries per second and guarantee individual query response times within a fraction of a second. Current technology trends indicate that search nodes ought to be implemented as multi-threaded multi-core systems. The straightforward solution that system designers can apply in this case is simply to follow standard practice by deploying one asynchronous thread per active query in the node and attaching each thread to a different core. Each concurrent thread is responsible for sequentially processing a single query at a time. The only potential source of read/write conflicts among threads are the accesses to the different application caches present in the search node. However, new Web applications pose much more demanding requirements in terms of read/write conflicts than recent past applications since now data updates must take place concurrently with query processing. Insisting on the same paradigm of concurrent threads now augmented with a transaction concurrency control protocol is a feasible solution. In this paper we propose a more efficient and much simpler solution which has the additional advantage of enabling a very efficient administration of application caches. We propose performing relaxed bulk-synchronous parallelism at multi-core level.