5 research outputs found

    Sélection automatique d'instructions et ordonnancement d'applications basés sur la programmation par contraintes

    Get PDF
    National audienceCe papier prĂ©sente une nouvelle mĂ©thode, basĂ©e sur la programmation par contraintes, pour la sĂ©lection de motifs de calcul, le placement et l'ordonnancement d'applications sur des extensions de processeurs conïŹgurables. Cette mĂ©thode est intĂ©grĂ©e dans l'environnement DURASE (Generic Environment for Design and Utilization of ReconïŹgurable Application-SpeciïŹc Processors Extensions). Les extensions du proces- seur, qui mettent en Ɠuvre les motifs de calcul et qui sont accessibles via des instructions spĂ©cialisĂ©es, sont fortement couplĂ©es au chemin de donnĂ©es du processeur. Ces instructions spĂ©cialisĂ©es sont gĂ©nĂ©- rĂ©es et sĂ©lectionnĂ©es Ă  partir du graphe de l'application. Notre mĂ©thode supporte un ordonnancement sous contrainte de ressources ou sous contrainte de temps. Les rĂ©sultats expĂ©rimentaux obtenus sur les benchmarks MediaBench et MiBench montrent une accĂ©lĂ©ration de l'exĂ©cution des applications d'un facteur de 2,3 en moyenne

    Scheduling, Binding and Routing System for a Run-Time Reconfigurable Operator Based Multimedia Architecture

    Get PDF
    International audienceThis article presents an integrated environment for application scheduling, binding and routing used for the run-time reconfigurable, operator based, ROMA multimedia architecture. The environment is very flexible and after a minor modification can support other reconfigurable architectures. Currently, it supports the architecture model composed of a bank of single (double) port memories, two communication networks (with different topologies) and a set of run-time functionally reconfigurable non-pipelined and pipelined operators. The main novelty of this work is simultaneous solving of the scheduling, binding and routing tasks. This frequently generates optimal results, which has been shown by extensive experiments using the constraint programming paradigm. In order to show flexibility of our environment, we have used it in this article for optimization of application scheduling, binding and routing (the case of the non-pipelined execution model) and for space exploration (case of the pipelined execution model)

    ASAM: Automatic Architecture Synthesis and Application Mapping

    Full text link
    This paper focuses on mastering the automatic architecture synthesis and application mapping for heterogeneous massively-parallel MPSoCs based on customizable application-specific instruction-set processors (ASIPs). It presents an over-view of the research being currently performed in the scope of the European project ASAM of the ARTEMIS program. The paper briefly presents the results of our analysis of the main problems to be solved and challenges to be faced in the design of such heterogeneous MPSoCs. It explains which system, design, and electronic design automation (EDA) concepts seem to be adequate to resolve the problems and address the challenges. Finally, it introduces and briefly discusses the ASAM design-flow and its main stages

    Constraint-Driven Identification of Application Specific Instructions in the DURASE System

    No full text
    International audienceThis paper presents a new constraint-driven method for fast identification of computational patterns that is a part of DURASE system (Generic Environment for Design and Utilization of Reconfigurable Application-Specific Processors Extensions). The patterns identified by our system form a base for application specific instruction selection and processor extension generation. Our method identifies all computational patterns directly from an application graph satisfying all architectural and technological constraints imposed by target processors and FPGA devices. The considered constraints include a number of inputs and outputs, a number of operators, and a delay of the pattern critical path. Therefore the identified patterns can be well tailored to target processors. Our approach uses heavily constraint programming methods, which makes it possible to mix graph isomorphism constraints with other constraints in one formal environment. We have extensively evaluated our algorithm on MediaBench and MiBench benchmarks with tough architectural and technological constraints. The obtained patterns have good coverage of application graphs while limiting number of operators and fulfill architectural and technological constraints

    8th. International congress on archaeology computer graphica. Cultural heritage and innovation

    Full text link
    El lema del Congreso es: 'DocumentaciĂłn 3D avanzada, modelado y reconstrucciĂłn de objetos patrimoniales, monumentos y sitios.Invitamos a investigadores, profesores, arqueĂłlogos, arquitectos, ingenieros, historiadores de arte... que se ocupan del patrimonio cultural desde la arqueologĂ­a, la informĂĄtica grĂĄfica y la geomĂĄtica, a compartir conocimientos y experiencias en el campo de la ArqueologĂ­a Virtual. La participaciĂłn de investigadores y empresas de prestigio serĂĄ muy apreciada. Se ha preparado un atractivo e interesante programa para participantes y visitantes.Lerma GarcĂ­a, JL. (2016). 8th. International congress on archaeology computer graphica. Cultural heritage and innovation. Editorial Universitat PolitĂšcnica de ValĂšncia. http://hdl.handle.net/10251/73708EDITORIA
    corecore