Author
Iouliia Skliarova
Bio: Iouliia Skliarova is an academic researcher from University of Aveiro. The author has contributed to research in topics: Field-programmable gate array & Reconfigurable computing. The author has an hindex of 16, co-authored 151 publications receiving 1079 citations.
Papers published on a yearly basis
Papers
More filters
•
14 Mar 2014
TL;DR: This paper presents methods for optimization of finite state machines for FPGA-based circuits and systems and designs of digital circuits and system on the basis of FPGAs.
Abstract: Part I Design of digital circuits and systems on the basis of FPGA.- Part II Methods for optimization of finite state machines for FPGA-based circuits and systems.
84 citations
••
TL;DR: In this paper, the state-of-the-art in reconfigurable hardware SAT satisfiers is presented, and the analysis and classification of existing systems has been performed according to such criteria as algorithmic issues, reconfiguration modes, the execution model, the programming model, logic capacity, and performance.
Abstract: By adapting to computations that are not so well-supported by general-purpose processors, reconfigurable systems achieve significant increases in performance. Such computational systems use high-capacity programmable logic devices and are based on processing units customized to the requirements of a particular application. A great deal of the research effort in this area is aimed at accelerating the solution of combinatorial optimization problems. Special attention in this context was given to the Boolean satisfiability (SAT) problem resulting in a considerable number of different architectures being proposed. This paper presents the state-of-the-art in reconfigurable hardware SAT satisfiers. The analysis and classification of existing systems has been performed according to such criteria as algorithmic issues, reconfiguration modes, the execution model, the programming model, logic capacity, and performance.
77 citations
••
TL;DR: A novel approach for solving the Boolean satisfiability (SAT) problem by combining software and configurable hardware that avoids instance-specific hardware compilation and allows the total problem solving time to be reduced compared to other approaches.
Abstract: This paper introduces a novel approach for solving the Boolean satisfiability (SAT) problem by combining software and configurable hardware. The suggested technique avoids instance-specific hardware compilation and, as a result, allows the total problem solving time to be reduced compared to other approaches that have been proposed. Moreover, the technique permits problems that exceed the resources of the available reconfigurable hardware to be solved. The paper presents the results obtained with some of the DIMACS benchmarks and a comparison of our implementation with other available SAT solvers based on reconfigurable hardware. The hardware part of the satisfier was realized on Virtex XCV812E FPGA, which has a large volume of embedded memory blocks that provide direct support for the proposed approach.
62 citations
•
TL;DR: This paper presents the state-of-the-art in reconfigurable hardware SAT satisfiers, which have been performed according to such criteria as algorithmic issues, reconfiguration modes, the execution model, the programming model, logic capacity, and performance.
Abstract: By adapting to computations that are not so well supported by general-purpose processors, reconfigurable systems achieve significant increases in performance Such computational systems use high-capacity programmable logic devices and are based on processing units customized to the requirements of a particular application A great deal of research effort in this area is aimed at accelerating the solution of combinatorial optimization problems Special attention was given to the Boolean satisfiability (SAT) problem resulting in a considerable number of different architectures being proposed This paper presents the state-of-the-art in reconfigurable hardware SAT satisfiers The analysis of existing systems has been performed according to such criteria as reconfiguration modes, the execution model, the programming model, etc
53 citations
••
TL;DR: The paper found that the even-odd transition network is the most regular network that can be implemented very efficiently in FPGA, so it is proposed new, easily scalable hardware solutions and processing techniques based on this.
45 citations
Cited by
More filters
••
[...]
TL;DR: There is, I think, something ethereal about i —the square root of minus one, which seems an odd beast at that time—an intruder hovering on the edge of reality.
Abstract: There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality.
Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …
33,785 citations
AT&T1
TL;DR: This ebook is the first authorized digital version of Kernighan and Ritchie's 1988 classic, The C Programming Language (2nd Ed.), and is a "must-have" reference for every serious programmer's digital library.
Abstract: This ebook is the first authorized digital version of Kernighan and Ritchie's 1988 classic, The C Programming Language (2nd Ed.). One of the best-selling programming books published in the last fifty years, "K&R" has been called everything from the "bible" to "a landmark in computer science" and it has influenced generations of programmers. Available now for all leading ebook platforms, this concise and beautifully written text is a "must-have" reference for every serious programmers digital library.
As modestly described by the authors in the Preface to the First Edition, this "is not an introductory programming manual; it assumes some familiarity with basic programming concepts like variables, assignment statements, loops, and functions. Nonetheless, a novice programmer should be able to read along and pick up the language, although access to a more knowledgeable colleague will help."
2,120 citations
•
20 Sep 2004
1,387 citations
••
[...]
TL;DR: To study the operational behaviour of λ-terms, this work will use the denotational (mathematical) approach to choose a space of semantics values, or denotations, where terms are to be interpreted.
Abstract: To study the operational behaviour of λ-terms, we will use the denotational (mathematical) approach. A denotational semantics for a language is based on the choice of a space of semantics values, or denotations, where terms are to be interpreted. Choosing a space with nice mathematical properties can help in proving the semantic properties of terms, since to this aim standard mathematical techniques can be used.
880 citations
01 Nov 1997
TL;DR: Recognizing the mannerism ways to get this books computer organization and design the hardware software interface 4th fourth edition by patterson hennessy is additionally useful.
Abstract: Recognizing the mannerism ways to get this books computer organization and design the hardware software interface 4th fourth edition by patterson hennessy is additionally useful. You have remained in right site to begin getting this info. acquire the computer organization and design the hardware software interface 4th fourth edition by patterson hennessy join that we manage to pay for here and check out the link.
832 citations