Hardware accelerators based on field programmable gate array (FPGA) and system chip (SoC) devices have gained attention in recent years. One of the main reasons is that these contain reconfigurable logic, which makes them feasible for boosting performance applications. High-level synthesis (HLS) tools facilitate creation FPGA code from a high level abstraction using different directives to obtain an optimized hardware design metrics. However, complexity space depends factors such as number...

This paper proposes a cache hierarchy that enables Web search engines to efficiently process user queries. The different caches in the are used store pieces of data which useful solve frequent Cached items range from specific such as query answers generic segments index retrieved secondary memory. also presents comparative study based on discrete-event simulation and bulk-synchronous parallelism. studied performance metrics include overall throughput, single-user latency power consumption....

We present a general method of parallel query processing that allows scalable performance on distributed inverted files. The the realization hybrid combines advantages document and term partitioned

This paper proposes a strategy to organize metric-space query processing in multi-core search nodes as understood the context of engines running on clusters computers. The is applied each node process all active queries visiting part their solution which, general, for computed from contribution node. When traffic high enough, proposed assigns one thread and lets them work fully asynchronous manner. moderate or low, some threads start idle so they are put being processed by other threads....

Summary Data abundance poses the need for powerful and easy‐to‐use tools that support processing large amounts of data. MapReduce has been increasingly adopted over a decade by many companies, more recently, it attracted attention an increasing number researchers in several areas. One main advantage is complex details parallel processing, such as network programming, task scheduling, data placement, fault tolerance, are hidden conceptually simple framework. supported mature software...

Modeling large scale Web Search Engines (WSEs) is a complex task. It involves many issues such as representing user's behavior, query traffic, several strategies and heuristics to improve response time, etc. Typically, WSEs are composed of services deployed in data centers, which must interact get the best document results user queries. Additionally, hardware specification like multithreading network communications have be taken into account. In this paper, we propose model service-based WSE...

A simulation methodology is proposed to evaluate the performance of large-scale Web search engines hosted by datacenters. The salient features are use models parallel computing overcome complexities associated with hardware and system software details; a circulating tokens approach represent sequences operations that compete for engine resources; benchmark programs measure cost relevant operations; simulations driven real user traces consider dynamics behavior. An experimental evaluation...

Modeling large scale Web Search Engines (WSEs) is a complex task. It involves many issues such as representing user's behavior, query traffic, several strategies and heuristics to improve response time, etc. Typically, WSEs are composed of services deployed in data centers, which must interact get the best document results user queries. Additionally, hardware specification like multithreading network communications have be taken into account. In this paper, we propose model servicebased WSE...

Large-scale computer platforms that process users’ online requests must be capable of handling unexpected spikes in arrival rates. These platforms, which are composed distributed components, can configured with parameters to ensure both the quality results obtained for each request and low response times. In this work, we propose a dynamic optimization engine based on metric space indexing address problem. The is integrated into platform periodically monitors performance metrics determine...

Brain-computer interface (BCI-MI)-based wheelchair control is, in principle, an appropriate method for completely paralyzed people with a healthy brain. In BCI-based system, pattern recognition terms of preprocessing, feature extraction, and classification plays significant role avoiding errors, which can lead to the initiation wrong command that will put user unsafe condition. Therefore, this research's goal is create time-domain generic model (GPRM) two-class EEG-MI signals use system.This...

This paper studies the problem of distributing a metric-space search index based on compact clustering onto set distributed memory processors. The aim is enabling efficient similarity in large-scale Web engines. data structure composed clusters enclosing database objects and we propose distribution methods two different solution approaches. first one makes use specific knowledge about work-load generated by user queries. Here challenge how to represent such into method capable producing...

This paper proposes using Coloured Petri Nets to model performance of vertical search engines for Web search. In such systems, queries submitted by users or client systems are handled different components implemented as services deployed on large

Large scale Web search engines are complex and highly optimized systems devised to operate on dedicated clusters of processors. Any, even a small, gain in performance is beneficial economical operation given the large amount hardware resources deployed respective data centers. Performance fully dependent users behavior which featured by unpredictable drastic variations trending topics arrival rate intensity. In this context, discrete-event simulation powerful tool either predict new...

Processing queries in Web search engines demands the efficient use of hardware resources to cope with scale and dynamics user traffic. This paper focuses on multithreaded processing that requires (1) accessing a large inverted index data structure obtain set documents, (2) rank them by executing WAND operator order top K most pertinent documents for query, (3) resolve insertion new concurrently execution queries. We propose an strategy assign threads update operations which is suitable...