Sökning: "run-time complexity"

Visar resultat 1 - 5 av 39 avhandlingar innehållade orden run-time complexity.

1. 1. Adaptive Computing based on FPGA Run-time Reconfigurability

   Författare :Ming Liu; Lu Zhonghai; Jantsch Axel; Zipf Peter; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; adaptive computing; FPGA partial reconfiguration; Information technology; Informationsteknik;

   Sammanfattning : In the past two decades, FPGA has been witnessed from its restricted use as glue logic towards real System-on-Chip (SoC) platforms. Profiting from the great development on semiconductor and IC technologies, the programmability of FPGAs enables themselves wide adoption in all kinds of aspects of embedded designs. LÄS MER

3. 2. A Formalized Approach to Multi-View Components for Embedded Systems : Applied to Tool Integration, Run-Time Adaptivity and Architecture Exploration

   Författare :Magnus Persson; Martin Törngren; De-Jiu Chen; Werner Damm; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; view; viewpoint; architecture; component; view integration; architecture exploration; component-based development; multi-view modeling; model-based design; CESAR; DySCAS; ESPRESSO;

   Sammanfattning : Development of embedded systems poses an increasing challenge fordevelopers largely due to increasing complexity. Several factors contribute tothe complexity challenge:• the number of extra-functional properties applying to embedded systems,such as resource usage, timing effects, safety. LÄS MER

4. 3. Cognitive and Self-Adaptive SoCs with Self-Healing Run-Time-Reconfigurable RecoBlocks

   Författare :Byron Navas; Ingo Sander; Johnny Öberg; Michael Hübner; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY;

   Sammanfattning : In contrast to classical Field-Programmable Gate Arrays (FPGAs), partial and run-time reconfigurable (RTR) FPGAs can selectively reconfigure partitions of its hardware almost immediately while it is still powered and operative. In this way, RTR FPGAs combine the flexibility of software with the high efficiency of hardware. LÄS MER

5. 4. Computational algorithms for algebras

   Författare :Samuel Lundqvist; Clas Löfwall; Ralf Fröberg; H. Michael Möller; Stockholms universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Hilbert function; Gröbner basis; zero-dimensional ideal; affine variety; projective variety; run-time complexity; Algebra and geometry; Algebra och geometri; Mathematics; matematik;

   Sammanfattning : This thesis consists of six papers. In Paper I, we give an algorithm for merging sorted lists of monomials and together with a projection technique, we obtain a new complexity bound for the Buchberger-Möller algorithm and the FGLM algorithm. LÄS MER

7. 5. Scheduling Garbage Collection in Embedded Systems

   Författare :Roger Henriksson; Institutionen för datavetenskap; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; memory management; garbage collection; real-time; embedded systems; hard deadlines; run-time systems; Systems engineering; scheduling analysis; Data- och systemvetenskap; computer technology;

   Sammanfattning : The complexity of systems for automatic control and other safety-critical applications grows rapidly. Computer software represents an increasing part of the complexity. As larger systems are developed, we need to find scalable techniques to manage the complexity in order to guarantee high product quality. LÄS MER