Special Issue "Algorithms for Multi Core Parallel Computation"
A special issue of Algorithms (ISSN 1999-4893).
Deadline for manuscript submissions: closed (30 September 2013)
Prof. Dr. Ken Hawick
Institute of Natural & Mathematical Sciences, Massey University - Albany, Auckland, New Zealand
Phone: +64 9 414 0800 ext. 43141
Fax: +64 9 441 8181
Multi-cored CPUs and many-cored accelerators such as GPUs and FPGAs are becoming commonly affordable and available platforms for parallel computing. Developing highly-efficient algorithms and applications for these platforms is an exciting area and one that presents even greater challenges as core counts increase. Algorithms that make optimal use of hybrid many-cored processors and accelerators also stretch the capabilities of existing parallel software and tools. Approaches vary from classic data-parallelism algorithms deployed on massively-cored accelerators to thread or message-managed task communication on many-core central processing units. The close-coupling potential of having many cores on a single chip or device presents opportunities for developing new multi-core algorithms that must of necessity go beyond the parallel supercomputer algorithms of yester-year.
Hybrid algorithms making use of a whole spectrum of different parallel granularities are possible on platforms with multiple accelerators driven by multiple CPU cores. Recent developments have taken the number of economically feasible CPU cores well into double figures. It is likely that CPU and GPU solutions will continue to approach the many-core problem from different ends of the
granularity scale, but with interesting hybrids emerging and with a complex trade-off space where they meet in the middle. Algorithms that can exploit this topical granularity spectrum will grow in importance. Software that embodies such algorithms will have a profound impact in a number of application markets and industries including: simulation and modelling; games and animation; and many others where many cores can be kept busy.
Quality articles describing innovative and original work in algorithms that use many-cored devices are sought for a special issue on "Algorithms for Multi-Core Parallel Computation." Reported work on algorithms using topical new and emerging devices such as:
multi-cored CPUs; many-cored GPUs; or other CPU/accelerator combinations using many cores, is particularly sought.
Prof. Dr. Ken Hawick
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. Papers will be published continuously (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as 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 refereed through a 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 quarterly 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 300 CHF (Swiss Francs). English correction and/or formatting fees of 250 CHF (Swiss Francs) will be charged in certain cases for those articles accepted for publication that require extensive additional formatting and/or English corrections.
- many-core algorithms
- many-core devices
- performance accelerators
- multi-accelerator algorithms
- multi-cored CPU
Algorithms 2013, 6(4), 857-870; doi:10.3390/a6040857
Received: 27 September 2013; in revised form: 12 November 2013 / Accepted: 18 November 2013 / Published: 25 November 2013| PDF Full-text (226 KB)
Algorithms 2013, 6(4), 805-823; doi:10.3390/a6040805
Received: 15 September 2013; in revised form: 8 November 2013 / Accepted: 11 November 2013 / Published: 18 November 2013| PDF Full-text (260 KB)
Algorithms 2013, 6(4), 747-761; doi:10.3390/a6040747
Received: 17 September 2013; in revised form: 16 October 2013 / Accepted: 21 October 2013 / Published: 1 November 2013| PDF Full-text (1431 KB)
Algorithms 2013, 6(4), 702-725; doi:10.3390/a6040702
Received: 9 August 2013; in revised form: 16 October 2013 / Accepted: 21 October 2013 / Published: 1 November 2013| Cited by 1 | PDF Full-text (315 KB)
Algorithms 2013, 6(4), 618-635; doi:10.3390/a6040618
Received: 15 August 2013; in revised form: 13 September 2013 / Accepted: 18 September 2013 / Published: 3 October 2013| PDF Full-text (244 KB)
Last update: 7 May 2013