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...

The design space exploration (DSE) subsystem of a design automation tool is responsible for early identification of interesting zones of the design space. Evaluation of the exploration strategy used in a tool is extremely difficult because there is not enough information about either the design space or the actual cost function. This paper describes a software environment for quantitative evalu...

Modern digital systems design requires us to explore a large and complex design space to find a best configuration which satisfies design requirements. Such exploration requires a sound representation of design space from which design candidates are efficiently generated, each of which then is evaluated. This paper proposes a plan-generationevaluation framework which supports a complete process...

Habituation is a common form of non-associative learning in which the organism gradually decreases its response to repeated stimuli. The decrease in exploratory activity of many animal species during exposure to a novel open field arena is a widely studied habituation paradigm. However, a theoretical framework to quantify how the novelty of the arena is learned during habituation is currently m...

We present an on-line strategy that enables a mobile robot with vision to explore an unknown simple polygon. We prove that the resulting tour is less than 26.5 times as long as the shortest watchman tour that could be computed off-line. Our analysis is doubly founded on a novel geometric structure called the angle hull. Let D be a connected region inside a simple polygon, P . We define the angl...

Communication design for SoCs poses the unique challenges in order to cover a wide range of architectures while offering new opportunities for optimizations based on the application specific nature of system designs. In this report, we propose automatic generation of communication architecture from communication link model where system components communicate through logical links of network arc...