Sökning: "Bo Kågström"

Visar resultat 11 - 15 av 15 avhandlingar innehållade orden Bo Kågström.

1. 11. Recursive Blocked Algorithms, Data Structures, and High-Performance Software for Solving Linear Systems and Matrix Equations

   Författare :Isak Jonsson; Bo Kågström; Zhaojun Bai; Umeå universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Datorberäkningar och högpresterande datorer; Recursive algorithm; recursive blocked format; Cholesky factorization; Sylvester-type equations; automatic blocking; superscalar; GEMM-based; RECSY library; Datorberäkningar och högpresterande datorer; Computer engineering; Datorteknik; business data processing; administrativ databehandling;

   Sammanfattning : This thesis deals with the development of efficient and reliable algorithms and library software for factorizing matrices and solving matrix equations on high-performance computer systems. The architectures of today's computers consist of multiple processors, each with multiple functional units. LÄS MER

3. 12. Scheduling of parallel matrix computations and data layout conversion for HPC and Multi-Core Architectures

   Författare :Lars Karlsson; Bo Kågström; Erik Elmroth; Charles Van Loan; Umeå universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer and systems science; Data- och systemvetenskap; data- och systemvetenskap; computer and systems sciences;

   Sammanfattning : Dense linear algebra represents fundamental building blocks in many computational science and engineering applications. The dense linear algebra algorithms must be numerically stable, robust, and reliable in order to be usable as black-box solvers by expert as well as non-expert users. LÄS MER

4. 13. Improving the efficiency of eigenvector-related computations

   Författare :Angelika Beatrix Schwarz; Lars Karlsson; Bo Kågström; Carl Christian Kjelgaard Mikkelsen; Miroslav Tůma; Umeå universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; high-performance computing; standard non-symmetric eigenvalue problem; triangular Sylvester equation; tiled algorithms; task parallelism;

   Sammanfattning : An effective strategy in dense linear algebra is the design of algorithms as tiled algorithms. Tiled algorithms that express the bulk of the computation as matrix-matrix operations (level-3 BLAS) have proven successful in achieving high performance on cache-based architectures. LÄS MER

5. 14. Decentralized resource brokering for heterogeneous grid environments

   Författare :Johan Tordsson; Erik Elmroth; Bo Kågström; Umeå universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Grid computing; Resource brokering; interoperability; advance reservations; coallocation; Web services; Computer science; Datavetenskap;

   Sammanfattning : The emergence of Grid computing infrastructures enables researchers to share resources and collaborate in more efficient ways than before, despite belonging to different organizations and being distanced geographically. While the Grid computing paradigm offers new opportunities, it also gives rise to new difficulties. LÄS MER

7. 15. Structural Information and Hidden Markov Models for Biological Sequence Analysis

   Författare :Jeanette Tångrot; Bo Kågström; Uwe H. Sauer; Erik Sonnhammer; Umeå universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; HMM; structure alignment; protein structure; secondary structure; remote homologue; annotation; domain family; protein family; protein superfamily; protein fold recognition; Bioinformatics; Bioinformatik;

   Sammanfattning : Bioinformatics is a fast-developing field, which makes use of computational methods to analyse and structure biological data. An important branch of bioinformatics is structure and function prediction of proteins, which is often based on finding relationships to already characterized proteins. LÄS MER