A parallel algorithm for enumerating combinations (original) (raw)
2003, 2003 International Conference on Parallel Processing, 2003. Proceedings.
Related papers
A Step-by-Step Extending Parallelism Approach for Enumeration of Combinatorial Objects
2010
We present a general step-by-step extending approach to parallel execution of enumeration of combinatorial objects (ECO). The methodology extends a famous enumeration algorithm, OrderlyGeneration, which allows concurrently generating all objects of size n + 1 from all objects of size n. To the best of our knowledge, this is the first time there is an attempt to plug parallel computing into OrderlyGeneration algorithm for ECO problem. The potential impact of this general approach could be applied for many different servants of ECO problem on scientific computing areas in the future. Our work has applied this strategy to enumerate Orthogonal Array (OA) of strength t, a typical kind of combinatorial objects by using a implementation with MPI paradigm. Several initial results in relation to speedup time of the implementation have been analyzed and given significant efficiency of the proposed approach.
1 Logic Design of Fpga-Based Combinatorial Processor
This paper addresses the design of a Reprogrammable Combinatorial Processor (RCP) on the basis of reconfigurable circuits such as FPGA. The RCP is intended to be used for solving different combinatorial problems formulated over discrete matrices. From a structural point of view the RCP is a composition of a Reconfigurable Control Unit (RCU) and a Reconfigurable Function Unit (RFU). Each unit consists of hardwired (fixed) and programmable components. The paper considers and analyses methods, which can be used for logic synthesis and optimisation of RCP based on such decomposition. 1.INTRODUCTION Many practical applications invoke various combinatorial problems that have to be solved. There is a number of powerful algorithms and software tools that enable us to find their exact and approximate solutions on general-purpose computers. However the computational complexity of some combinatorial algorithms [1] makes it difficult (and sometimes even impossible) to find appropriate results i...
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.