The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
MapReduce, as a programming model, has become an important solution to large-scale data-intensive processing. It has been widely used in various fields such as Web search, machine learning and e-commerce. Hadoop, as an open-source implementation of MapReduce, is widely used for offline massive data job. It consists of MapReduce and HDFS. In the study of Hadoop, we found data parallel in Hadoop is...
Deep packet inspection (DPI) is one of the crucial tasks in modern intrusion detection and intrusion prevention systems. It allows the inspection of packet payload using patterns. Modern DPI based systems use regular expressions to define these patterns. Deterministic finite automata (DFA) is considered to be an ideal choice for performing regular expression matching due to its O(1) processing complexity...
Recently, screen recording technology is widely used by lots of applications, such as remote control, distance learning, and distance conference etc. A problem, called Asymmetric Screen Resolution (ASR) in this paper, will occur in these applications. The ASR problem means that the resolution of a recording computer is different from that of a display computer. Different computer system will have...
In the era of multi-core processors, it is increasingly important to extract parallelism from programs. A key work to find and extract parallelism is data dependence analysis. This paper proposes to analyze the data dependences among code blocks offline, so as to save the computing time and resources with runtime execution. Offline data dependence analysis is feasible because register numbers to access...
The goal of Frequent Item set Mining (FIM) is to find the biggest number of frequently used subsets from a big transaction database. In previous studies, using the advantage of multicore computing, the execution time of an Apriori algorithm was sharply decreased: when the size of a data set was more than TBs and a single host had been unable to afford a large number of operations by using a number...
Regular expression matching is essential for many applications, such as finding patterns in text, exploring substrings in large DNA sequences, or lexical analysis. However, sequential regular expression matching may be time-prohibitive for large problem sizes. In this paper, we describe a novel algorithm for parallel regular expression matching via deterministic finite automata. Furthermore, we present...
Back projection (BP) algorithm has the ability of accurate imaging for synthetic aperture radar (SAR). However, the drawback of low computational efficiency limits the wide application of BP. In this paper, three different parallel schemes based on GPU for BP are presented. According to the features of serial structure of BP, the first two schemes are parallelized through mapping the pulse repetition...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.