Sökning: "memory allocation"

Visar resultat 1 - 5 av 66 uppsatser innehållade orden memory allocation.

  1. 1. Comparison of Recommendation Systems for Auto-scaling in the Cloud Environment

    Master-uppsats, Blekinge Tekniska Högskola/Institutionen för datavetenskap

    Författare :Sai Nikhil Boyapati; [2023]
    Nyckelord :Auto-Scaling; Auto-Scaling Recommendations; Cloud Environment; K-Nearest Neighbors; Machine Learning; Recommendation Systems; Random Forests; Support Vector Machines;

    Sammanfattning : Background: Cloud computing’s rapid growth has highlighted the need for efficientresource allocation. While cloud platforms offer scalability and cost-effectiveness for a variety of applications, managing resources to match dynamic workloads remains a challenge. LÄS MER

  3. 2. Recycling a non-contiguous matrix as workspace : Instance of packaging & cutting problem

    Kandidat-uppsats, Umeå universitet/Institutionen för datavetenskap

    Författare :Oscar Nilsson; [2023]
    Nyckelord :matrix; matrices; memory;

    Sammanfattning : This report explores a common issue in a system involving matrices, namely the mismatch between the allocation and deallocation ratios. This results in more matrices being allocated than deallocated, eventually leading to insufficient memory. The mismatch in the ratio is an implication of how matrices are normally used. LÄS MER

  4. 3. React vs. Vue : Comparing JavaScript Frameworks from a Beginner’s Perspective

    Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Daniel Schuster; [2023]
    Nyckelord :JavaScript; Programming; Frameworks; React; Vue; JavaScript; Programmering; Ramverk; React; Vue;

    Sammanfattning : JavaScript has become the dominant programming language for web application development during the last few decades, being used by 98.5% of the websites worldwide. This prominence has led to the emergence of several frameworks for this language, with React and Vue being among the popular choices. LÄS MER

  5. 4. AI Based Methods for Matrix Multiplication in High Resolution Simulations of Radio Access Networks

    Master-uppsats, KTH/Matematisk statistik

    Författare :Marcus Johnson; Herman Forslund; [2023]
    Nyckelord :Product-Quantization; MADDNESS; Radio Access Networks; Channel Estimation; MIMO; Approximate Matrix Multiplication; Pruduktkvantisering; MADDNESS; RAN; MIMO; Approximativa matrismultiplikation;

    Sammanfattning : The increasing demand for mobile data has placed significant strain on radio access networks (RANs), leading to a continuous need for increased network capacity. In keeping with that, a significant advancement in modern RANs is the ability to utilize several receivers and transmitters, to allow for beamforming. LÄS MER

  7. 5. COMPARATIVE ANALYSIS OF MACHINE LEARNING LOAD FORECASTING TECHNIQUES

    Magister-uppsats, Stockholms universitet/Institutionen för data- och systemvetenskap

    Författare :Humphry Takang Bate; [2023]
    Nyckelord :;

    Sammanfattning : Load forecasting plays a critical role in energy management, and power systems, enabling efficient resource allocation, improved grid stability, and effective energy planning and distribution. Without accurate very short term load forecasting, utility management companies face uncertain load patterns, unrealistic prices, and poor infrastructure planning. LÄS MER