Computational Models and Algorithms for Domain-Specific Accelerators

A special issue of Algorithms (ISSN 1999-4893).

Deadline for manuscript submissions: closed (31 December 2021) | Viewed by 314

Special Issue Editors

Department of Information Engineering, University of Padova, Via Gradenigo 6/A, 35131 Padova, PD, Italy
Interests: computer science; high performance computing; mobile computing; applied computing; applications of machine learning
Special Issues, Collections and Topics in MDPI journals
Department of Information Engineering, University of Padova, I-35131 Padova, Italy
Interests: algorithms and data structures for big data; parallel and memory-efficient algorithms; algorithms for similarity search; models of computation
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

At a time when the demand for computing power is on the rise in several domains, the hitting of fundamental limits has almost flattened the curve of performance gains previously offered, generation after generation, by general-purpose processors. The reaction so far has been designing domain-specific accelerators (DSAs)—specialized computational units that feature increased computational power and/or power efficiency once again, but only for specific computations. However, there is mounting scientific evidence that DSAs can be also effective in computations not originally intended by their designers: for instance, sparse matrix-matrix multiplication and discrete Fourier transform can be implemented efficiently on NVIDIA’s Tensor Core Units, or Google’s Tensor Processing Units.

For this Special Issue, we are inviting computer scientists to submit original results or surveys investigating the implications of DSAs in a broad sense. Possible research topics include, but are not limited to, the following.

  • Computational models for DSAs.
  • Design and analysis of algorithms for DSAs, as well as experimental results on the applications of such algorithms.
  • Theoretical limits to processor specialization.

We particularly welcome contributions for computations not originally intended by the designers of the DSAs, and/or in unconventional application domains, and contributions concerning computational models that encompass multiple DSAs or classes of DSAs.

This is a joint special issue with Mathematics.

Dr. Carlo Fantozzi
Dr. Francesco Silvestri
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • Domain-specific accelerators
  • High-performance computing
  • Computational models
  • Bridging models
  • Analysis of algorithms
  • Parallel algorithms
  • Algorithms and complexity
  • Theory of computation

Published Papers

There is no accepted submissions to this special issue at this moment.
Back to TopTop