Sökning: "PRAM"

Hittade 5 avhandlingar innehållade ordet PRAM.

  1. 1. Development of New Experimental Facilities at the Lund Nuclear Microprobe Laboratory

    Detta är en avhandling från Department of Physics, Lund University

    Författare :Asad Shariff; Lunds universitet.; Lund University.; [2004]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; low energy tailing; sub-micron beam; PRAM; grid shadow; Kärnfysik; Nuclear physics; GUPIX; Ion Beam Analysis; PIXE; Fysicumarkivet A:2004:Shariff;

    Sammanfattning : Ion beam analysis techniques are now well established as research tools for a broad range of multidisciplinary scientific fields. The ability to focus an ion beam down to micrometer size has expanded and strengthened the capability of IBA techniques to a higher level. LÄS MER

  2. 2. Code Generation and Global Optimization Techniques for a Reconfigurable PRAM-NUMA Multicore Architecture

    Detta är en avhandling från Linköping : Linköping University Electronic Press

    Författare :Erik Hansson; Linköpings universitet.; Linköpings universitet.; [2014]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; PRAM; NUMA; multicore; reconfigurable; code generation; optimized composition; ;

    Sammanfattning : In this thesis we describe techniques for code generation and global optimization for a PRAM-NUMA multicore architecture. We specifically focus on the REPLICA architecture which is a family massively multithreaded very long instruction word (VLIW) chip multiprocessors with chained functional units that has a reconfigurable emulated shared on-chip memory. LÄS MER

  3. 3. On adaptive sorting in sequential and parallel models

    Detta är en avhandling från Linköping : Univ

    Författare :Ola Petersson; Linköpings universitet.; Linköpings universitet.; [1989]
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY;

    Sammanfattning : Sorting is probably the most well-studied problem in computer science. In many applications the elements to be sorted are not randomly distributed, but are already nearly ordered. Most existing algorithms do not take advantage of this fact. LÄS MER

  4. 4. New Results on Combinatorial Algorithms

    Detta är en avhandling från Department of Computer Science, Lund University

    Författare :Anders Dessmark; Lunds universitet.; Lund University.; [1998]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Sorting; Subgraph isomorphism; Partial k-trees; computer technology; Time complexity; Parallel computation; Data- och systemvetenskap; Convex layers; Systems engineering; Broadcasting;

    Sammanfattning : In this thesis improved upper bounds for several important combinatorial problems are provided. Below is a list of the main results showed in the thesis. The problem of determining whether a k-connected partial k-tree is isomorphic to subgraph of another partial k-tree is shown to be solvable in time O(nk+2). LÄS MER

  5. 5. A ten-year development of accessibility in the outdoor environment : Municipal challenges and older people’s perception

    Detta är en avhandling från Department of Computer Science, Lund University

    Författare :Berglind Hallgrimsdottir; Lunds universitet.; Lund University.; [2016-05-09]
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Accessibility; intervention; Environmental Barriers; implementation; Ageing; Planners view;

    Sammanfattning : Denna avhandling undersöker utvecklingen av en tio års engagemang av tillgänglighet i utemiljön. Denna undersöks från två perspektiv; samhällets utmaning och användarens uppfattning. Äldre personer och personer med funktionshinder ska ha lika möjligheter att använda transportsystemet som andra människor. LÄS MER