Topic
Degree of parallelism
About: Degree of parallelism is a research topic. Over the lifetime, 1515 publications have been published within this topic receiving 25546 citations.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: A new distributed MapReduce prototype generation method called CHI-PG is introduced that provides a linear O(N) time complexity and ensures constant accuracy regardless of the degree of parallelism and has been shown to be a candidate solution to the time and memory constraints of k-Nearest Neighbors when tackling large-scale datasets.
19 citations
••
01 Dec 1999TL;DR: This paper formalizes the ILP task as a generalized branch-and-bound search and proposes three methods of parallel executions for the optimal search and these methods are implemented in KL1, a parallel logic programming language, and are analyzed for execution speed and load balancing.
Abstract: This paper describes a parallel algorithm and its implementation for a hypothesis space search in Inductive Logic Programming (ILP). A typical ILP system, Progol, regards induction as a search problem for finding a hypothesis, and an efficient search algorithm is used to find the optimal hypothesis. In this paper, we formalize the ILP task as a generalized branch-and-bound search and propose three methods of parallel executions for the optimal search. These methods are implemented in KL1, a parallel logic programming language, and are analyzed for execution speed and load balancing. An experiment on a benchmark test set was conducted using a shared memory parallel machine to evaluate the performance of the hypothesis search according to the number of processors. The result demonstrates that the statistics obtained coincide with the expected degree of parallelism.
18 citations
••
TL;DR: This paper proposes two heuristic thread-partitioning methods to solve a fundamental problem in compiling for multithreaded architectures, automatically partitioning a program into threads and shows that both partitioning algorithms are effective to generate efficient threaded code, and code generated by the compiler is comparable to hand-written code.
18 citations
••
TL;DR: Two subproblems known as the exact matching and the k-mismatches problems are covered and efficient parallel hardware algorithms for string matching are presented.
18 citations
••
05 Jan 1999TL;DR: Three parallel algorithms based on multiple input (and output) streams are presented and three different methods to design special purpose systolic array hardware for string matching are presented.
Abstract: This paper presents efficient dataflow schemes for parallel string matching. Two subproblems known as the exact matching and the k-mismatches problems are covered. Three parallel algorithms based on multiple input (and output) streams are presented. Time complexities of these parallel algorithms are O((n/d)+/spl alpha/), O/spl les//spl alpha//spl les/m, where n and m represent lengths of reference and pattern strings (n/spl Gt/m) and d represents the number of streams used (the degree of parallelism). We can control the degree of parallelism by using variable number (d) of input (and output) streams. These performances are better than those found in the literature. These algorithms present three different methods to design special purpose systolic array hardware for string matching. With linear systolic array architecture, m PEs are needed for serial design and d*m PEs are needed for parallel design.
18 citations