http://home.deib.polimi.it/agosta/ 2020-03-26T14:04:40+01:00 http://home.deib.polimi.it/agosta/ http://home.deib.polimi.it/agosta/lib/images/favicon.ico text/html 2013-01-31T10:41:54+01:00 http://home.deib.polimi.it/agosta/doku.php?id=research:theses:a_domain-specific_language_for_performance_portability_of_cryptographic_applications_on_many-core_heterogeneous_platforms&rev=1359625314 The goal of this thesis is to raise the abstraction level of OpenCL coding by means of a Domain Specific Language (DSL) based on aspect-oriented programming. The DSL will take into account characteristics of the specific platforms and provide suitable constructs to achieve the best performance, starting from a platform-neutral reference implementation. The DSL will have the elision property (i.e., removing all DSL-specific construct will result in a working C/OpenCL C code). text/html 2013-01-31T10:44:32+01:00 http://home.deib.polimi.it/agosta/doku.php?id=research:theses:accelerating_cryptographic_primitives_with_dynamic_parallelism-enabled_many-core_architectures&rev=1359625472 The goal of this thesis is to assess the performance improvements that can be obtained on cryptographic primitives through a parallel implementation on many-core accelerators (NVIDIA Kepler and STM STHORM platforms), as well as to define best practice for efficient implementation on such devices. To this end, the OpenCL compiler needs to be extended to allow dynamic parallelism on STHORM. text/html 2011-03-11T15:08:45+01:00 http://home.deib.polimi.it/agosta/doku.php?id=research:theses:data_distribution_for_openmp_in_numa_architectures&rev=1299852525 Goal of this thesis is to design and implement a compiler pass to detect data access patterns in OpenMP programs, to drive data distribution on non-uniform memory access (NUMA) architectures. Since in NUMA architectures access time depends on the distance between memory and processor, allocating data on memories near to the processor that will use them is of capital importance for performance. text/html 2007-09-13T18:54:56+01:00 http://home.deib.polimi.it/agosta/doku.php?id=research:theses:graduate_thesis_high_performance_algorithms_for_logic_synthesis&rev=1189702496 This thesis, aimed at graduate students (laurea specialistica) aims at designing and implementing new algorithms for Logic Synthesis. Such algorithms may address the P-equivalence problem for Boolean functions under relaxed conditions, such as don't care, or higher level technology mapping problems. text/html 2009-09-23T11:05:08+01:00 http://home.deib.polimi.it/agosta/doku.php?id=research:theses:graduate_thesis_ildjit_developments&rev=1253696708 Several thesis topics are available on developments of the ILDJIT system, including the following: * Extending support to the Java language (through gcc4net); * Extending support to C# 2.0 (adding support for generics); * Extending support to the Python language (2 students, includes support for generics); * Extending the level of optimization available in ILDJIT; * Extending the support for metadata to include non-standard QoS metadata. text/html 2011-03-11T15:03:09+01:00 http://home.deib.polimi.it/agosta/doku.php?id=research:theses:llvm_back-end_development&rev=1299852189 We are offering several theses on the development of compiler back-ends targeting parallel architectures. The proposed theses will use the LLVM compiler infrastructure as a starting point, and will target one of the following architectures: * Cell processor * Nvidia PTX * STMicroelectronics xP70/Platform 2012 text/html 2010-02-03T16:41:52+01:00 http://home.deib.polimi.it/agosta/doku.php?id=research:theses:opencl_and_openmp_implementation&rev=1265211712 We offer theses on the implementation of OpenCL and/or OpenMP languages on novel many-core platforms provided by our industrial partners. The goal is to produce a complete compilation toolchain within the FP7 European project 2PARMA starting in January 2010. text/html 2013-01-31T10:46:08+01:00 http://home.deib.polimi.it/agosta/doku.php?id=research:theses:opencl_runtime_development_for_numa_architectures&rev=1359625568 The goal of this thesis is to analyze the performance bottlenecks of our current OpenCL runtime (OpenCRun) and improve over it by upgrading specific features identified as performance critical (e.g., the locking subsystem). The OpenCRun runtime is based on the LLVM compiler framework and is developed in C++. text/html 2011-03-11T15:03:13+01:00 http://home.deib.polimi.it/agosta/doku.php?id=research:theses:task_scheduling_for_numa_architectures&rev=1299852193 In certain scheduling policies, parallel tasks are allocated to different processing elements at the beginning of the execution. Faster processing elements, at the end of their own task queue, can steal work from slower ones. Conventional wisdom has it that stealing from a randomly chosen processing element gives the best results, but this does not take into account non uniform memory access architectures, where memory access have different costs depending on the involved processing elements. text/html 2007-09-13T18:55:06+01:00 http://home.deib.polimi.it/agosta/doku.php?id=research:theses:undergraduate_thesis_garbage_collection_in_ildjit&rev=1189702506 This thesis aims at implementing a generational garbage collection algorithm within the ILDJIT system, a dynamic compiler supporting the execution of CIL bytecode (a.k.a. ECMA-335). The thesis is offered to undergraduate students (laurea di primo livello), and can be continued during graduate students by moving to more advanced dynamic compilation topics using the same environment. text/html 2007-10-03T16:01:47+01:00 http://home.deib.polimi.it/agosta/doku.php?id=research:theses:undergraduate_thesis_native_calls_for_c_base_library&rev=1191420107 We offer a thesis for undergraduate students (laurea di primo livello) aiming at implementing a significant part of the C# base library. The library will be used within the open source ILDJIT project, and can further pursued during graduate studies by moving on more advanced topics of dynamic compilation on ILDJIT.