Zaloguj się

Gotowe bibliografie tematyczne / Compilers (Computer programs) / Artykuły w czasopismach

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Compilers (Computer programs).

Artykuły w czasopismach na temat „Compilers (Computer programs)”

Autor: Grafiati

Data publikacji: 4 czerwca 2021

Data aktualizacji: 1 sierpnia 2024

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Compilers (Computer programs)”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

1

Feng, Jing Ge, Ye Ping He, and Qiu Ming Tao. "Evaluation of Compilers’ Capability of Automatic Vectorization Based on Source Code Analysis." Scientific Programming 2021 (November 30, 2021): 1–15. http://dx.doi.org/10.1155/2021/3264624.

Pełny tekst źródła

Streszczenie:

Automatic vectorization is an important technique for compilers to improve the parallelism of programs. With the widespread usage of SIMD (Single Instruction Multiple Data) extensions in modern processors, automatic vectorization has become a hot topic in the research of compiler techniques. Accurately evaluating the effectiveness of automatic vectorization in typical compilers is quite valuable for compiler optimization and design. This paper evaluates the effectiveness of automatic vectorization, analyzes the limitation of automatic vectorization and the main causes, and improves the automat

Style APA, Harvard, Vancouver, ISO itp.

2

Susungi, Adilla, and Claude Tadonki. "Intermediate Representations for Explicitly Parallel Programs." ACM Computing Surveys 54, no. 5 (June 2021): 1–24. http://dx.doi.org/10.1145/3452299.

Pełny tekst źródła

Streszczenie:

While compilers generally support parallel programming languages and APIs, their internal program representations are mostly designed from the sequential programs standpoint (exceptions include source-to-source parallel compilers, for instance). This makes the integration of compilation techniques dedicated to parallel programs more challenging. In addition, parallelism has various levels and different targets, each of them with specific characteristics and constraints. With the advent of multi-core processors and general purpose accelerators, parallel computing is now a common and pervasive c

Style APA, Harvard, Vancouver, ISO itp.

3

AlFayez, Fayez. "Algorithms for Pre-Compiling Programs by Parallel Compilers." Computer Systems Science and Engineering 44, no. 3 (2023): 2165–76. http://dx.doi.org/10.32604/csse.2023.026238.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Dold, Axel, Friedrich von Henke, and Wolfgang Goerigk. "A Completely Verified Realistic Bootstrap Compiler." International Journal of Foundations of Computer Science 14, no. 04 (August 2003): 659–80. http://dx.doi.org/10.1142/s0129054103001947.

Pełny tekst źródła

Streszczenie:

This paper reports on a large verification effort in constructing an initial fully trusted bootstrap compiler executable for a realistic system programming language and real target processor. The construction and verification process comprises three tasks: the verification of the compiling specification (a relation between abstract source and target programs) with respect to the language semantics and a realistic correctness criterion. This proof has been completely mechanized using the PVS verification system and is one of the largest case-studies in formal verification we are aware of. Secon

Style APA, Harvard, Vancouver, ISO itp.

5

Ciric, Miroslav, and Svetozar Rancic. "Parsing in different languages." Facta universitatis - series: Electronics and Energetics 18, no. 2 (2005): 299–307. http://dx.doi.org/10.2298/fuee0502299c.

Pełny tekst źródła

Streszczenie:

A compiler is a translator that accepts as input formatted source file or files, and produces as output a file that may be run directly on a computer. Given the same ANSI C++ compliant input file, two different ANSI C++ compliant compilers running on the same operating system produce two different executable programs that should execute in exactly the same way. To some degree, this is achieved by the standardization of the C++ language, but it is also possible because computer programming languages like C++ can be compiled using reliable technologies with long traditions and understood charact

Style APA, Harvard, Vancouver, ISO itp.

6

Steele, James K., and Ronald R. Biederman. "Powder Diffraction Pattern Simulation and Analysis." Advances in X-ray Analysis 37 (1993): 101–7. http://dx.doi.org/10.1154/s0376030800015561.

Pełny tekst źródła

Streszczenie:

The graphics capability and speed available in modern personal computers has encouraged an increase in the use of a direct pattern comparison approach to the analysis of x-ray and electron diffraction patterns. Several researchers over the past 30 years have presented programs and algorithms which calculate and display powder patterns for xray diffraction. These programs originally required a main frame computer which was expensive and generally not available to all researchers. With the recent advances in the speed of personal computers, language compilers, and high resoultion graphics, expec

