Filters








1,098,260 Hits in 4.2 sec

Scaling irregular parallel codes with minimal programming effort

Dimitrios S. Nikolopoulos, Constantine D. Polychronopoulos, Eduard Ayguadé
2001 Proceedings of the 2001 ACM/IEEE conference on Supercomputing (CDROM) - Supercomputing '01  
The long foreseen goal of parallel programming models is to scale parallel code without significant programming effort.  ...  We claim that our parallelization methodology requires the minimum amount of effort from the programmer and prove experimentally that it is able to scale two highly irregular codes as well as MPI, with  ...  Acknowledgments We are grateful to the ECMWF and Siegfried Benkner for providing us with the irregular kernels.  ... 
doi:10.1145/582034.582050 dblp:conf/sc/NikolopoulosPA01 fatcat:iq75fa4my5bsjbfe5kmx4fq2te

Efficient run-time dispatching in generic programming with minimal code bloat

Lubomir Bourdev, Jaakko Järvi
2011 Science of Computer Programming  
Generic programming with C++ templates results in efficient but inflexible code: efficient, because the exact types of inputs to generic functions are known at compile time; inflexible because they must  ...  This was the case even with compilers that perform aggressive template hoisting at the compiler level, due to significantly smaller dispatching code.  ...  We show, however, improvement even with the most aggressive code-size minimization settings.  ... 
doi:10.1016/j.scico.2008.06.003 fatcat:2rb4rzwmunguplflb5quuzlsea

Detecting Arithmetic Optimization Opportunities for C Compilers by Randomly Generated Equivalent Programs

Atsushi Hashimoto, Nagisa Ishiura
2016 IPSJ Transactions on System LSI Design Methodology  
By comparing the two assembly codes compiled from the two C programs, lack of optimization on either of the programs is detected.  ...  Two random programs differing only on the initial values for volatile variables are generated, and the resulting assembly codes are compared.  ...  Figure 8 shows a minimized test case for GCC-4.8.2 with -O3 option. The two C programs in (a) differ only on line 07 and expected to compile to the same code.  ... 
doi:10.2197/ipsjtsldm.9.21 fatcat:jieh73b4jjfufmytjy3ifb4nou

Minimal Session Types (Artifact) [article]

Alen Arslanagic, Jorge A. Pérez, Erik Voogd, Manuel Rigger, Maria Christakis
2019 Dagstuhl Artifacts Series (DARTS)  
This artifact contains MISTY, a tool that decomposes message-passing programs with session types into programs typable with the minimal session types we introduce in our ECOOP paper.  ...  Given a source program in this language, MISTY follows the results in our ECOOP paper to produce L A T E X code for its corresponding decomposition.  ...  Pérez is also with CWI, Amsterdam and the NOVA Laboratory for Computer Science and Informatics (FCT grant NOVA LINCS PEst/UID/CEC/04516/2013), Universidade Nova de Lisboa, Portugal.  ... 
doi:10.4230/darts.5.2.5 dblp:journals/darts/ArslanagicPV19 fatcat:5a5dokjgtrgnvgpgosmngo3vma

An ECMA-55 Minimal BASIC Compiler for x86-64 Linux®

John Ham
2014 Computers  
This paper describes a new non-optimizing compiler for the ECMA-55 Minimal BASIC language that generates x86-64 assembler code for use on the x86-64 Linux ® [1] 3.x platform.  ...  The generated assembly code is also designed to be simple to read.  ...  Emmanuel Roche for providing copies of several of the NBS Minimal BASIC test suite programs.  ... 
doi:10.3390/computers3030069 fatcat:qx5xdi34lrbkjdvwzdo56rrkge

On Controlling the Attack Surface of Object-Oriented Refactorings

Sebastian Ruland, Géza Kulcsár, Erhan Leblebici, Sven Peldszus, Malte Lochau
2020 Software Engineering  
Minimizing the attack surface naturally competes with applicability of established refactorings like MoveMethod, frequently used for improving code quality in terms of coupling/cohesion measures.  ...  Search-based techniques have shown promising results in finding near-optimal sequences of behavior-preserving program transformations that (1) maximize code-quality metrics and (2) minimize the number  ...  of the original program design (i.e., minimizing the number of changes).  ... 
doi:10.18420/se2020_26 dblp:conf/se/RulandKLPL20 fatcat:dcfcycijczc6nje7iffdlunk4i

Micro Spitbol [article]

Robert B. K. Dewar, Martin Charles Golumbic, Clinton F. Goss
2013 arXiv   pre-print
These techniques are discussed along with a description of an initial implementation on a 65K byte minicomputer.  ...  An interesting theoretical problem which arises when using procedures which compact the interpretive object code is also analyzed.  ...  Memory may become so inexpensive that a direct translation of the MINIMAL code to the target machine code would be preferable for small MINIMAL programs.  ... 
arXiv:1308.6096v1 fatcat:56vop7k4tbdvrhlzt7xblydnc4

Automatic Testing of Program Slicers

