A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2023; you can also visit the original URL.
The file type is application/pdf.
Filters
MIFP: Selective Fat-Pointer Bounds Compression for Accurate Bounds Checking
2023
Proceedings of the 26th International Symposium on Research in Attacks, Intrusions and Defenses
Preserved Fulltext
To minimize the number of pointers to expand, MIFP adds instrumentation on a per-allocation-site granularity; objects of the same type but different code allocation locations can have their pointer members ...
However, compression can introduce inaccuracy to the bounds, making certain out-ofbounds accesses undetectable. ...
This research is supported in part by a contract with Huawei Canada, NSERC CRD Grant CRDPJ 541942-19 and a Tier 1 Canada Research Chair. ...
doi:10.1145/3607199.3607212
fatcat:wonv3uedxndqhoojjk6lzosoay
TinyVM: an energy-efficient execution infrastructure for sensor networks
2011
Software, Practice & Experience
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
TinyVM achieves high code density through the use of compressed bytecode as the primary program representation. ...
TinyVM executes compressed byte-code in-place, which eliminates the need for a decompression stage and thereby reduces memory consumption on sensor nodes. ...
The splitter is a modified ncc compiler that translates nesC sources to C, thereby partitioning them into two files: one C file containing the code to be compiled to bytecode, and one with the code to ...
doi:10.1002/spe.1123
fatcat:2pt635zmjrdappc2i3jaqeymki
An Embedded Systems Programming Environment for C
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This mixed-mode execution environment combines the advantages of highly compressed bytecode with the speed of machine code. ...
Initial results show that the performance of the virtual machine is typically only 2 to 36 times slower than the binary execution, with compressed code occupying only 36%-57% of the machine code size. ...
Therein an application consists of a set of C source files containing code that can be compiled to either bytecode or to machine code. ...
doi:10.1007/11823285_127
fatcat:ix47c7lzyrhq5b6uepr77gj5la
Compiler-Based Code Compression for Hard Real-Time Systems
2019
Proceedings of the 22nd International Workshop on Software and Compilers for Embedded Systems - SCOPES '19
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We show how to extend a compiler targeting hard real-time systems by an asymmetric compiler-based code compression/decompression, where the compression is performed at the compilation time and the decompression ...
Real-Time Systems often come with additional requirements apart from being functionally correct and adhering to their timing constraints. ...
The considered C programs can be annotated with flow facts within the ANSI-C source code. ...
doi:10.1145/3323439.3323976
dblp:conf/scopes/MutsLF19
fatcat:hvt23injjvgndo7frjklrt4fum
Java Programming Assessment Tool for Assignment Module in Moodle E-learning System
2012
Procedia - Social and Behavioral Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Results show that the proposed model is able to display the suggested mark along with the output for every successful compilation, and will display the error along with the suggested mark for every failed ...
compilation. ...
Acknowledgements We are grateful to the Center of Teaching and Learning, Universiti Teknologi Malaysia for supporting the work in this field with the Research Grant, Vote No. Q.J130000.2528.01H82. ...
doi:10.1016/j.sbspro.2012.09.714
fatcat:dwcedt74kbeb3nzqw3d5piqvtu
Transparent pointer compression for linked data structures
2005
Proceedings of the 2005 workshop on Memory system performance - MSP '05
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
It allows an individual data structure instance or even a subset thereof to grow up to 2 32 bytes in size, and can compress pointers to some data structures but not others. ...
The approach is "macroscopic," i.e., it operates on an entire logical data structure in the program at a time. ...
We are grateful to John Criswell for his extensive assistance, both with the implementation of pointer compression and with the experiments. ...
doi:10.1145/1111583.1111587
dblp:conf/ACMmsp/LattnerA05
fatcat:7nqj7pe4ffaypoidl6a4iu7dkq
Evaluation of extended dictionary-based static code compression schemes
2005
Proceedings of the 2nd conference on Computing frontiers - CF '05
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper evaluates how much extended dictionary-based code compression techniques can reduce the static code size. ...
In addition, our proposed combined scheme can reduce the size of the dictionary and the number of codewords significantly which can enable efficient implementations of extended dictionary-based code compression ...
Acknowledgments The authors are indebted to Magnus Själander and the other members of the FlexSoC project for comments. We also thank the anonymous reviewers. ...
doi:10.1145/1062261.1062278
dblp:conf/cf/ThuressonS05
fatcat:u53m5ri32rco7b44vhn7jpcyve
Compiler Hacking for Source Code Analysis
2004
Software quality journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
There are tools encompassing or implementing the source parse step, where the parser is internal to the toolkit, and is developed and maintained with it. ...
Many activities related to software quality assessment and improvement, such as empirical model construction, data flow analysis, testing or reengineering, rely on static source code analysis as the first ...
The lcc 4.0 source code was modified; the patched compiler was able to extract a suite of software metrics at the file and function level, and to store metrics into files while compiling the code. ...
doi:10.1023/b:sqjo.0000039794.29432.7e
fatcat:fqsuiwatwneq5e7xjiuknoli4a
High-Level Support for Pipeline Parallelism on Many-Core Architectures
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
With the increasing architectural diversity of many-core architectures the challenges of parallel programming and code portability will sharply rise. ...
We propose C/C++ language annotations for specifying pipeline patterns and describe the associated compilation and runtime infrastructure. ...
Acknowledgment This work was supported by the European Commission as part of the FP7 Project PEPPHER under grant 248481. ...
doi:10.1007/978-3-642-32820-6_61
fatcat:gquq7t4rzjgwlfsqw5gxy7bvve
Compiler Support for Sparse Tensor Computations in MLIR
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
of the computation. ...
Therefore, we propose treating sparsity as a property of tensors, not a tedious implementation task, and letting a sparse compiler generate sparse code automatically from a sparsity-agnostic definition ...
Acknowledgments The authors would like to extend their thanks to the MLIR team, with a special shout-out to Mehdi Amini, Eugene Burmako, Diego Caballero, Albert Cohen, Sanjoy Das, Tobias Gysi, Stephan ...
arXiv:2202.04305v1
fatcat:6qijxmernbev7pwmt6lgqdvziy
Extendable pattern-oriented optimization directives
2012
ACM Transactions on Architecture and Code Optimization (TACO)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Our experimental results show that a pattern-guided compiler can outperform the state-of-the-art compilers and even achieve performance as competitive as hand-tuned code. ...
methodology, which complements existing programming models and compiler technologies (Sections II and III); • an optimization programming interface to facilitate extendability with new optimization patterns ...
Figure 3 shows the source code generated with dense-mm being applied to SYMM (with the effects of Steps 6 -9 omitted). ...
doi:10.1145/2355585.2355587
fatcat:zkx6ykcm3nf2ld3kzkcqk2btrq
Adaptive numerical simulations with Trixi.jl: A case study of Julia for scientific computing
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We describe the main design choices that enable these features and compare Trixi.jl with a mature open source Fortran code that uses the same numerical methods. ...
We conclude with an assessment of Julia for simulation-focused scientific computing, an area that is still dominated by traditional high-performance computing languages such as C, C++, and Fortran. ...
For example, the single-physics solvers for hyperbolic PDEs of Trixi.jl were extended to a multi-physics setup for the compressible Euler equations with self-gravity with roughly 350 lines of code [48 ...
arXiv:2108.06476v1
fatcat:3pp3fepb4bfbnbvk4nkcphzhdq
Extendable pattern-oriented optimization directives
2011
International Symposium on Code Generation and Optimization (CGO 2011)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Our experimental results show that a pattern-guided compiler can outperform the state-of-the-art compilers and even achieve performance as competitive as hand-tuned code. ...
methodology, which complements existing programming models and compiler technologies (Sections II and III); • an optimization programming interface to facilitate extendability with new optimization patterns ...
Figure 3 shows the source code generated with dense-mm being applied to SYMM (with the effects of Steps 6 -9 omitted). ...
doi:10.1109/cgo.2011.5764679
dblp:conf/cgo/CuiXWYFF11
fatcat:cv2p4qu6xrhvldik65wfahl53q
Audio Rendering/Processing And Control Ubiquity? A Solution Built Using Faust Dynamic Compiler And Jack/Netjack
2014
Proceedings of the SMC Conferences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Acknowledgments One part of this work is made possible by a grant from the French National Research Agency (ANR) INEDIT Project (ANR-12-CORD-0009), and for the other part by a grant from the French National ...
The development cycle, from the edition of the source code to a running application, is much longer with a compiler than with an interpreter. ...
Dynamic compilation chain The complete chain goes from the DSP source code, compiled in LLVM IR using the LLVM back-end, to finally produce the executable code using the LLVM JIT. ...
doi:10.5281/zenodo.850908
fatcat:efyirjc5wvhwdphuzdljqzojba
A framework to experiment optimizations for real-time and embedded software
[article]
2010
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
, code compression, etc. ...
To meet these requirements, it may be necessary to improve the software by applying various kinds of transformations like compiler optimizations, specific mapping of code and data in the available memories ...
Impact of function inlining Function inlining is a compiler transformation that replaces calls to functions with their bodies. ...
arXiv:1011.6031v1
fatcat:qtlhyegrj5gazkpzpy2w6exzpi
« Previous
Showing results 1 — 15 out of 47,697 results