Search results for "Computer architecture"
showing 10 items of 191 documents
EvoStar 2019: Bio-Inspired Computing and Automation
2020
A Visual Simulation Framework For Simultaneous Multithreading Architectures
2011
The computing systems, and particularly microarchitectures, are in a continuous expansion reaching an unmanageable complexity by the human mind. In order to understand and control this expansion, researchers need to design and implement larger and more complex systems’ simulators. In the current paradigm the simulators play the key role in going further, by translating all complex processing mechanisms in relevant and easy to understand information. This paper aims to make a suggestive description of the concepts and principles implemented into a Simultaneous Multithreading Architecture. We introduce the SMTAHSim framework, an educational tool that simulates in an interactive manner the imp…
Using FOCAP tool for teaching microarchitecture simulation and optimization
2013
This paper presents our new developed FOCAP tool (Framework for optimizing the Computer Architecture Performance) in order to gain a better understanding and familiarity of the students with new advanced learning methods and tools in the Microarchitecture Simulation and Optimization. At this stage, FOCAP allows a mono-objective automatic design space exploration (DSE) of a superscalar processor by varying several architectural parameters. Such DSE tools are very useful, since it is impossible to simulate all the configurations of a highly parameterized microarchitecture. Therefore, heuristic methods, local search algorithms and advanced machine learning methods are good candidates to find n…
Modeling RISC-V Processor in IP-XACT
2018
IP-XACT is the most used standard in IP (Intellectual Property) integration. It is intended as a language neutral golden reference, from which RTL and HW dependent SW is automatically generated. Despite its wide popularity in the industry, there are practically no public and open design examples for any part of the design flow from IP-XACT to synthesis. One reason is the difficulty of creating IP-XACT models for existing RTL projects. In this paper, we address the issues by modeling the PULPino RISC-V microprocessor that is written in SystemVerilog (SV) and the project distributed over several repositories. We propose how to solve the mismatching concepts between SV project and IP-XACT, and…
Parallelizing Epistasis Detection in GWAS on FPGA and GPU-Accelerated Computing Systems
2015
This is a post-peer-review, pre-copyedit version of an article published in IEEE - ACM Transactions on Computational Biology and Bioinformatics. The final authenticated version is available online at: http://dx.doi.org/10.1109/TCBB.2015.2389958 [Abstract] High-throughput genotyping technologies (such as SNP-arrays) allow the rapid collection of up to a few million genetic markers of an individual. Detecting epistasis (based on 2-SNP interactions) in Genome-Wide Association Studies is an important but time consuming operation since statistical computations have to be performed for each pair of measured markers. Computational methods to detect epistasis therefore suffer from prohibitively lon…
A Fast Algorithm Finding the Shortest Reset Words
2013
In this paper we present a new fast algorithm for finding minimal reset words for finite synchronizing automata, which is a problem appearing in many practical applications. The problem is known to be computationally hard, so our algorithm is exponential in the worst case, but it is faster than the algorithms used so far and it performs well on average. The main idea is to use a bidirectional BFS and radix (Patricia) tries to store and compare subsets. Also a number of heuristics are applied. We give both theoretical and practical arguments showing that the effective branching factor is considerably reduced. As a practical test we perform an experimental study of the length of the shortest …
Part of Speech Tagging Using Hidden Markov Models
2020
Abstract In this paper, we present a wide range of models based on less adaptive and adaptive approaches for a PoS tagging system. These parameters for the adaptive approach are based on the n-gram of the Hidden Markov Model, evaluated for bigram and trigram, and based on three different types of decoding method, in this case forward, backward, and bidirectional. We used the Brown Corpus for the training and the testing phase. The bidirectional trigram model almost reaches state of the art accuracy but is disadvantaged by the decoding speed time while the backward trigram reaches almost the same results with a way better decoding speed time. By these results, we can conclude that the decodi…
Lists of Spanish sentences with equivalent predictability, phonetic content, length, and frequency of the last word.
2010
This paper presents a pool of Spanish sentences designed for use in cognitive research and speech processing in circumstances in which the effects of context are relevant. These lists of sentences are divided into six lists of 25 equivalent high-predictability sentences and six lists of 25 low-predictability sentences according to the extent to which the last word can be predicted by the preceding context. These lists were also equivalent in phonetic content, length and frequency of the last word. These lists are intended for use in psycholinguistic research with Spanish-speaking listeners.
Bag-of-word based brand recognition using Markov Clustering Algorithm for codebook generation
2015
International audience; In order to address the issue of counterfeiting online, it is necessary to use automatic tools that analyze the large amount of information available over the Internet. Analysis methods that extract information about the content of the images are very promising for this purpose. In this paper, a method that automatically extract the brand of objects in images is proposed. The method does not explicitly search for text or logos. This information is implicitly included in the Bag-of-Words representation. In the Bag-of-Words paradigm, visual features are clustered to create the visual words. Despite its shortcomings, k-means is the most widely used algorithm. With k-mea…