Abstract-This paper proposes a strategy to organize metricspace query processing in multi-core search nodes as understood in the context of search engines running on clusters of computers. The strategy is applied in each search node to process all active queries visiting the node as part of their solution which, in general, for each query is computed from the contribution of each search node. When query traffic is high enough, the proposed strategy assigns one thread to each query and lets them work in a fully asynchronous manner. When query traffic is moderate or low, some threads start to idle so they are put to work on queries being processed by other threads. The strategy solves the associated synchronization problem among threads by switching query processing into a bulk-synchronous mode of operation. This simplifies the dynamic re-organization of threads and overheads are very small with the advantage that the overall work-load is evenly distributed across all threads.
In terms of shared memory, REF proposes a strategy to organize metric-space query processing in multi-core search Algorithm 1 Spaghettis: Search Algorithm.
Scheduling Metric-Space Queries Processing on Multi-Core Processors
2010 18th Euromicro Conference on Parallel, Distributed and Network-based Processing
2010 18th Euromicro Conference on Parallel, Distributed and Network-based Processing
Computer Science