Sökning: "parallelizable"
Visar resultat 1 - 5 av 17 uppsatser innehållade ordet parallelizable.
1. Syntax-Based Dependency Discovery : Extracting Dependencies Between Integration Test Cases for Passive Testing
M1-uppsats, KTH/Hälsoinformatik och logistikSammanfattning : Modern-day vehicles consist of numerous electronic computing devices with accompanying software. Since vehicles are generally classified as safety-critical systems, rigorous testing strategies have to be deployed to ensure correct operation of the embedded software. LÄS MER
2. An I/O-aware scheduler for containerized data-intensive HPC tasks in Kubernetes-based heterogeneous clusters
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : Cloud-native is a new computing paradigm that takes advantage of key characteristics of cloud computing, where applications are packaged as containers. The lifecycle of containerized applications is typically managed by container orchestration tools such as Kubernetes, the most popular container orchestration system that automates the containers’ deployment, maintenance, and scaling. LÄS MER
3. Exploring and extending eigensolvers for Toeplitz(-like) matrices : A study of numerical eigenvalue and eigenvector computations combined with matrix-less methods
Kandidat-uppsats, Uppsala universitet/Institutionen för informationsteknologiSammanfattning : We implement an eigenvalue solving algorithm proposed by Ng and Trench, specialized for Toeplitz(-like) matrices, utilizing root finding in conjunction with an iteratively calculated version of the characteristic polynomial. The solver also yields corresponding eigenvectors as a free bi-product. LÄS MER
4. Synthetic Graph Generation at Scale : A novel framework for generating large graphs using clustering, generative models and node embeddings
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : The field of generative graph models has seen increased popularity during recent years as it allows us to model the underlying distribution of a network and thus recreate it. From allowing anonymization of sensitive information in social networks to data augmentation of rare diseases in the brain, the ability to generate synthetic data has multiple applications in various domains. LÄS MER
5. Exploring feasibility of reinforcement learning flight route planning
Kandidat-uppsats, Linköpings universitet/Institutionen för datavetenskap; Linköpings universitet/Filosofiska fakultetenSammanfattning : This thesis explores and compares traditional and reinforcement learning (RL) methods of performing 2D flight path planning in 3D space. A wide overview of natural, classic, and learning approaches to planning s done in conjunction with a review of some general recurring problems and tradeoffs that appear within planning. LÄS MER
