Ernesto Dufrechou
Applied Filters
- Ernesto Dufrechou
- AuthorRemove filter
People
Colleagues
- Ernesto Dufrechou (19)
- Pablo Ezzatti (19)
- Enrique S Quintana-Ortí (12)
- José Ignacio Aliaga (6)
- Peter Benner (5)
- Alfredo Remón (3)
- Matthias Bollhöfer (3)
- Federico Favaro (2)
- Juan P Oliver (2)
- Manuel Freire (2)
- María Barreda (2)
- Martín Pedemonte (2)
- Pablo Igounet (2)
- Alejandro Gutiérrez (1)
- Gabriel Cazes (1)
- José Hagopian (1)
- Juan Pablo Silva (1)
- Marcel Burdiat (1)
- Rodrigo Gallardo (1)
- Rosa M Badia (1)
Publication
Proceedings/Book Names
- Applied Reconfigurable Computing. Architectures, Tools, and Applications (1)
- Euro-Par 2021: Parallel Processing Workshops (1)
- Euro-Par 2023: Parallel Processing Workshops (1)
- ISPDC '14: Proceedings of the 2014 IEEE 13th International Symposium on Parallel and Distributed Computing (1)
- PMAM'18: Proceedings of the 9th International Workshop on Programming Models and Applications for Multicores and Manycores (1)
- Proceedings of the 14th International Conference on Computational Science and Its Applications ICCSA 2014 - Volume 8584 (1)
- WAMCA '12: Proceedings of the 2012 Third Workshop on Applications for Multi-Core Architecture (1)
Publication Date
Export Citations
Publications
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-article
Tuning high-level synthesis SpMV kernels in Alveo FPGAs
- Federico Favaro
Instituto de Ingeniería Eléctrica, Facultad de Ingeniería, Universidad de la República, Montevideo, 11300, Uruguay
, - Ernesto Dufrechou
Instituto de Computación, Facultad de Ingeniería, Universidad de la República, Montevideo, 11300, Uruguay
, - Juan P. Oliver
Instituto de Ingeniería Eléctrica, Facultad de Ingeniería, Universidad de la República, Montevideo, 11300, Uruguay
, - Pablo Ezzatti
Instituto de Computación, Facultad de Ingeniería, Universidad de la República, Montevideo, 11300, Uruguay
Microprocessors & Microsystems, Volume 110, Issue C•Oct 2024 • https://doi.org/10.1016/j.micpro.2024.105104AbstractSparse Matrix-Vector Multiplication (SpMV) is an essential operation in scientific and engineering fields, with applications in areas like finite element analysis, image processing, and machine learning. To address the need for faster and more ...
- 0Citation
MetricsTotal Citations0
- Federico Favaro
- Article
Sparse Matrix-Vector Product for the bmSparse Matrix Format in GPUs
- Gonzalo Berger
https://ror.org/030bbe882Instituto de Computación, Universidad de la República, J. H. y Reissig 565, 11300, Montevideo, Uruguay
, - Ernesto Dufrechou
https://ror.org/030bbe882Instituto de Computación, Universidad de la República, J. H. y Reissig 565, 11300, Montevideo, Uruguay
, - Pablo Ezzatti
https://ror.org/030bbe882Instituto de Computación, Universidad de la República, J. H. y Reissig 565, 11300, Montevideo, Uruguay
Euro-Par 2023: Parallel Processing Workshops•August 2023, pp 246-256• https://doi.org/10.1007/978-3-031-50684-0_19AbstractHistorically, the sparse matrix-vector product (SpMV) acceleration concentrated the central part of the research efforts devoted to sparse linear algebra kernels. Lately, other fundamental sparse operations have gained considerable attention. A ...
- 0Citation
MetricsTotal Citations0
- Gonzalo Berger
- research-article
A GPU method for the analysis stage of the SPTRSV kernel
- Manuel Freire
Facultad de Ingeniería, Instituto de Computación, INCO, Universidad de la República, Montevideo, Uruguay
, - Juan Ferrand
Facultad de Ingeniería, Instituto de Computación, INCO, Universidad de la República, Montevideo, Uruguay
, - Franco Seveso
Facultad de Ingeniería, Instituto de Computación, INCO, Universidad de la República, Montevideo, Uruguay
, - Ernesto Dufrechou
Facultad de Ingeniería, Instituto de Computación, INCO, Universidad de la República, Montevideo, Uruguay
, - Pablo Ezzatti
Facultad de Ingeniería, Instituto de Computación, INCO, Universidad de la República, Montevideo, Uruguay
The Journal of Supercomputing, Volume 79, Issue 13•Sep 2023, pp 15051-15078 • https://doi.org/10.1007/s11227-023-05238-8AbstractThe solution of sparse triangular linear systems of equations (SPTRSV) is often the main computational bottleneck of many numerical methods in science and engineering. In GPUs, this operation is solved using mainly two approaches. Level-set ...
- 0Citation
MetricsTotal Citations0
- Manuel Freire
- research-article
Machine learning for optimal selection of sparse triangular system solvers on GPUs
- Ernesto Dufrechou
Instituto de Computación (INCO), Facultad de Ingeniería, Universidad de la República, Montevideo, Uruguay
, - Pablo Ezzatti
Instituto de Computación (INCO), Facultad de Ingeniería, Universidad de la República, Montevideo, Uruguay
, - Manuel Freire
Instituto de Computación (INCO), Facultad de Ingeniería, Universidad de la República, Montevideo, Uruguay
, - Enrique S. Quintana-Ortí
Depto. de Sistemas de Informática de Sistemas y Computadores, Universitat Politècnica de València, Spain
Journal of Parallel and Distributed Computing, Volume 158, Issue C•Dec 2021, pp 47-55 • https://doi.org/10.1016/j.jpdc.2021.07.013Highlights- Using machine learning to select between several spTrsv realizations for GPUs.
- ...
AbstractMany numerical algorithms for science and engineering applications require the solution of sparse triangular linear systems (sptrsv) as their most costly stage. For this reason, considerable research has been dedicated to produce ...
- 3Citation
MetricsTotal Citations3
- Ernesto Dufrechou
- research-article
Factorized solution of generalized stable Sylvester equations using many-core GPU accelerators
- Peter Benner
Max Planck Institute for Dynamics of Complex Technical Systems, Magdeburg, Germany
, - Ernesto Dufrechou
Facultad de Ingeniería, Universidad de la República, Montevideo, Uruguay
, - Pablo Ezzatti
Facultad de Ingeniería, Universidad de la República, Montevideo, Uruguay
, - Rodrigo Gallardo
Facultad de Ingeniería, Universidad de la República, Montevideo, Uruguay
, - Enrique S. Quintana-Ortí
DISCA, Universitat Politècnica de València, Valencia, Spain
The Journal of Supercomputing, Volume 77, Issue 9•Sep 2021, pp 10152-10164 • https://doi.org/10.1007/s11227-021-03658-yAbstractWe investigate the factorized solution of generalized stable Sylvester equations such as those arising in model reduction, image restoration, and observer design. Our algorithms, based on the matrix sign function, take advantage of the current ...
- 0Citation
MetricsTotal Citations0
- Peter Benner
- Article
Towards an Efficient Sparse Storage Format for the SpMM Kernel in GPUs
- Renzo Marini
Instituto de Computación (INCO), Facultad de Ingeniería, Universidad de la República, Montevideo, Uruguay
, - Ernesto Dufrechou
Instituto de Computación (INCO), Facultad de Ingeniería, Universidad de la República, Montevideo, Uruguay
, - Pablo Ezzatti
Instituto de Computación (INCO), Facultad de Ingeniería, Universidad de la República, Montevideo, Uruguay
Euro-Par 2021: Parallel Processing Workshops•August 2021, pp 104-115• https://doi.org/10.1007/978-3-031-06156-1_9AbstractThe sparse matrix-matrix multiply kernel (SpMM) gained significant interest in the last years due to its applications in data science. In 2018, Zhang and Gruenwald [15] proposed the bitmap-based sparse format bmSparse and described in detail the ...
- 1Citation
MetricsTotal Citations1
- Renzo Marini
- research-article
Selecting optimal SpMV realizations for GPUs via machine learning
- Ernesto Dufrechou
Instituto de Computación (INCO), Facultad de Ingeniería (FING), 56724Univerasidad de la República (UDELAR), Uruguay
, - Pablo Ezzatti
Instituto de Computación (INCO), Facultad de Ingeniería (FING), 56724Univerasidad de la República (UDELAR), Uruguay
, - Enrique S Quintana-Ortí
Depto. de Informática de Sistemas y Computadores, 16774Universitat Politècnica de València, Spain
, - Peter Benner
International Journal of High Performance Computing Applications, Volume 35, Issue 3•May 2021, pp 254-267 • https://doi.org/10.1177/1094342021990738More than 10 years of research related to the development of efficient GPU routines for the sparse matrix-vector product (SpMV) have led to several realizations, each with its own strengths and weaknesses. In this work, we review some of the most ...
- 4Citation
MetricsTotal Citations4
- Ernesto Dufrechou
- Article
Exploring fpga Optimizations to Compute Sparse Numerical Linear Algebra Kernels
- Federico Favaro
Instituto de Ingeniería Eléctrica, Facultad de Ingeniería, Universidad de la República, Montevideo, Uruguay
, - Ernesto Dufrechou
Instituto de Computación, Facultad de Ingeniería, Universidad de la República, Montevideo, Uruguay
, - Pablo Ezzatti
Instituto de Computación, Facultad de Ingeniería, Universidad de la República, Montevideo, Uruguay
, - Juan P. Oliver
Instituto de Ingeniería Eléctrica, Facultad de Ingeniería, Universidad de la República, Montevideo, Uruguay
Applied Reconfigurable Computing. Architectures, Tools, and Applications•April 2020, pp 258-268• https://doi.org/10.1007/978-3-030-44534-8_20AbstractThe solution of sparse triangular linear systems (sptrsv) is the bottleneck of many numerical methods. Thus, it is crucial to count with efficient implementations of such kernel, at least for commonly used platforms. In this sense, Field–...
- 0Citation
MetricsTotal Citations0
- Federico Favaro
- research-article
Accelerating the task/data-parallel version of ILUPACK’s BiCG in multi-CPU/GPU configurations
- José I. Aliaga
Dpto. de Ingeniería y Ciencia de Computadores, Universitat Jaume I, Castellón, Spain
, - Ernesto Dufrechou
Instituto de Computación, Universidad de la República, Montevideo, Uruguay
, - Pablo Ezzatti
Instituto de Computación, Universidad de la República, Montevideo, Uruguay
, - Enrique S. Quintana-Ortí
Dpto. de Ingeniería y Ciencia de Computadores, Universitat Jaume I, Castellón, Spain
Parallel Computing, Volume 85, Issue C•Jul 2019, pp 79-87 • https://doi.org/10.1016/j.parco.2019.02.005Highlights- Exploitation of data parallelism for GPUs.
- Specialized implementations of ...
AbstractILUPACK is a valuable tool for the solution of sparse linear systems via iterative Krylov subspace-based methods. Its relevance for the solution of real problems has motivated several efforts to enhance its performance on parallel ...
- 3Citation
MetricsTotal Citations3
- José I. Aliaga
- article
An efficient GPU version of the preconditioned GMRES method
- José I. Aliaga
Dep. de Ingeniería y Ciencia de la Computación, Universidad Jaime I, Castellón, Spain
, - Ernesto Dufrechou
Instituto de Computación, Facultad de Ingeniería, Universidad de la República, Montevideo, Uruguay
, - Pablo Ezzatti
Instituto de Computación, Facultad de Ingeniería, Universidad de la República, Montevideo, Uruguay
, - Enrique S. Quintana-Ortí
Dep. de Ingeniería y Ciencia de la Computación, Universidad Jaime I, Castellón, Spain
The Journal of Supercomputing, Volume 75, Issue 3•March 2019, pp 1455-1469 • https://doi.org/10.1007/s11227-018-2658-1In a large number of scientific applications, the solution of sparse linear systems is the stage that concentrates most of the computational effort. This situation has motivated the study and development of several iterative solvers, among which ...
- 3Citation
MetricsTotal Citations3
- José I. Aliaga
- research-articlePublished By ACMPublished By ACM
Extending ILUPACK with a Task-Parallel Version of BiCG for Dual-GPU Servers
- José I. Aliaga
Dpto. de Ingeniería y Ciencia de Computadores, Universitat Jaume I, Castellón, Spain
, - Matthias Bollhöfer
Institute of Computational Mathematics, TU Braunschweig, Braunschweig, Germany
, - Ernesto Dufrechou
Instituto de Computación - Universidad de la República, Montevideo, Uruguay
, - Pablo Ezzatti
Instituto de Computación - Universidad de la República, Montevideo, Uruguay
, - Enrique S. Quintana-Ortí
Dpto. de Ingeniería y Ciencia de Computadores, Universitat Jaume I, Castellón, Spain
PMAM'18: Proceedings of the 9th International Workshop on Programming Models and Applications for Multicores and Manycores•February 2018, pp 71-78• https://doi.org/10.1145/3178442.3178450We target the solution of sparse linear systems via iterative Krylov subspace-based methods enhanced with the ILUPACK preconditioner on graphics processing units (GPUs). Concretely, in this work we extend ILUPACK with an implementation of the BiCG ...
- 1Citation
- 94
- Downloads
MetricsTotal Citations1Total Downloads94Last 12 Months1
- José I. Aliaga
- article
Characterizing the efficiency of multicore and manycore processors for the solution of sparse linear systems
- José I. Aliaga
Depto. de Ingeniería y Ciencia de Computadores, Universitat Jaume I, Castellón, Spain 12071
, - María Barreda
Depto. de Ingeniería y Ciencia de Computadores, Universitat Jaume I, Castellón, Spain 12071
, - Ernesto Dufrechou
Instituto de Computación, Universidad de la República, Montevideo, Uruguay 11300
, - Pablo Ezzatti
Instituto de Computación, Universidad de la República, Montevideo, Uruguay 11300
, - Enrique S. Quintana-Ortí
Depto. de Ingeniería y Ciencia de Computadores, Universitat Jaume I, Castellón, Spain 12071
Computer Science - Research and Development, Volume 31, Issue 4•November 2016, pp 175-183 • https://doi.org/10.1007/s00450-015-0299-7We analyze the efficiency of servers equipped with state-of-the-art general-purpose multicore processors as well as platforms based on accelerators such as graphics processing units (GPUs) and the Intel Xeon Phi. Following the proposal recently ...
- 0Citation
MetricsTotal Citations0
- José I. Aliaga
- research-article
Exploiting task and data parallelism in ILUPACK's preconditioned CG solver on NUMA architectures and many-core accelerators
- José I. Aliaga
Departamento de Ingeniería y Ciencia de los Computadores, Universitat Jaume I, Castellón, Spain
, - Rosa M. Badia
Barcelona Supercomputing Center (BSC-CNS) and Artificial Intelligence Research Institute (IIIA), Spanish National Research Council (CSIC), Barcelona, Spain
, - Maria Barreda
Departamento de Ingeniería y Ciencia de los Computadores, Universitat Jaume I, Castellón, Spain
, - Matthias Bollhöfer
Institute of Computational Mathematics, TU Braunschweig, Braunschweig, Germany
, - Ernesto Dufrechou
Instituto de Computación, Universidad de la República, Montevideo, Uruguay
, - Pablo Ezzatti
Instituto de Computación, Universidad de la República, Montevideo, Uruguay
, - Enrique S. Quintana-Ortí
Departamento de Ingeniería y Ciencia de los Computadores, Universitat Jaume I, Castellón, Spain
Parallel Computing, Volume 54, Issue C•May 2016, pp 97-107 • https://doi.org/10.1016/j.parco.2015.12.004Specialized implementations of ILUPACK's iterative solver for NUMA platforms.Specialized implementations of ILUPACK's iterative solver for many-core accelerators.Exploitation of task parallelism via OmpSs runtime (dynamic schedule).Exploitation of task ...
- 4Citation
MetricsTotal Citations4
- José I. Aliaga
- article
Unleashing GPU acceleration for symmetric band linear algebra kernels and model reduction
- Peter Benner
Max Planck Institute for Dynamics of Complex Technical Systems, Magdeburg, Germany
, - Ernesto Dufrechou
Instituto de Computación, Universidad de la República, Montevideo, Uruguay
, - Pablo Ezzatti
Instituto de Computación, Universidad de la República, Montevideo, Uruguay
, - Enrique S. Quintana-Ortí
Departamento de Ingeniería y Ciencia de Computadores, Universidad Jaime I, Castellón, Spain
, - Alfredo Remón
Max Planck Institute for Dynamics of Complex Technical Systems, Magdeburg, Germany
Cluster Computing, Volume 18, Issue 4•Dec 2015, pp 1351-1362 • https://doi.org/10.1007/s10586-015-0489-xLinear algebra operations arise in a myriad of scientific and engineering applications and, therefore, their optimization is targeted by a significant number of high performance computing research efforts. In particular, the matrix multiplication and ...
- 0Citation
MetricsTotal Citations0
- Peter Benner
- article
Extending lyapack for the solution of band Lyapunov equations on hybrid CPU---GPU platforms
- Peter Benner
Max Planck Institute for Dynamics of Complex Technical Systems, Magdeburg, Germany
, - Alfredo Remón
Max Planck Institute for Dynamics of Complex Technical Systems, Magdeburg, Germany
, - Ernesto Dufrechou
Instituto de Computación, Univ. de la República, Montevideo, Uruguay
, - Pablo Ezzatti
Instituto de Computación, Univ. de la República, Montevideo, Uruguay
, - Enrique S. Quintana-Ortí
Depto. de Ingeniería y Ciencia de Computadores, Universidad Jaime I, Castellón, Spain
The Journal of Supercomputing, Volume 71, Issue 2•February 2015, pp 740-750 • https://doi.org/10.1007/s11227-014-1322-7The solution of large-scale Lyapunov equations is an important tool for the solution of several engineering problems arising in optimal control and model order reduction. In this work, we investigate the case when the coefficient matrix of the equations ...
- 1Citation
MetricsTotal Citations1
- Peter Benner
- article
Another step to the full GPU implementation of the weather research and forecasting model
- Juan Pablo Silva
Instituto de Computación, Facultad de Ingeniería, Universidad de la República, Montevideo, Uruguay
, - José Hagopian
Instituto de Computación, Facultad de Ingeniería, Universidad de la República, Montevideo, Uruguay
, - Marcel Burdiat
Instituto de Computación, Facultad de Ingeniería, Universidad de la República, Montevideo, Uruguay
, - Ernesto Dufrechou
Instituto de Computación, Facultad de Ingeniería, Universidad de la República, Montevideo, Uruguay
, - Martín Pedemonte
Instituto de Computación, Facultad de Ingeniería, Universidad de la República, Montevideo, Uruguay
, - Alejandro Gutiérrez
IMFIA, Facultad de Ingeniería, Universidad de la República, Montevideo, Uruguay
, - Gabriel Cazes
IMFIA, Facultad de Ingeniería, Universidad de la República, Montevideo, Uruguay
, - Pablo Ezzatti
Instituto de Computación, Facultad de Ingeniería, Universidad de la República, Montevideo, Uruguay
The Journal of Supercomputing, Volume 70, Issue 2•November 2014, pp 746-755 • https://doi.org/10.1007/s11227-014-1193-yUruguay is currently undergoing a gradual process of inclusion of wind energy in its matrix of electric power generation. In this context, a computational tool has been developed to predict the electrical power that will be injected into the grid. The ...
- 1Citation
MetricsTotal Citations1
- Juan Pablo Silva
- Article
Accelerating Band Linear Algebra Operations on GPUs with Application in Model Reduction
- Peter Benner
Max Planck Institute for Dynamics of Complex Technical Systems, Magdeburg, Germany
, - Ernesto Dufrechou
Instituto de Computación, Universidad de la República, Montevideo, Uruguay
, - Pablo Ezzatti
Instituto de Computación, Universidad de la República, Montevideo, Uruguay
, - Pablo Igounet
Instituto de Computación, Universidad de la República, Montevideo, Uruguay
, - Enrique S. Quintana-Ortí
Dep. de Ingeniería y Ciencia de la Computación, Universidad Jaime I, Castellón, Spain
, - Alfredo Remón
Max Planck Institute for Dynamics of Complex Technical Systems, Magdeburg, Germany
Proceedings of the 14th International Conference on Computational Science and Its Applications ICCSA 2014 - Volume 8584•June 2014, pp 386-400• https://doi.org/10.1007/978-3-319-09153-2_29In this paper we present new hybrid CPU-GPU routines to accelerate the solution of linear systems, with band coefficient matrix, by off-loading the major part of the computations to the GPU and leveraging highly tuned implementations of the BLAS for the ...
- 1Citation
MetricsTotal Citations1
- Peter Benner
- Article
Leveraging Data-Parallelism in ILUPACK using Graphics Processors
ISPDC '14: Proceedings of the 2014 IEEE 13th International Symposium on Parallel and Distributed Computing•June 2014, pp 119-126• https://doi.org/10.1109/ISPDC.2014.19In this paper, we address the exploitation of data parallelism for the solution of sparse symmetric positive definite linear systems via iterative methods on Graphics Processing Units (GPUs). In particular, we accelerate the preconditioned CG-based ...
- 1Citation
MetricsTotal Citations1
- Article
A Study on Mixed Precision Techniques for a GPU-based SIP Solver
WAMCA '12: Proceedings of the 2012 Third Workshop on Applications for Multi-Core Architecture•October 2012, pp 7-12• https://doi.org/10.1109/WAMCA.2012.17This article presents the study and application of mixed precision techniques to accelerate a GPU-based implementation of the Strongly Implicit Procedure (SIP) to solve hepta-diagonal linear systems. In particular, two different options to incorporate ...
- 1Citation
MetricsTotal Citations1
Author Profile Pages
- Description: The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM bibliographic database, the Guide. Coverage of ACM publications is comprehensive from the 1950's. Coverage of other publishers generally starts in the mid 1980's. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community.
Please see the following 2007 Turing Award winners' profiles as examples: - History: Disambiguation of author names is of course required for precise identification of all the works, and only those works, by a unique individual. Of equal importance to ACM, author name normalization is also one critical prerequisite to building accurate citation and download statistics. For the past several years, ACM has worked to normalize author names, expand reference capture, and gather detailed usage statistics, all intended to provide the community with a robust set of publication metrics. The Author Profile Pages reveal the first result of these efforts.
- Normalization: ACM uses normalization algorithms to weigh several types of evidence for merging and splitting names.
These include:- co-authors: if we have two names and cannot disambiguate them based on name alone, then we see if they have a co-author in common. If so, this weighs towards the two names being the same person.
- affiliations: names in common with same affiliation weighs toward the two names being the same person.
- publication title: names in common whose works are published in same journal weighs toward the two names being the same person.
- keywords: names in common whose works address the same subject matter as determined from title and keywords, weigh toward being the same person.
The more conservative the merging algorithms, the more bits of evidence are required before a merge is made, resulting in greater precision but lower recall of works for a given Author Profile. Many bibliographic records have only author initials. Many names lack affiliations. With very common family names, typical in Asia, more liberal algorithms result in mistaken merges.
Automatic normalization of author names is not exact. Hence it is clear that manual intervention based on human knowledge is required to perfect algorithmic results. ACM is meeting this challenge, continuing to work to improve the automated merges by tweaking the weighting of the evidence in light of experience.
- Bibliometrics: In 1926, Alfred Lotka formulated his power law (known as Lotka's Law) describing the frequency of publication by authors in a given field. According to this bibliometric law of scientific productivity, only a very small percentage (~6%) of authors in a field will produce more than 10 articles while the majority (perhaps 60%) will have but a single article published. With ACM's first cut at author name normalization in place, the distribution of our authors with 1, 2, 3..n publications does not match Lotka's Law precisely, but neither is the distribution curve far off. For a definition of ACM's first set of publication statistics, see Bibliometrics
- Future Direction:
The initial release of the Author Edit Screen is open to anyone in the community with an ACM account, but it is limited to personal information. An author's photograph, a Home Page URL, and an email may be added, deleted or edited. Changes are reviewed before they are made available on the live site.
ACM will expand this edit facility to accommodate more types of data and facilitate ease of community participation with appropriate safeguards. In particular, authors or members of the community will be able to indicate works in their profile that do not belong there and merge others that do belong but are currently missing.
A direct search interface for Author Profiles will be built.
An institutional view of works emerging from their faculty and researchers will be provided along with a relevant set of metrics.
It is possible, too, that the Author Profile page may evolve to allow interested authors to upload unpublished professional materials to an area available for search and free educational use, but distinct from the ACM Digital Library proper. It is hard to predict what shape such an area for user-generated content may take, but it carries interesting potential for input from the community.
Bibliometrics
The ACM DL is a comprehensive repository of publications from the entire field of computing.
It is ACM's intention to make the derivation of any publication statistics it generates clear to the user.
- Average citations per article = The total Citation Count divided by the total Publication Count.
- Citation Count = cumulative total number of times all authored works by this author were cited by other works within ACM's bibliographic database. Almost all reference lists in articles published by ACM have been captured. References lists from other publishers are less well-represented in the database. Unresolved references are not included in the Citation Count. The Citation Count is citations TO any type of work, but the references counted are only FROM journal and proceedings articles. Reference lists from books, dissertations, and technical reports have not generally been captured in the database. (Citation Counts for individual works are displayed with the individual record listed on the Author Page.)
- Publication Count = all works of any genre within the universe of ACM's bibliographic database of computing literature of which this person was an author. Works where the person has role as editor, advisor, chair, etc. are listed on the page but are not part of the Publication Count.
- Publication Years = the span from the earliest year of publication on a work by this author to the most recent year of publication of a work by this author captured within the ACM bibliographic database of computing literature (The ACM Guide to Computing Literature, also known as "the Guide".
- Available for download = the total number of works by this author whose full texts may be downloaded from an ACM full-text article server. Downloads from external full-text sources linked to from within the ACM bibliographic space are not counted as 'available for download'.
- Average downloads per article = The total number of cumulative downloads divided by the number of articles (including multimedia objects) available for download from ACM's servers.
- Downloads (cumulative) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server since the downloads were first counted in May 2003. The counts displayed are updated monthly and are therefore 0-31 days behind the current date. Robotic activity is scrubbed from the download statistics.
- Downloads (12 months) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 12-month period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (12-month download counts for individual works are displayed with the individual record.)
- Downloads (6 weeks) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 6-week period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (6-week download counts for individual works are displayed with the individual record.)
ACM Author-Izer Service
Summary Description
ACM Author-Izer is a unique service that enables ACM authors to generate and post links on both their homepage and institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge.
Downloads from these sites are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to definitive version of ACM articles should reduce user confusion over article versioning.
ACM Author-Izer also extends ACM’s reputation as an innovative “Green Path” publisher, making ACM one of the first publishers of scholarly works to offer this model to its authors.
To access ACM Author-Izer, authors need to establish a free ACM web account. Should authors change institutions or sites, they can utilize the new ACM service to disable old links and re-authorize new links for free downloads from a different site.
How ACM Author-Izer Works
Authors may post ACM Author-Izer links in their own bibliographies maintained on their website and their own institution’s repository. The links take visitors to your page directly to the definitive version of individual articles inside the ACM Digital Library to download these articles for free.
The Service can be applied to all the articles you have ever published with ACM.
Depending on your previous activities within the ACM DL, you may need to take up to three steps to use ACM Author-Izer.
For authors who do not have a free ACM Web Account:
- Go to the ACM DL http://dl.acm.org/ and click SIGN UP. Once your account is established, proceed to next step.
For authors who have an ACM web account, but have not edited their ACM Author Profile page:
- Sign in to your ACM web account and go to your Author Profile page. Click "Add personal information" and add photograph, homepage address, etc. Click ADD AUTHOR INFORMATION to submit change. Once you receive email notification that your changes were accepted, you may utilize ACM Author-izer.
For authors who have an account and have already edited their Profile Page:
- Sign in to your ACM web account, go to your Author Profile page in the Digital Library, look for the ACM Author-izer link below each ACM published article, and begin the authorization process. If you have published many ACM articles, you may find a batch Authorization process useful. It is labeled: "Export as: ACM Author-Izer Service"
ACM Author-Izer also provides code snippets for authors to display download and citation statistics for each “authorized” article on their personal pages. Downloads from these pages are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to the definitive version of ACM articles should reduce user confusion over article versioning.
Note: You still retain the right to post your author-prepared preprint versions on your home pages and in your institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library. But any download of your preprint versions will not be counted in ACM usage statistics. If you use these AUTHOR-IZER links instead, usage by visitors to your page will be recorded in the ACM Digital Library and displayed on your page.
FAQ
- Q. What is ACM Author-Izer?
A. ACM Author-Izer is a unique, link-based, self-archiving service that enables ACM authors to generate and post links on either their home page or institutional repository for visitors to download the definitive version of their articles for free.
- Q. What articles are eligible for ACM Author-Izer?
- A. ACM Author-Izer can be applied to all the articles authors have ever published with ACM. It is also available to authors who will have articles published in ACM publications in the future.
- Q. Are there any restrictions on authors to use this service?
- A. No. An author does not need to subscribe to the ACM Digital Library nor even be a member of ACM.
- Q. What are the requirements to use this service?
- A. To access ACM Author-Izer, authors need to have a free ACM web account, must have an ACM Author Profile page in the Digital Library, and must take ownership of their Author Profile page.
- Q. What is an ACM Author Profile Page?
- A. The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM Digital Library. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community. Please visit the ACM Author Profile documentation page for more background information on these pages.
- Q. How do I find my Author Profile page and take ownership?
- A. You will need to take the following steps:
- Create a free ACM Web Account
- Sign-In to the ACM Digital Library
- Find your Author Profile Page by searching the ACM Digital Library for your name
- Find the result you authored (where your author name is a clickable link)
- Click on your name to go to the Author Profile Page
- Click the "Add Personal Information" link on the Author Profile Page
- Wait for ACM review and approval; generally less than 24 hours
- Q. Why does my photo not appear?
- A. Make sure that the image you submit is in .jpg or .gif format and that the file name does not contain special characters
- Q. What if I cannot find the Add Personal Information function on my author page?
- A. The ACM account linked to your profile page is different than the one you are logged into. Please logout and login to the account associated with your Author Profile Page.
- Q. What happens if an author changes the location of his bibliography or moves to a new institution?
- A. Should authors change institutions or sites, they can utilize ACM Author-Izer to disable old links and re-authorize new links for free downloads from a new location.
- Q. What happens if an author provides a URL that redirects to the author’s personal bibliography page?
- A. The service will not provide a free download from the ACM Digital Library. Instead the person who uses that link will simply go to the Citation Page for that article in the ACM Digital Library where the article may be accessed under the usual subscription rules.
However, if the author provides the target page URL, any link that redirects to that target page will enable a free download from the Service.
- Q. What happens if the author’s bibliography lives on a page with several aliases?
- A. Only one alias will work, whichever one is registered as the page containing the author’s bibliography. ACM has no technical solution to this problem at this time.
- Q. Why should authors use ACM Author-Izer?
- A. ACM Author-Izer lets visitors to authors’ personal home pages download articles for no charge from the ACM Digital Library. It allows authors to dynamically display real-time download and citation statistics for each “authorized” article on their personal site.
- Q. Does ACM Author-Izer provide benefits for authors?
- A. Downloads of definitive articles via Author-Izer links on the authors’ personal web page are captured in official ACM statistics to more accurately reflect usage and impact measurements.
Authors who do not use ACM Author-Izer links will not have downloads from their local, personal bibliographies counted. They do, however, retain the existing right to post author-prepared preprint versions on their home pages or institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library.
- Q. How does ACM Author-Izer benefit the computing community?
- A. ACM Author-Izer expands the visibility and dissemination of the definitive version of ACM articles. It is based on ACM’s strong belief that the computing community should have the widest possible access to the definitive versions of scholarly literature. By linking authors’ personal bibliography with the ACM Digital Library, user confusion over article versioning should be reduced over time.
In making ACM Author-Izer a free service to both authors and visitors to their websites, ACM is emphasizing its continuing commitment to the interests of its authors and to the computing community in ways that are consistent with its existing subscription-based access model.
- Q. Why can’t I find my most recent publication in my ACM Author Profile Page?
- A. There is a time delay between publication and the process which associates that publication with an Author Profile Page. Right now, that process usually takes 4-8 weeks.
- Q. How does ACM Author-Izer expand ACM’s “Green Path” Access Policies?
- A. ACM Author-Izer extends the rights and permissions that authors retain even after copyright transfer to ACM, which has been among the “greenest” publishers. ACM enables its author community to retain a wide range of rights related to copyright and reuse of materials. They include:
- Posting rights that ensure free access to their work outside the ACM Digital Library and print publications
- Rights to reuse any portion of their work in new works that they may create
- Copyright to artistic images in ACM’s graphics-oriented publications that authors may want to exploit in commercial contexts
- All patent rights, which remain with the original owner