Style APA, Harvard, Vancouver, ISO itp.

7

Lin, Jenny, Vidya Narayanan, Yuka Ikarashi, Jonathan Ragan-Kelley, Gilbert Bernstein, and James McCann. "Semantics and Scheduling for Machine Knitting Compilers." ACM Transactions on Graphics 42, no. 4 (July 26, 2023): 1–26. http://dx.doi.org/10.1145/3592449.

Pełny tekst źródła

Streszczenie:

Machine knitting is a well-established fabrication technique for complex soft objects, and both companies and researchers have developed tools for generating machine knitting patterns. However, existing representations for machine knitted objects are incomplete (do not cover the complete domain of machine knittable objects) or overly specific (do not account for symmetries and equivalences among knitting instruction sequences). This makes it difficult to define correctness in machine knitting, let alone verify the correctness of a given program or program transformation. The major contribution

Style APA, Harvard, Vancouver, ISO itp.

8

Burgin, Mark. "Triadic Automata and Machines as Information Transformers." Information 11, no. 2 (February 13, 2020): 102. http://dx.doi.org/10.3390/info11020102.

Pełny tekst źródła

Streszczenie:

Algorithms and abstract automata (abstract machines) are used to describe, model, explore and improve computers, cell phones, computer networks, such as the Internet, and processes in them. Traditional models of information processing systems—abstract automata—are aimed at performing transformations of data. These transformations are performed by their hardware (abstract devices) and controlled by their software (programs)—both of which stay unchanged during the whole computational process. However, in physical computers, their software is also changing by special tools such as interpreters, c

Style APA, Harvard, Vancouver, ISO itp.

9

Rushinek, Avi, and Sara F. Rushinek. "Operating systems, compilers, assemblers and application programs: audit trails of user satisfaction." Microprocessors and Microsystems 9, no. 5 (June 1985): 241–49. http://dx.doi.org/10.1016/0141-9331(85)90272-8.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

LaRose, Ryan. "Overview and Comparison of Gate Level Quantum Software Platforms." Quantum 3 (March 25, 2019): 130. http://dx.doi.org/10.22331/q-2019-03-25-130.

Pełny tekst źródła

Streszczenie:

