Author image not provided
 Alain Ketterlin

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article4.00
Citation Count56
Publication count14
Publication years1994-2016
Available for download4
Average downloads per article253.25
Downloads (cumulative)1,013
Downloads (12 Months)100
Downloads (6 Weeks)5
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


14 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 14 of 14
Sort by:

1 published by ACM
September 2016 PACT '16: Proceedings of the 2016 International Conference on Parallel Architectures and Compilation
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 3,   Downloads (12 Months): 29,   Downloads (Overall): 47

Full text available: PDFPDF
Loop optimizations span from vectorization, scalar promotion, loop invariant code motion, software pipelining to loop fusion, skewing, tiling and loop parallelization. These transformations are essential in the quest for automated high-performance code generation. Determining the validity of loop transformations at compile time requires analyzing all possible data dependences that may ...
Keywords: polyhedral transformation, code versioning, compilers

2
October 2014 SBAC-PAD '14: Proceedings of the 2014 IEEE 26th International Symposium on Computer Architecture and High Performance Computing
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

Heterogeneous Many Cores (HMC) architectures that mix many simple/small cores with a few complex/large cores are emerging as a design alternative that can provide both fast sequential performance for single threaded workloads and power-efficient execution for through-put oriented parallel workloads. The availability of many small cores in a HMC presents ...

3
February 2014 Science of Computer Programming: Volume 80 Issue PB, February 2014
Publisher: Elsevier North-Holland, Inc.
Bibliometrics:
Citation Count: 0

This paper deals with the binary analysis of executable programs, with the goal of understanding how they access memory. It explains how to statically build a formal model of all memory accesses. Starting with a control flow graph of each procedure, well-known techniques are used to structure this graph into ...
Keywords: Decompilation, Memory tracing, Binary analysis, Program skeletonization, Static single assignment, Automatic parallelization, Memory accesses

4
February 2014 Science of Computer Programming: Volume 80, February, 2014
Publisher: Elsevier North-Holland, Inc.
Bibliometrics:
Citation Count: 0

This paper deals with the binary analysis of executable programs, with the goal of understanding how they access memory. It explains how to statically build a formal model of all memory accesses. Starting with a control flow graph of each procedure, well-known techniques are used to structure this graph into ...
Keywords: Decompilation, Memory tracing, Binary analysis, Program skeletonization, Static single assignment, Automatic parallelization, Memory accesses

5
December 2012 MICRO-45: Proceedings of the 2012 45th Annual IEEE/ACM International Symposium on Microarchitecture
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 8
Downloads (6 Weeks): 0,   Downloads (12 Months): 29,   Downloads (Overall): 252

Full text available: PDFPDF
This paper describes a tool using one or more executions of a sequential program to detect parallel portions of the program. The tool, called Par wiz, uses dynamic binary instrumentation, targets various forms of parallelism, and suggests distinct parallelization actions, ranging from simple directive tagging to elaborate loop transformations. The ...

6 published by ACM
January 2012 ACM Transactions on Architecture and Code Optimization (TACO) - Special Issue on High-Performance Embedded Architectures and Compilers: Volume 8 Issue 4, January 2012
Publisher: ACM
Bibliometrics:
Citation Count: 6
Downloads (6 Weeks): 1,   Downloads (12 Months): 23,   Downloads (Overall): 416

Full text available: PDFPDF
Many automatic software parallelization systems have been proposed in the past decades, but most of them are dedicated to source-to-source transformations. This paper shows that parallelizing executable programs is feasible, even if they require complex transformations, and in effect decouples parallelization from compilation, for example, for closed-source or legacy software, ...

7
April 2011 ISPASS '11: Proceedings of the IEEE International Symposium on Performance Analysis of Systems and Software
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 3

Memory profiling is useful for a variety of tasks, most notably to produce traces of memory accesses for cache simulation. However, instrumenting every memory access incurs a large overhead, in the amount of code injected in the original program as well as in execution time. This paper describes how static ...

8
March 2011 Pattern Recognition: Volume 44 Issue 3, March, 2011
Publisher: Elsevier Science Inc.
Bibliometrics:
Citation Count: 32

Mining sequential data is an old topic that has been revived in the last decade, due to the increasing availability of sequential datasets. Most works in this field are centred on the definition and use of a distance (or, at least, a similarity measure) between sequences of elements. A measure ...
Keywords: Dynamic time warping, Time series clustering, Distance-based clustering, Global averaging, Satellite image time series, Sequence analysis, Time series averaging, DTW barycenter averaging

9
September 2010 SCAM '10: Proceedings of the 2010 10th IEEE Working Conference on Source Code Analysis and Manipulation
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

This paper deals with the binary analysis of executable programs, with the goal of understanding how they access memory. It explains how to statically build a formal model of all memory accesses. Starting with a control-flow graph of each procedure, well-known techniques are used to structure this graph into a ...
Keywords: binary analysis, static single assignment form, memory accesses, modeling, profiling

10 published by ACM
April 2008 CGO '08: Proceedings of the 6th annual IEEE/ACM international symposium on Code generation and optimization
Publisher: ACM
Bibliometrics:
Citation Count: 7
Downloads (6 Weeks): 1,   Downloads (12 Months): 19,   Downloads (Overall): 298

Full text available: PDFPDF
This paper describes an algorithm that takes a trace (i.e., a sequence of numbers or vectors of numbers) as input, and from that produces a sequence of loop nests that, when run, produces exactly the original sequence. The input format is suitable for any kind of program execution trace, and ...
Keywords: data access, trace analysis, nested loop recognition, trace compression, value prediction

11
August 1997 KDD'97: Proceedings of the Third International Conference on Knowledge Discovery and Data Mining
Publisher: AAAI Press
Bibliometrics:
Citation Count: 0

This paper is about the unsupervised discovery of patterns in sequences of composite objects. A composite object may be described as a sequence of other, simpler data. In such cases, not only the nature of the components is important, but also the order in which these components appear. The present ...

12
August 1995 KDD'95: Proceedings of the First International Conference on Knowledge Discovery and Data Mining
Publisher: AAAI Press
Bibliometrics:
Citation Count: 0

Many machine-learning (either supervised or unsupervised) techniques assume that data present themselves in an attribute-value form. But this formalism is largely insufficient to account for many applications. Therefore, much of the ongoing research now focuses on first-order learning systems. But complex formalisms lead to high computational complexities. On the other ...

13
May 1994 ECML-94: Proceedings of the European conference on machine learning on Machine Learning
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0


14
April 1994 ECML'94: Proceedings of the 7th European Conference on Machine Learning
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

Most empirical learning algorithms describe objects as a list of attribute-value pairs. A flat attribute-value representation fails, however, to capture the internal structure of real objects. Mechanisms are therefore needed to represent the different levels of detail at which an object can be seen. A common structuring method is reviewed, ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us