Advanced search

Found 3 essays matching the above criteria.

1. 1. An Evaluation of WebAssembly Pre-Initialization for Faster Startup Times

   University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Author : William Stackenäs; [2023]
   Keywords : WebAssembly; Wasm; pre-execution; pre-initialization; execution time; Wizer; WebAssembly; Wasm; förexekvering; förinitialisering; exekveringstid; Wizer;

   Abstract : WebAssembly (Wasm) has emerged as a new technology for the web that enables complex and interactive web applications, while utilizing a compact and platform-independent bytecode format. Due to its flexibility, portability, and built-in security, it has since evolved to be used in many other embeddings, such as internet-of-things, server applications, and even mobile applications. READ MORE

3. 2. Analyzing and Reducing Compilation Times for C++ Programs

   University essay from Linköpings universitet/Programvara och system

   Author : Dennis Mivelli; [2022]
   Keywords : C ; Compilation; Build; Dependencies; File Dependencies; File inclusions; Time; Speed; Compilation time; Build time; Design patterns; PImpl; Bridge; Dependency injection; Pointer to implementation; Mocking; GoogleTest; gMock; large; large-scale; Reduce; Reduce compilation times; Reduce build times; C ; Kompilering; Byggtid; Beroenden; Filberoenden; Filinkluderingar; Tid; Hastighet; Kompileringstid; Designmönster; PImpl; Bridge; Dependency injection; Pointer to implementation; Mockning; Mocking; GoogleTest; gMock; Storskalig; Minska kompileringstid; Minska;

   Abstract : Software companies often choose to develop in C++ because of the high performance that the language offers. Facilitated by static compilation and powerful optimization options, runtime performance is paid for with compilation time. READ MORE

4. 3. Implied Constraints for the Unison Presolver

   University essay from KTH/Skolan för informations- och kommunikationsteknik (ICT)

   Author : Erik Ekström; [2015]
   Keywords : ;

   Abstract : Unison is a compiler back-end that differs from traditional compiler approaches in that the compilation is carried out using constraint programming rather than greedy algorithms. The compilation problem is translated to a constraint model and then solved using a constraint solver, yielding an approach that has the potential of producing optimal code. READ MORE