Quantum computers are available to use over the cloud, but the recent explosion of quantum software platforms can be overwhelming for those deciding on which to use. In this paper, we provide a current picture of the rapidly evolving quantum computing landscape by comparing four software platforms - Forest (pyQuil), Qiskit, ProjectQ, and the Quantum Developer Kit (Q#) - that enable researchers to use real and simulated quantum devices. Our analysis covers requirements and installation, language syntax through example programs, library support, and quantum simulator capabilities for each platfo

Style APA, Harvard, Vancouver, ISO itp.

11

PHILLIPS, C., and R. PERROTT. "PROBLEMS WITH DATA PARALLELISM." Parallel Processing Letters 11, no. 01 (March 2001): 77–94. http://dx.doi.org/10.1142/s0129626401000440.

Pełny tekst źródła

Streszczenie:

The gradual evolution of language features and approaches used for the programming of distributed memory machines underwent substantial advances in the 1990s. One of the most promising and widely praised approaches was based on data parallelism and resulted in High Performance Fortran. This paper reports on an experiment using that approach based on a commercial distributed memory machine, available compilers and simple test programs. The results are disappointing and not encouraging. The variety of components involved and the lack of detailed knowledge available for the compilers compound the

Style APA, Harvard, Vancouver, ISO itp.

12

Jerbi, Khaled, Mickaël Raulet, Olivier Déforges, and Mohamed Abid. "Automatic Generation of Optimized and Synthesizable Hardware Implementation from High-Level Dataflow Programs." VLSI Design 2012 (August 16, 2012): 1–14. http://dx.doi.org/10.1155/2012/298396.

Pełny tekst źródła

Streszczenie:

In this paper, we introduce the Reconfigurable Video Coding (RVC) standard based on the idea that video processing algorithms can be defined as a library of components that can be updated and standardized separately. MPEG RVC framework aims at providing a unified high-level specification of current MPEG coding technologies using a dataflow language called Cal Actor Language (CAL). CAL is associated with a set of tools to design dataflow applications and to generate hardware and software implementations. Before this work, the existing CAL hardware compilers did not support high-level features o

Style APA, Harvard, Vancouver, ISO itp.

13

Nagy, Stefan. "The Fun in Fuzzing." Queue 20, no. 6 (December 31, 2022): 80–87. http://dx.doi.org/10.1145/3580504.

Pełny tekst źródła

Streszczenie:

Stefan Nagy, an assistant professor in the Kahlert School of Computing at the University of Utah, takes us on a tour of recent research in software fuzzing, or the systematic testing of programs via the generation of novel or unexpected inputs. The first paper he discusses extends the state of the art in coverage-guided fuzzing with the semantic notion of "likely invariants," inferred via techniques from property-based testing. The second explores encoding domain-specific knowledge about certain bug classes into test-case generation. His last selection takes us through the looking glass, rando

Style APA, Harvard, Vancouver, ISO itp.

14

Stepanov, Daniil, and Vladimir Itsykson. "Backend Bug Finder — a platform for effective compiler fuzzing." Information and Control Systems, no. 6 (December 27, 2022): 31–40. http://dx.doi.org/10.31799/1684-8853-2022-6-31-40.

Pełny tekst źródła

Streszczenie:

Introduction: The standard way to check the quality of a compiler is manual testing. However, it does not allow to cover a vast diversity of programs that can be written in a target programming language. Today, in addition to manual written tests there are many automated compiler testing methods, among which fuzzing is one of the most powerful and useful. A compiler fuzzer is a tool that generates a random program in a target language and checks how the compiler works in this language. Purpose: To develop a platform for compiler fuzzing and, based on it, to develop a tool for Kotlin compiler t

Style APA, Harvard, Vancouver, ISO itp.

15

Wu, Jiang, Jianjun Xu, Xiankai Meng, Haoyu Zhang, and Zhuo Zhang. "Enabling Reliability-Driven Optimization Selection with Gate Graph Attention Neural Network." International Journal of Software Engineering and Knowledge Engineering 30, no. 11n12 (November 2020): 1641–65. http://dx.doi.org/10.1142/s0218194020400240.

Pełny tekst źródła

Streszczenie:

Modern compilers provide a huge number of optional compilation optimization options. It is necessary to select the appropriate compilation optimization options for different programs or applications. To mitigate this problem, machine learning is widely used as an efficient technology. How to ensure the integrity and effectiveness of program information is the key to problem mitigation. In addition, when selecting the best compilation optimization option, the optimization goals are often execution speed, code size, and CPU consumption. There is not much research on program reliability. This pap

Style APA, Harvard, Vancouver, ISO itp.

16

Zhang, Du, and Michael D. Kramer. "GAPS: A Genetic Programming System." International Journal on Artificial Intelligence Tools 12, no. 02 (June 2003): 187–206. http://dx.doi.org/10.1142/s0218213003001198.

Pełny tekst źródła

Streszczenie:

One of the major approaches in the field of evolutionary computation is genetic programming. Genetic programming tackles the issue of how to automatically create a computer program for a given problem from some initial problem statement. The goal is accomplished by genetically breeding a population of computer programs in terms of genetic operations. In this paper, we describe a genetic programming system called GAPS. GAPS has the following features: (1) It implements the standard generational algorithm for genetic programming with some refinement on controlling introns growth during evolution

Style APA, Harvard, Vancouver, ISO itp.

17

Amir, Amihood, and Carl H. Smith. "The Syntax of Parallelism." Fundamenta Informaticae 19, no. 3-4 (October 1, 1993): 383–402. http://dx.doi.org/10.3233/fi-1993-193-409.

Pełny tekst źródła

Streszczenie:

One of the problems associated with the introduction of parallel processors is the so called “dusty deck” problem. A solution entails the development of optimizing compilers that transform programs previously written for a conventional serial processor into functionally equivalent programs that exploit the parallel processing capabilities of the new multiprocessor machines. We introduce a function Composition Model that models parallel architectures as a hierarchy of syntactic function definitions. Position in the hierarchy is equivalent to parallel time complexity in the modelled architecture

Style APA, Harvard, Vancouver, ISO itp.

18

Rodríguez, Gabriel, Louis-Noël Pouchet, and Juan Touriño. "Representing Integer Sequences Using Piecewise-Affine Loops." Mathematics 9, no. 19 (September 24, 2021): 2368. http://dx.doi.org/10.3390/math9192368.

Pełny tekst źródła

Streszczenie:

A formal, high-level representation of programs is typically needed for static and dynamic analyses performed by compilers. However, the source code of target applications is not always available in an analyzable form, e.g., to protect intellectual property. To reason on such applications, it becomes necessary to build models from observations of its execution. This paper details an algebraic approach which, taking as input the trace of memory addresses accessed by a single memory reference, synthesizes an affine loop with a single perfectly nested reference that generates the original trace.

Style APA, Harvard, Vancouver, ISO itp.

19

Erbsen, Andres, Jade Philipoom, Dustin Jamner, Ashley Lin, Samuel Gruetter, Clément Pit-Claudel, and Adam Chlipala. "Foundational Integration Verification of a Cryptographic Server." Proceedings of the ACM on Programming Languages 8, PLDI (June 20, 2024): 1704–29. http://dx.doi.org/10.1145/3656446.

Pełny tekst źródła

Streszczenie:

We present verification of a bare-metal server built using diverse implementation techniques and languages against a whole-system input-output specification in terms of machine code, network packets, and mathematical specifications of elliptic-curve cryptography. We used very different formal-reasoning techniques throughout the stack, ranging from computer algebra, symbolic execution, and verification-condition generation to interactive verification of functional programs including compilers for C-like and functional languages. All these component specifications and domain-specific reasoning t

Style APA, Harvard, Vancouver, ISO itp.

20

Dévai, Gergely, Zoltán Gera, and Zoltán Kelemen. "Language abstractions for low level optimization techniques." Computer Science and Information Systems 11, no. 4 (2014): 1499–514. http://dx.doi.org/10.2298/csis130224080d.

Pełny tekst źródła

Streszczenie:

Programmers are often forced to implement performance-critical applications at a low abstraction level. This leads to programs that are hard to develop and maintain because the program text is mixed with low level optimization tricks and is far from the algorithm it implements. Even if compilers are smart nowadays and provide the user with many automatically applied optimizations, practice shows that in some cases it is hopeless to optimize the program automatically without the programmer?s knowledge. A complementary approach is to allow the programmer to fine tune the program by providing him

Style APA, Harvard, Vancouver, ISO itp.

21

BONE, PAUL, ZOLTAN SOMOGYI, and PETER SCHACHTE. "Estimating the overlap between dependent computations for automatic parallelization." Theory and Practice of Logic Programming 11, no. 4-5 (July 2011): 575–91. http://dx.doi.org/10.1017/s1471068411000184.

Pełny tekst źródła

Streszczenie:

AbstractResearchers working on the automatic parallelization of programs have long known that too much parallelism can be even worse for performance than too little, because spawning a task to be run on another CPU incurs overheads. Autoparallelizing compilers have therefore long tried to use granularity analysis to ensure that they only spawn off computations whose cost will probably exceed the spawn-off cost by a comfortable margin. However, this is not enough to yield good results, because data dependencies may also limit the usefulness of running computations in parallel. If one computatio

Style APA, Harvard, Vancouver, ISO itp.

22

WOLSKI, RICH. "STATIC SCHEDULING OF HIERARCHICAL PROGRAM GRAPHS." Parallel Processing Letters 05, no. 04 (December 1995): 611–22. http://dx.doi.org/10.1142/s0129626495000540.

Pełny tekst źródła

Streszczenie:

Many parallel compilation systems represent programs internally as Directed Acyclic Graphs (DAGs). However, the storage of these DAGs becomes prohibitive when the program being compiled is large. In this paper we describe a compile-time scheduling methodology for hierarchical DAG programs represented in the IFX intermediate form. The method we present is itself hierarchical reducing the storage that would otherwise be required by a single flat DAG representation. We describe the scheduling model and demonstrate the method using the Optimizing Sisal Compiler and two scientific applications.

Style APA, Harvard, Vancouver, ISO itp.

23

Fahringer, T., and A. Požgaj. "P3T+: A Performance Estimator for Distributed and Parallel Programs." Scientific Programming 8, no. 2 (2000): 73–93. http://dx.doi.org/10.1155/2000/217384.

Pełny tekst źródła

Streszczenie:

Developing distributed and parallel programs on today's multiprocessor architectures is still a challenging task. Particular distressing is the lack of effective performance tools that support the programmer in evaluating changes in code, problem and machine sizes, and target architectures. In this paper we introduceP3T+ which is a performance estimator for mostly regular HPF (High Performance Fortran) programs but partially covers also message passing programs (MPI).P3T+ is unique by modeling programs, compiler code transformations, and parallel and distributed architectures. It computes at c

Style APA, Harvard, Vancouver, ISO itp.

24

Li, Yichen, Dongwei Xiao, Zhibo Liu, Qi Pang, and Shuai Wang. "Metamorphic Testing of Secure Multi-party Computation (MPC) Compilers." Proceedings of the ACM on Software Engineering 1, FSE (July 12, 2024): 1216–37. http://dx.doi.org/10.1145/3643781.

Pełny tekst źródła

Streszczenie:

The demanding need to perform privacy-preserving computations among multiple data owners has led to the prosperous development of secure multi-party computation (MPC) protocols. MPC offers protocols for parties to jointly compute a function over their inputs while keeping those inputs private. To date, MPC has been widely adopted in various real-world, privacy-sensitive sectors, such as healthcare and finance. Moreover, to ease the adoption of MPC, industrial and academic MPC compilers have been developed to automatically translate programs describing arbitrary MPC procedures into low-level MP

Style APA, Harvard, Vancouver, ISO itp.

25

Taylor, Matthew, Katherine Coons, Behnam Robatmili, Bertrand Maher, Doug Burger, and Kathryn McKinley. "Evolving Compiler Heuristics to Manage Communication and Contention." Proceedings of the AAAI Conference on Artificial Intelligence 24, no. 1 (July 5, 2010): 1690–93. http://dx.doi.org/10.1609/aaai.v24i1.7711.

Pełny tekst źródła

Streszczenie:

As computer architectures become increasingly complex, hand-tuning compiler heuristics becomes increasingly tedious and time consuming for compiler developers. This paper presents a case study that uses a genetic algorithm to learn a compiler policy. The target policy implicitly balances communication and contention among processing elements of the TRIPS processor, a physically realized prototype chip. We learn specialized policies for individual programs as well as general policies that work well across all programs. We also employ a two-stage method that first classifies the code being compi

Style APA, Harvard, Vancouver, ISO itp.

26

Mirzaev, Farrukh, and Khurshid Nematov. "Performance of Free Software and Freeware in Telecommunication System." Journal La Multiapp 1, no. 5 (January 12, 2021): 20–24. http://dx.doi.org/10.37899/journallamultiapp.v1i5.276.

Pełny tekst źródła

Streszczenie:

This article discusses the Performance of Free Software and Freeware in Telecommunication System. Software or software is a special term for data that is digitally formatted and stored, including computer programs, their documentation, and various information that can be read and written by a computer. In other words, part of a computer system that is intangible. This term emphasizes the difference from computer hardware. Making the software itself requires a "programming language" written by the programmer which is then compiled with the compiler application so that it becomes code that can b

Style APA, Harvard, Vancouver, ISO itp.

27

Jain, Aayush, Huijia Lin, and Amit Sahai. "Indistinguishability Obfuscation from Well-Founded Assumptions." Communications of the ACM 67, no. 3 (February 22, 2024): 97–105. http://dx.doi.org/10.1145/3611095.

Pełny tekst źródła

Streszczenie:

At least since the initial public proposal of public-key cryptography based on computational hardness conjectures, cryptographers have contemplated the possibility of a "one-way compiler" that translates computer programs into "incomprehensible" but equivalent forms. And yet, the search for such a "one-way compiler" remained elusive for decades. We examine a formalization of this concept with the notion of indistinguishability obfuscation (iO) . Roughly speaking, iO requires that the compiled versions of any two equivalent programs (with the same size and running time) be indistinguishable fro

Style APA, Harvard, Vancouver, ISO itp.

28

Lee, Jaejin, David A. Padua, and Samuel P. Midkiff. "Basic compiler algorithms for parallel programs." ACM SIGPLAN Notices 34, no. 8 (August 1999): 1–12. http://dx.doi.org/10.1145/329366.301105.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

29

Soni, Sumit, and Pravesh Kumar. "Compiler Construction for a Network Identification." Journal of Advance Research in Electrical & Electronics Engineering (ISSN: 2208-2395) 1, no. 4 (April 30, 2014): 1317. http://dx.doi.org/10.53555/nneee.v1i4.240.

Pełny tekst źródła

Streszczenie:

The Compiler Construction is mainly used to improve the network processing system through the advance advance compiler design.The name Compiler is primarily used for programs that translate source code from a high –level programming language to a lower level language.The advance compiler design is useful in the industrial application like telecommunication. Our approach to increase the flexibility ,productivity and usability of the system to target with the minimal effort .we use the bit level addressing for the network processor we show how a compiler backend has been design and also improve

Style APA, Harvard, Vancouver, ISO itp.

30

HAN, JIA WEI. "ON THE POWER OF QUERY-INDEPENDENT COMPILATION." International Journal of Software Engineering and Knowledge Engineering 02, no. 02 (June 1992): 277–92. http://dx.doi.org/10.1142/s0218194092000142.

Pełny tekst źródła

Streszczenie:

Recursive query processing techniques can be classified into three categories: interpretation, query-dependent compilation and query-independent compilation. Query-dependent compilation compiles IDB (Intensional Data Base) programs based on possible query instantiations into query-specific programs, while query-independent compilation compiles IDB programs into query-independent and easily analyzable relational expressions. Previous studies show that linear recursions can be query-independently compiled into highly regular forms. This study analyzes the power of query-independent compilation a

Style APA, Harvard, Vancouver, ISO itp.

31

Wells, Mark B., Margaret A. Hug, and Rollo Silver. "Libraries as programs preserved within compiler continuations." ACM SIGPLAN Notices 20, no. 7 (July 1985): 83–91. http://dx.doi.org/10.1145/17919.806830.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

32

Armstrong, Brian, Seon Wook Kim, Insung Park, Michael Voss, and Rudolf Eigenmann. "Compiler-based tools for analyzing parallel programs." Parallel Computing 24, no. 3-4 (May 1998): 401–20. http://dx.doi.org/10.1016/s0167-8191(98)00019-2.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

33

Marouf, Lzzam A., Omar W. Abdul-Wahab, and Luma A. Kamel. "FTIZZY CONTROLLERS FOR SINGLE POINTCONTROLLER-I (SPC-l) SYSTEMS." Journal of Engineering 10, no. 1 (March 13, 2024): 91–101. http://dx.doi.org/10.31026/j.eng.2004.01.08.

Pełny tekst źródła

Streszczenie:

Advances in computer technology have introduced computers everywhere. One of the fields that the computers have entered is the field of process control and data acquisition systems. On the other hand, fuzzy control is emerging as an alternative to conventional control to control different systems. this paper is concerned with applying fuzzy control to a locally designed and manufactured process controller. This controller is designated by single point controller-1 (SPC-l)' It is basically a flexible and general-purpose, stand-alone, single-point controller. The CPU section of the SPC-1 is the

Style APA, Harvard, Vancouver, ISO itp.

34

He, Xuzhen. "Accelerated linear algebra compiler for computationally efficient numerical models: Success and potential area of improvement." PLOS ONE 18, no. 2 (February 24, 2023): e0282265. http://dx.doi.org/10.1371/journal.pone.0282265.

Pełny tekst źródła

Streszczenie:

The recent dramatic progress in machine learning is partially attributed to the availability of high-performant computers and development tools. The accelerated linear algebra (XLA) compiler is one such tool that automatically optimises array operations (mostly fusion to reduce memory operations) and compiles the optimised operations into high-performant programs specific to target computing platforms. Like machine-learning models, numerical models are often expressed in array operations, and thus their performance can be boosted by XLA. This study is the first of its kind to examine the effic

Style APA, Harvard, Vancouver, ISO itp.

35

Bowles, Andrew. "Trends in applying abstract interpretation." Knowledge Engineering Review 7, no. 2 (June 1992): 157–71. http://dx.doi.org/10.1017/s0269888900006275.

Pełny tekst źródła

Streszczenie:

AbstractAbstract interpretation is a principled approach to inferring properties of a program's execution by simulating that execution using an interpreter which computes over some abstraction of the program's usual, concrete domain, and which collects the information of interest during the execution. Abstract interpretation has been used as the basis of research in logic and functional programming, particularly in applications concerned with compiler optimizations. However, abstract interpretation has the potential to be used in other applications, such as debugging or verification of program

Style APA, Harvard, Vancouver, ISO itp.

36

Liu, Amanda, Gilbert Bernstein, Adam Chlipala, and Jonathan Ragan-Kelley. "A Verified Compiler for a Functional Tensor Language." Proceedings of the ACM on Programming Languages 8, PLDI (June 20, 2024): 320–42. http://dx.doi.org/10.1145/3656390.

Pełny tekst źródła

Streszczenie:

Producing efficient array code is crucial in high-performance domains like image processing and machine learning. It requires the ability to control factors like compute intensity and locality by reordering computations into different stages and granularities with respect to where they are stored. However, traditional pure, functional tensor languages struggle to do so. In a previous publication, we introduced ATL as a pure, functional tensor language capable of systematically decoupling compute and storage order via a set of high-level combinators known as reshape operators. Reshape operators

Style APA, Harvard, Vancouver, ISO itp.

37

DE LA BANDA, MARIC GARCÍA, WARWICK HARVEY, KIM MARRIOTT, PETER J. STUCKEY, and BART DEMOEN. "Checking modes of HAL programs." Theory and Practice of Logic Programming 5, no. 6 (October 31, 2005): 623–67. http://dx.doi.org/10.1017/s1471068404002327.

Pełny tekst źródła

Streszczenie:

Recent constraint logic programming (CLP) languages, such as HAL and Mercury, require type, mode and determinism declarations for predicates. This information allows the generation of efficient target code and the detection of many errors at compile-time. Unfortunately, mode checking in such languages is difficult. One of the main reasons is that, for each predicate mode declaration, the compiler is required to appropriately re-order literals in the predicate's definition. The task is further complicated by the need to handle complex instantiations (which interact with type declarations and hi

Style APA, Harvard, Vancouver, ISO itp.

38

Leinenbach, Dirk, and Elena Petrova. "Pervasive Compiler Verification – From Verified Programs to Verified Systems." Electronic Notes in Theoretical Computer Science 217 (July 2008): 23–40. http://dx.doi.org/10.1016/j.entcs.2008.06.040.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

39

Michel, Jesse, Kevin Mu, Xuanda Yang, Sai Praveen Bangaru, Elias Rojas Collins, Gilbert Bernstein, Jonathan Ragan-Kelley, Michael Carbin, and Tzu-Mao Li. "Distributions for Compositionally Differentiating Parametric Discontinuities." Proceedings of the ACM on Programming Languages 8, OOPSLA1 (April 29, 2024): 893–922. http://dx.doi.org/10.1145/3649843.

Pełny tekst źródła

Streszczenie:

Computations in physical simulation, computer graphics, and probabilistic inference often require the differentiation of discontinuous processes due to contact, occlusion, and changes at a point in time. Popular differentiable programming languages, such as PyTorch and JAX, ignore discontinuities during differentiation. This is incorrect for parametric discontinuities —conditionals containing at least one real-valued parameter and at least one variable of integration. We introduce Potto, the first differentiable first-order programming language to soundly differentiate parametric discontinuiti

Style APA, Harvard, Vancouver, ISO itp.

40

Esraa, Esraa. "Predicting Loop Vectorization through Machine Learning Algorithms." Fusion: Practice and Applications 15, no. 2 (2024): 36–45. http://dx.doi.org/10.54216/fpa.150203.

Pełny tekst źródła

Streszczenie:

Automatic vectorization is often utilized to improve the speed of compute-intensive programs on current CPUs. However, there is enormous space for improvement in present compiler auto-vectorization capabilities. Execution with optimizing code on these resource-controlled strategies is essential for both energy and performance efficiency. While vectorization suggests major performance developments, conventional compiler auto-vectorization techniques often fail. This study investigated the prospective of machine learning algorithms to enhance vectorization. The study proposes an ensemble learnin

Style APA, Harvard, Vancouver, ISO itp.

41

Mehta, Sanyam, and Pen-Chung Yew. "Improving compiler scalability: optimizing large programs at small price." ACM SIGPLAN Notices 50, no. 6 (August 7, 2015): 143–52. http://dx.doi.org/10.1145/2813885.2737954.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

42

Black, Paul, and Iqbal Gondal. "Cross-Compiler Bipartite Vulnerability Search." Electronics 10, no. 11 (June 7, 2021): 1356. http://dx.doi.org/10.3390/electronics10111356.

Pełny tekst źródła

Streszczenie:

Open-source libraries are widely used in software development, and the functions from these libraries may contain security vulnerabilities that can provide gateways for attackers. This paper provides a function similarity technique to identify vulnerable functions in compiled programs and proposes a new technique called Cross-Compiler Bipartite Vulnerability Search (CCBVS). CCBVS uses a novel training process, and bipartite matching to filter SVM model false positives to improve the quality of similar function identification. This research uses debug symbols in programs compiled from open-sour

Style APA, Harvard, Vancouver, ISO itp.

43

Tian, Xinmin, Jay P. Hoeflinger, Grant Haab, Yen-Kuang Chen, Milind Girkar, and Sanjiv Shah. "A compiler for exploiting nested parallelism in OpenMP programs." Parallel Computing 31, no. 10-12 (October 2005): 960–83. http://dx.doi.org/10.1016/j.parco.2005.03.007.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

44

Yang, Yi, Ping Xiang, Jingfei Kong, and Huiyang Zhou. "An optimizing compiler for GPGPU programs with input-data sharing." ACM SIGPLAN Notices 45, no. 5 (May 2010): 343–44. http://dx.doi.org/10.1145/1837853.1693505.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

45

Huang, Lei, Deepak Eachempati, Marcus W. Hervey, and Barbara Chapman. "Exploiting global optimizations for openmp programs in the openuh compiler." ACM SIGPLAN Notices 44, no. 4 (February 14, 2009): 289–90. http://dx.doi.org/10.1145/1594835.1504219.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

46

Newton, Ryan R., Lewis D. Girod, Michael B. Craig, Samuel R. Madden, and John Gregory Morrisett. "Design and evaluation of a compiler for embedded stream programs." ACM SIGPLAN Notices 43, no. 7 (June 27, 2008): 131–40. http://dx.doi.org/10.1145/1379023.1375675.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

47

Marowka, Ami. "Bsp2omp: A Compiler For Translating Bsp Programs To Openmp." International Journal of Parallel, Emergent and Distributed Systems 24, no. 4 (August 2009): 293–310. http://dx.doi.org/10.1080/17445760902719927.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

48

Ierotheou, C. S., S. P. Johnson, P. F. Leggett, M. Cross, E. W. Evans, H. Jin, M. Frumkin, and J. Yan. "The Semi-Automatic Parallelisation of Scientific Application Codes Using a Computer Aided Parallelisation Toolkit." Scientific Programming 9, no. 2-3 (2001): 163–73. http://dx.doi.org/10.1155/2001/327048.

Pełny tekst źródła

Streszczenie:

The shared-memory programming model can be an effective way to achieve parallelism on shared memory parallel computers. Historically however, the lack of a programming standard using directives and the limited scalability have affected its take-up. Recent advances in hardware and software technologies have resulted in improvements to both the performance of parallel programs with compiler directives and the issue of portability with the introduction of OpenMP. In this study, the Computer Aided Parallelisation Toolkit has been extended to automatically generate OpenMP-based parallel programs wi

Style APA, Harvard, Vancouver, ISO itp.

49

Campanoni, Simone, Kevin Brownell, Svilen Kanev, Timothy M. Jones, Gu-Yeon Wei, and David Brooks. "Automatically accelerating non-numerical programs by architecture-compiler co-design." Communications of the ACM 60, no. 12 (November 27, 2017): 88–97. http://dx.doi.org/10.1145/3139461.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

50

Lenglet, Romain, Thierry Coupaye, and Eric Bruneton. "Composing transformations of compiled Java programs with Jabyce." Computer Science and Information Systems 1, no. 2 (2004): 83–125. http://dx.doi.org/10.2298/csis0402083l.

Pełny tekst źródła

Streszczenie:

This article introduces Jabyce, a software framework for the implementation and composition of transformations of compiled Java programs. Most distinguishing features of Jabyce are 1) its interaction orientation, i.e. it represents elements of transformed programs as interactions (method calls) which generally consumes less memory and CPU time than representing programs as graphs of objects; and 2) its component orientation, i.e. it allows for the design and composition of transformers as software components based on the Fractal component model. This latter point is strongly connected to infra

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!