Sergio Pérez, Josep Silva, Salvador Tamarit
2019 Scientific Programming  
The suite comes with a collection of Erlang benchmarks together with different slicing criteria and the associated minimal slices.  ...  Computing minimal slices is undecidable in the general case, and obtaining the minimal slice of a given program is normally computationally prohibitive even for very small programs.  ...  However, the slice in the middle is not minimal. e minimal slice of the original program is the code on the right.  ... 
doi:10.1155/2019/4108652 fatcat:b32gxmuh6jfanogkkq4unuiq7a

Representative samples of programmable functions

L.K. Schubert
1974 Information and Control  
Specifically, there is a "sample" (finite subset) of ¢ such that every minimal program for the sample is a program for 6.  ...  For example, it is shown that any decision function with a representative sample of l elements can be programmed with no more than (4 + [log~ m])(/--1) + c bits, where the largest argument appearing in  ...  If all functions computed by M with the absolutely minimal programs are empty, let Y0 = 0 and z o = 0.  ... 
doi:10.1016/s0019-9958(74)90777-3 fatcat:ypgstr6yobaerpggvtste3ibqi

Automated debugging in Eclipse

Philipp Bouillon, Martin Burger, Andreas Zeller
2003 Proceedings of the 2003 OOPSLA workshop on eclipse technology eXchange - eclipse '03  
Recent advances in debugging allow for automatic isolation of failure causes such as failure-inducing input or code changes.  ...  So far, these advances required a significant infrastructure, notably program analysis, automated testing, or automated construction.  ...  failureinducing code changes.  ... 
doi:10.1145/965660.965661 dblp:conf/oopsla/BouillonBZ03 fatcat:x5ocrdjyifhcvlwqws4k5e5day

An Inexact Restoration Package for Bilevel Programming Problems

Elvio A. Pilotta, Germán A. Torres
2012 Applied Mathematics  
With this strategy we maintain the minimization structure of the lower level problem and avoid spurious solutions.  ...  Bilevel programming problems are a class of optimization problems with hierarchical structure where one of the constraints is also an optimization problem.  ...  There are several formulations for the bilevel programming problem in the literature with their own code, but not software packages.  ... 
doi:10.4236/am.2012.330181 fatcat:dersgkfy4vb5rkzt7oxf6qpvae

Minimizing Data Size for Efficient Data Reuse in Grid-Enabled Medical Applications [chapter]

Fumihiko Ino, Katsunori Matsuo, Yasuharu Mizutani, Kenichi Hagihara
2006 Lecture Notes in Computer Science  
To promote this at the program block level, our method minimizes the data size of attribute values, which are used for identification of computation products stored in a database (DB) server.  ...  This paper presents a data minimization method that aims at reducing overhead for data reuse in grid environments.  ...  Principles of Data Minimization Suppose that we have a DAG G = (V, E) with a set R ⊂ V of vertices initially marked as the target code for data reuse (see Fig. 5 ).  ... 
doi:10.1007/11946465_18 fatcat:mpocgjkmgnfbrgbabr6nx4icga

Code Re-ordering for a Class of Reconfigurable Microprocessors [chapter]

Brian F. Veale, John K. Antonio, Monte P. Tull
2004 Lecture Notes in Computer Science  
to re-order the given program code so as to minimize the number of configuration switches required to execute the program on the reconfigurable processor.  ...  The greedy algorithm is used to re-order machine code to minimize the number of reconfigurations required.  ...  to re-order the given program code so as to minimize the number of configuration switches required to execute the program on the reconfigurable processor.  ... 
doi:10.1007/978-3-540-30117-2_160 fatcat:gn5nzftzvvdtphcm5pq7csfktm

An Efficient Heuristic Based Test Suite Minimization Approach

Fayaz Ahmad Khan, Dibya Jyoti Bora, Anil Kumar Gupta
2017 Indian Journal of Science and Technology  
But, it has been found that the acquired test cases after minimization severely lacks ability to achieve the desirable code coverage because the minimization was done based on a single test adequacy criteria  ...  Findings: Our experimental results indicate that a significant percentage of reduction in the test suite size is achieved when the minimization is performed with respect to multiple test adequacy criterions  ...  With the proposed test suite minimization, the initial test suite is further minimized with respect to branch and path coverage perspective in order to improve the code coverage and fault detection effectiveness  ... 
doi:10.17485/ijst/2017/v10i29/106374 fatcat:tditj6fpdvhfjf3thvxak6lml4

Development of a novel tool for assessing coverage of implementation factors in health promotion program resources

Carolina M. Bejarano, Kelli Snow, Hannah Lane, Hannah Calvert, Kate Hoppe, Nicole Alfonsin, Lindsey Turner, Jordan A. Carlson
2019 Preventive medicine reports  
All other CBPA-specific codes were coded as: 0 = not covered in the program, 1 = covered in the program but at a minimal level, and 2 = covered more than minimally in the program.  ...  One coder coded all Intervention Characteristics, with all other domains double coded by 2 of the 5 coders (with an approximately equal number of programs being coded by each).  ... 
doi:10.1016/j.pmedr.2019.100909 pmid:31194155 pmcid:PMC6551551 fatcat:pcalm44hxngadpzseejez4746u
« Previous Showing results 1 — 15 out of 1,098,260 results