Increases in the complexity of Coarse Grained Reconfigurable Array (CGRA) architectures have made implementation of new architectures difficult and time consuming. Due to the large number of design options available, it is difficult for designers to make optimal design decisions in the early stages of the design cycle. This paper proposes a novel functional modelling framework for CGRA architec...

The use of polychlorinated biphenyls (PCBs) has been banned for several decades. PCBs have a long biological half-life and high liposolubility which leads to their bioaccumulation and biomagnification through food chains over a wide range of trophic levels. Exposure can lead to changes in animal physiology and behavior and has been demonstrated in both experimental and field analyses. There are...

Recent empirical evidence demonstrates relationships between motor and language development that are partially mediated by exploration. This is in line with the embodied cognition approach to development that views language as grounded in real-life sensorimotor interactions with the environment. This view implies that the relations between motor and linguistic skills should be specific. Moreove...

The size of search spaces in embedded system design is one of the most critical problems during design space exploration. Pareto-Front Arithmetics (PFA) has shown to be useful to overcome this problem by decomposing a hierarchical search space and just exploring each part of the system separately. Later, the exploration results are combined at higher levels of the hierarchy. In order to decreas...

We investigate possible options of creating a Dragonfly topology capable of accommodating a specified number of end-points. We first observe that any Dragonfly topology can be described with two main parameters, imbalance and density, dictating the distribution of routers in groups, and the inter-group connectivity, respectively. We then introduce an algorithm that generates a dragonfly topolog...

In this paper we present a multi-objective genetic algorithm to solve the problem of mapping a set of task graphs onto a heterogeneous multiprocessor platform. The objective is to meet all real-time deadlines subject to minimizing system cost and power consumption, while staying within bounds on local memory sizes and interface buffer sizes. Our approach allows for mapping onto a fixed platform...

We design new algorithms for the combinatorial pure exploration problem in the multi-arm bandit framework. In this problem, we are given K distributions and a collection of subsets V ⊂ 2 of these distributions, and we would like to find the subset v ∈ V that has largest cumulative mean, while collecting, in a sequential fashion, as few samples from the distributions as possible. We study both t...

This paper shows that it is possible to (1) discover novel implementations of median circuits using evolutionary techniques and (2) find out suitable median circuits in case that only limited resources are available for their implementation. These problems are approached using Cartesian genetic programming and an ordinary compare–swap encoding. Combining the proposed approaches a method is demo...

Interest in synthesis of Application Specific Instruction Processors or ASIPs has increased considerably and a number of methodologies have been proposed in the last decade. This paper attempts to survey the state of the art in this area and identifies some issues which need to be addressed. We have identified the five key steps in ASIP design as application analysis, architectural design space...

Design space exploration is the process of analyzing several functionally equivalent alternatives to determine the most suitable one. A fundamental question is whether an implementation is consistent with the high-level specification or whether two implementations are “equivalent.” The synchronous assumption has made it possible to develop efficient procedures for establishing functional equiva...